An efficient method for computing dynamic program slices

DOI10.1016/S0020-0190(01)00202-2MaRDI QIDQ1603535zbMATH OpenFDO

Authors R. Smith

Publication date 14 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Control flow graphDynamic slicingProgram debuggingProgram dependence graphProgram slicingStatic slicing

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• Dynamic program slicing
• Efficient comparison of program slices
• An optimal algorithm for the construction of the system dependence graph
• Program Slicing
• On the computational complexity of dynamic slicing problems for program schemas

Cites work

• Dynamic program slicing
• Program Slicing

Cited in

(7)

• Causally Consistent Dynamic Slicing
• scientific article; zbMATH DE number 1870530 (Why is no real title available?)
• Efficient comparison of program slices
• Dynamic slicing of aspect-oriented programs
• An optimal algorithm for the construction of the system dependence graph
• Dynamic program slicing
• Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm

This page was built for publication: An efficient method for computing dynamic program slices

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