Speeding up slicing

Thomas Reps, Susan Horwitz, Mooly Sagiv, Genevieve Rosay

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProceedings of the 2nd ACM SIGSOFT Symposium on Foundations of Software Engineering, SIGSOFT 1994
PublisherAssociation for Computing Machinery
Pages11-20
Number of pages10
ISBN (Electronic)0897916913
DOIs
StatePublished - 1 Dec 1994
Externally publishedYes
Event2nd ACM SIGSOFT Symposium on Foundations of Software Engineering, SIGSOFT 1994 - New Orleans, United States
Duration: 6 Dec 19949 Dec 1994

Publication series

NameProceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering
VolumePart F129497

Conference

Conference2nd ACM SIGSOFT Symposium on Foundations of Software Engineering, SIGSOFT 1994
Country/TerritoryUnited States
CityNew Orleans
Period6/12/949/12/94

Keywords

  • Dynamic programming
  • Dynamic transitive closure
  • Flow-sensitive summary information
  • Program debugging
  • Program dependence graph
  • Program slicing
  • Realizable path

Fingerprint

Dive into the research topics of 'Speeding up slicing'. Together they form a unique fingerprint.

Cite this