Theoretical foundations of dynamic program slicing
From MaRDI portal
Publication:2503318
DOI10.1016/j.tcs.2006.01.012zbMath1097.68026OpenAlexW2100420477WikidataQ59610367 ScholiaQ59610367MaRDI QIDQ2503318
Ákos Kiss, Mark Harman, Tibor Gyimóthy, Bogdan Korel, David W. Binkley, Sebastian Danicic
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.012
Related Items
Abstract Program Slicing, A unifying theory of control dependence and its application to arbitrary program structures, Cut branches before looking for bugs: certifiably sound verification on relaxed slices, A trajectory-based strict semantics for program slicing, On the computational complexity of dynamic slicing problems for program schemas
Uses Software
Cites Work
- Dynamic program slicing
- Non-standard semantics for program slicing
- Slicing programs in the presence of errors
- Equivalence of conservative, free, linear program schemas is decidable
- Notes on avoiding ``go to statements
- Program Slicing
- The program dependence graph and its use in optimization
- Eliminating go to's while preserving program structure