Slicing programs in the presence of errors

DOI10.1007/BF01213536zbMATH Open0857.68017OpenAlexW1994195424MaRDI QIDQ1815347FDOQ1815347

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)

Cites Work

• Dynamic program slicing
• Title not available (Why is that?)
• Program Slicing
• The program dependence graph and its use in optimization
• A parallel algorithm for static program slicing

Cited In (5)

• 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
• On the relationship between model-based debugging and program slicing

   Recommendations

• Program Slicing 👍 👎
• A trajectory-based strict semantics for program slicing 👍 👎
• Title not available (Why is that?) 👍 👎
• Dynamic program slicing 👍 👎
• On Slicing of Programs with Input Statements 👍 👎

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)