Slicing programs in the presence of errors

DOI10.1007/BF01213536zbMath0857.68017OpenAlexW1994195424MaRDI QIDQ1815347

Mark Harman, Dan Simpson, Sebastian Danicic

Publication date: 3 March 1997

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01213536

zbMATH Keywords

slicing algorithms

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (4)

Cut branches before looking for bugs: certifiably sound verification on relaxed slices ⋮ Theoretical foundations of dynamic program slicing ⋮ On the relationship between model-based debugging and program slicing ⋮ Equivalence of conservative, free, linear program schemas is decidable

Cites Work

• Unnamed Item
• A parallel algorithm for static program slicing
• Dynamic program slicing
• Program Slicing
• The program dependence graph and its use in optimization

This page was built for publication: Slicing programs in the presence of errors