Slicing programs in the presence of errors

DOI10.1007/BF01213536MaRDI QIDQ1815347zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Program Slicing
• A trajectory-based strict semantics for program slicing
• scientific article; zbMATH DE number 2087514
• Dynamic program slicing
• On slicing of programs with input statements

Cites work

• scientific article; zbMATH DE number 5254145 (Why is no real title available?)
• A parallel algorithm for static program slicing
• Dynamic program slicing
• Program Slicing
• The program dependence graph and its use in optimization

Cited in

(13)

• Cut branches before looking for bugs: certifiably sound verification on relaxed slices
• Equivalence of conservative, free, linear program schemas is decidable
• Type error slicing in implicitly typed higher-order languages
• Theoretical foundations of dynamic program slicing
• Cut branches before looking for bugs: sound verification on relaxed slices
• Assertion-based slicing and slice graphs
• On the relationship between model-based debugging and program slicing
• Combining preprocessor slicing with C/C++ language slicing
• On slicing of programs with input statements
• Program Slicing
• A trajectory-based strict semantics for program slicing
• A non-standard semantics for program slicing and dependence analysis
• A generic program slicing technique based on language definitions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815347)