Dynamic program slicing
A dynamic program slice is an executable subset of the original program that produces the same computations on a subset of selected variables and inputs. It differs from the static slice [\textit{M. Weiser}, IEEE Trans. Software Eng. SE-10, 352-357 (1984; Zbl 0552.68004)] in that it is entirely defined on the basis of a computation. The two main advantages are the following: Arrays and dynamic data structures can be handled more precisely and the size of slice can be significantly reduced, leading to a finer localization of the fault. The approach is being investigated as a possible extension of the debugging capabilities of STAD, a system recently developed by the authors for testing and debugging.
- A Comparison of Two Algorithms for Global Data Flow Analysis
- A Data Flow Oriented Program Testing Strategy
- A fast algorithm for finding dominators in a flowgraph
- AIDA–A dynamic data flow anomaly detection system for pascal programs
- Certification of programs for secure information flow
- Data Flow Analysis for Procedural Languages
- Detection of Data Flow Anomaly Through Program Instrumentation
- scientific article; zbMATH DE number 3660783 (Why is no real title available?)
- scientific article; zbMATH DE number 3735091 (Why is no real title available?)
- scientific article; zbMATH DE number 3560709 (Why is no real title available?)
- scientific article; zbMATH DE number 3592938 (Why is no real title available?)
- Information-flow and data-flow analysis of while-programs
- Program Slicing
- The theory of languages
- Slicing communicating automata specifications: Polynomial algorithms for model reduction
- An efficient method for computing dynamic program slices
- Slicing programs in the presence of errors
- A compact execution history for dynamic slicing
- Experimental Evaluation of program slicing for fault localization
- Integrating different versions of programs with backward and forward slices
- Combining dynamic and static slicing for analysing assembler
- Dynamic slicing of lazy functional programs based on redex trails
- Theoretical foundations of dynamic program slicing
- On slicing of programs with input statements
- Combining runtime checking and slicing to improve Maude error diagnosis
- On the computational complexity of dynamic slicing problems for program schemas
- Program Slicing
- On detecting environment sensitivity using slicing
- Dynamic slicing of aspect-oriented programs
- scientific article; zbMATH DE number 148937 (Why is no real title available?)
- Automated debugging based on a constraint model of the program and a test case
- Causally Consistent Dynamic Slicing
- scientific article; zbMATH DE number 1870530 (Why is no real title available?)
- Understanding program slices
- Dynamic slicing: a generic analysis based on a natural semantics format
- Abstract program slicing: an abstract interpretation-based approach to program slicing
- The value of slicing while debugging
- On the relationship between model-based debugging and program slicing
- Maximal and Minimal Dynamic Petri Net Slicing
- Using Relational Verification for Program Slicing
- A parallel algorithm for static program slicing
- Debugging Maude programs via runtime assertion checking and trace slicing
- Simulation of operational semantics of machine instructions
- Explaining safety violations in real-time systems
- A trajectory-based strict semantics for program slicing
This page was built for publication: Dynamic program slicing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1110308)
