kirancodes.me
To Proof Maintenance & Beyond!
FSE 1994

Speeding up Slicing

Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genevieve Rosay

PDFDOI 10.1145/193173.195287dblp

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.

BibTeX
@inproceedings{Reps-al:FSE94,
  author    = {Thomas W. Reps and
               Susan Horwitz and
               Shmuel Sagiv and
               Genevieve Rosay},
  title     = {Speeding up Slicing},
  booktitle = {FSE},
  pages     = {11--20},
  publisher = {{ACM}},
  year      = {1994},
}

Related papers