A compact execution history for dynamic slicing

A slice of a program P with respect to a slicing criterion C ≡ ({var}, c_stmt) is a subset of the program which includes all statements that directly or indirectly affect the value of variable var in c_stmt [1,10–12]. A static slice includes all statements which might affect the value of var. It is constructed using program analysis techniques. A dynamic slice consists of only those statements that actually influence the value of var in an execution of the program. It is built using run-time information. A dynamic slice is more precise than a static slice because it contains only those statements which have actually influenced var in an execution. A dynamic slice of a program is constructed by analyzing an execution history of the program to discover data and control dependences.1 A complete execution history records all actions performed during an execution of a program. A lot of this information is

[1]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[2]  John Banning,et al.  : An Efficient , 2022 .

[3]  Dhananjay M. Dhamdhere,et al.  Dynamic currency determination in optimized programs , 1998, TOPL.

[4]  Philip J. Hatcher,et al.  Compiling C* programs for a hypercube multicomputer , 1988, PPoPP 1988.

[5]  Frank Tip,et al.  A survey of program slicing techniques , 1994, J. Program. Lang..

[6]  Jeff Thomas,et al.  Poor man's watchpoints , 1995, SIGP.

[7]  Ken Kennedy,et al.  Interprocedural side-effect analysis in linear time , 1988, PLDI '88.

[8]  David W. Binkley,et al.  Interprocedural slicing using dependence graphs , 1988, SIGP.

[9]  AgrawalHiralal,et al.  Dynamic program slicing , 1990 .

[10]  Janusz W. Laski,et al.  Dynamic Program Slicing , 1988, Inf. Process. Lett..

[11]  David W. Binkley,et al.  Program slicing , 2008, 2008 Frontiers of Software Maintenance.

[12]  Joe D. Warren,et al.  The program dependence graph and its use in optimization , 1984, TOPL.