A parallel algorithm for static program slicing
From MaRDI portal
Publication:672833
DOI10.1016/0020-0190(95)00170-0zbMATH Open0875.68506OpenAlexW2056368582WikidataQ59610793 ScholiaQ59610793MaRDI QIDQ672833FDOQ672833
Authors: Sebastian Danicic, Mark Harman, Yoga Sivagurunathan
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00170-0
Recommendations
Cites Work
Cited In (10)
- An overview of slicing techniques for object-oriented programs
- Equivalence of conservative, free, linear program schemas is decidable
- Approach of concurrent object-oriented program slicing based on LTL property
- Slicing programs in the presence of errors
- Inter-procedural static slicing using advanced caching algorithm
- Title not available (Why is that?)
- On the relationship between model-based debugging and program slicing
- Efficient comparison of program slices
- Program Slicing
- A parallel algorithm for static program slicing
This page was built for publication: A parallel algorithm for static program slicing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672833)