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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1997
Accession Number
ADA332113

Entities

People

  • Genevieve Rosay
  • Mooly Sagiv
  • Susan Horwitz
  • Thomas Reps

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computations
  • Computer Programming
  • Computer Science
  • Context Free Grammars
  • Debugging
  • Dynamic Programming
  • Electronic Mail
  • Engineering
  • Grammars
  • Language
  • Maintenance
  • Programming Languages
  • Sequences
  • Software Development
  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Calculus or Mathematical Analysis
  • Parallel and Distributed Computing.