Speeding up slicing

1 December 1994

journal article
Published by Association for Computing Machinery (ACM) in ACM SIGSOFT Software Engineering Notes

Vol. 19 (5) , 11-20
https://doi.org/10.1145/195274.195287

Abstract

Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program representation called the system dependence graph. This paper defines a new algorithm for slicing with system dependence graphs that is asymptotically faster than the previous one. A preliminary experimental study indicates that the new algorithm is also significantly faster in practice, providing roughly a 6-fold speedup on examples of 348 to 757 lines.

Keywords

This publication has 19 references indexed in Scilit:

Slicing programs with arbitrary control-flow
Published by Springer Nature ,2005
Eliminating false data dependences using the Omega test
ACM SIGPLAN Notices, 1992
Using program slicing in software maintenance
IEEE Transactions on Software Engineering, 1991
Practical dependence testing
ACM SIGPLAN Notices, 1991
Efficient and exact data dependence analysis
ACM SIGPLAN Notices, 1991
Analysis of pointers and structures
ACM SIGPLAN Notices, 1990
Identifying the semantic and textual differences between two versions of a program
ACM SIGPLAN Notices, 1990
Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems, 1990
Integrating noninterfering versions of programs
ACM Transactions on Programming Languages and Systems, 1989
Dependence analysis for pointer variables
ACM SIGPLAN Notices, 1989