DMCA
Interprocedural Slicing Using Dependence Graphs (1990)
Cached
Download Links
- [www.cs.wisc.edu]
- [cs.gmu.edu]
- [cist.buct.edu.cn]
- [www.cs.wisc.edu]
- [www.cs.purdue.edu]
- [www.cs.wisc.edu]
- [research.cs.wisc.edu]
- [www.cs.odu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS |
| Citations: | 837 - 84 self |
BibTeX
@ARTICLE{Horwitz90interproceduralslicing,
author = {Susan Horwitz and Thomas Reps and David Binkley},
title = {Interprocedural Slicing Using Dependence Graphs},
journal = {ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS},
year = {1990},
volume = {12},
number = {1},
pages = {26--60}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
... This paper concerns the problem of interprocedural slicing---generating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previous dependence representations to incorporate collections of procedures (with procedure calls) rather than just monolithic programs. Our main result is an algorithm for interprocedural slicing that uses the new representation. (It should be noted that our work concerns a somewhat restricted kind of slice: Rather than permitting a program to be sliced with respect to program point p and an arbitrary variable, a slice must be taken with respect to a variable that is defined or used at p.) The chief
