Computing amorphous program slices using dependence graphs
- 28 February 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 519-525
- https://doi.org/10.1145/298151.298432
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Using program slicing to simplify testingSoftware Testing, Verification and Reliability, 1995
- Speeding up slicingPublished by Association for Computing Machinery (ACM) ,1994
- Static slicing in the presence of goto statementsACM Transactions on Programming Languages and Systems, 1994
- Precise executable interprocedural slicesACM Letters on Programming Languages and Systems, 1993
- Interprocedural slicing using dependence graphsACM Transactions on Programming Languages and Systems, 1990
- Integrating noninterfering versions of programsACM Transactions on Programming Languages and Systems, 1989
- A rewriting semantics for program dependence graphsPublished by Association for Computing Machinery (ACM) ,1989
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987