@inproceedings{0190042416ba4d6eac2c4a2fe6c4c8be,
title = "Speeding up slicing",
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 = "Dynamic programming, Dynamic transitive closure, Flow-sensitive summary information, Program debugging, Program dependence graph, Program slicing, Realizable path",
author = "Thomas Reps and Susan Horwitz and Mooly Sagiv and Genevieve Rosay",
note = "Publisher Copyright: {\textcopyright} 1994 ACM.; 2nd ACM SIGSOFT Symposium on Foundations of Software Engineering, SIGSOFT 1994 ; Conference date: 06-12-1994 Through 09-12-1994",
year = "1994",
month = dec,
day = "1",
doi = "10.1145/193173.195287",
language = "אנגלית",
series = "Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering",
publisher = "Association for Computing Machinery",
pages = "11--20",
booktitle = "Proceedings of the 2nd ACM SIGSOFT Symposium on Foundations of Software Engineering, SIGSOFT 1994",
address = "ארצות הברית",
}