Cost effective dynamic program slicing
- 9 June 2004
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A compact execution history for dynamic slicingInformation Processing Letters, 2003
- Efficient representations and abstractions for quantifying and exploiting data reference localityPublished by Association for Computing Machinery (ACM) ,2001
- Whole program pathsPublished by Association for Computing Machinery (ACM) ,1999
- Precise interprocedural choppingPublished by Association for Computing Machinery (ACM) ,1995
- Hybrid slicingPublished by Association for Computing Machinery (ACM) ,1995
- Forward computation of dynamic program slicesPublished by Association for Computing Machinery (ACM) ,1994
- Debugging with dynamic slicing and backtrackingSoftware: Practice and Experience, 1993
- Dynamic program slicingPublished by Association for Computing Machinery (ACM) ,1990
- Dynamic program slicingInformation Processing Letters, 1988
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987