-
- David Binkley
- Loyola College in Maryland, Baltimore, MD
-
- Mark Harman
- King's College London, London, UK
-
- Jens Krinke
- FernUniversität in Hagen, Hagen, Germany
書誌事項
- 公開日
- 2007-11
- 権利情報
-
- https://www.acm.org/publications/policies/copyright_policy#Background
- DOI
-
- 10.1145/1290520.1290523
- 公開者
- Association for Computing Machinery (ACM)
この論文をさがす
説明
<jats:p>This article presents results from a study of techniques that improve the performance of graph-based interprocedural slicing of the System Dependence Graph (SDG). This is useful in “massive slicing” where slices are required for many or all of the possible set of slicing criteria. Several different techniques are considered, including forming strongly connected components, topological sorting, and removing transitive edges.</jats:p> <jats:p>Data collected from a test bed of just over 1,000,000 lines of code are presented. This data illustrates the impact on computation time of the techniques. Together, the best combination produces a 71% reduction in run-time (and a 64% reduction in memory usage). The complete set of techniques also illustrates the point at which faster computation is not viable due to prohibitive preprocessing costs.</jats:p>
収録刊行物
-
- ACM Transactions on Programming Languages and Systems
-
ACM Transactions on Programming Languages and Systems 30 (1), 3-, 2007-11
Association for Computing Machinery (ACM)
