Interprocedural dynamic slicing with applications to debugging and testing /
Abstract: "The needs of maintenance and modification demand that large programs be decomposed into manageable parts. Program slicing is one method for such decomposition. A program slice with respect to a specified variable at some program point consists of those parts of the program that may d...
Sparad:
| OCLC: | 31693910 |
|---|---|
| Huvudupphovsman: | |
| Institutionell upphovsman: | |
| Språk: | English |
| Publicerad: |
Linköping, Sweden :
Linköping University, Dept. of Computer and Information Science,
[1993]
|
| Serie: | Linköping studies in science and technology. Dissertation ;
no. 297. |
| Ämnen: | |
| Materialtyp: | Lärdomsprov Monograph Note that CRL will digitize material from the collection when copyright allows. |
| Sammanfattning: | Abstract: "The needs of maintenance and modification demand that large programs be decomposed into manageable parts. Program slicing is one method for such decomposition. A program slice with respect to a specified variable at some program point consists of those parts of the program that may directly or indirectly affect the value of that variable at the particular program point. This is useful for understanding dependences within programs. A static program slice is computed using static data and control flow analysis and is valid for all possible executions of the program. Static slices are often imprecise, i.e., they contain unnecessarily large parts of the program. Dynamic slices, however, are precise but are valid only for a single execution of the program. Interprocedural dynamic slices can be computed for programs with procedures, and these slices consists of all executed call statements which are relevant for the computation of the specified variable at the specified program point. This thesis presents the first technique for interprocedural dynamic slicing which deals with procedures/functions at the abstract level. This technique first generates summary information for each procedure call (or function application), then represents a program as a summary graph of dynamic dependences. A slice on this graph consists of vertices for all procedure calls of the program that affect the value of a given variable at the specified program point. The amount of information recorded by this method is considerably less than what is needed by previous methods for dynamic slicing, since it only depends on the size of the program's execution tree, i.e., the number of executed procedure calls, which is smaller than a trace of all executed statements. The interprocedural dynamic slicing method is applicable in at least two areas, program debugging and data flow testing. Both of these applications can be made more effective when using dynamic dependence information collected during program execution. We conclude that the interprocedural dynamic slicing method is superior to other slicing methods when precise dependence information for a specific set of input data values at the procedural abstraction level is relevant." |
|---|---|
| Beskrivning: | "30 april 1993." |
| Fysisk beskrivning: | ix, 190 p. : ill. ; 30 cm. |
| Bibliografi: | Includes bibliographical references. |
| ISBN: | 9178710650 |
| Utgivningsort: | Sweden. |