Efficient Construction of Program Dependence Graphs

@inproceedings{Harrold1993EfficientCO,
  title={Efficient Construction of Program Dependence Graphs},
  author={Mary Jean Harrold and Brian A. Malloy and Gregg Rothermel},
  booktitle={ISSTA},
  year={1993}
}
We present a new technique for constructing a program dependence graph that contains a program's control flow, along with the usual control and data dependence information. Our algorithm constructs a program dependence graph while the program is being parsed. For programs containing only structured transfers of control, our algorithm does not require information provided by the control flow graph or post dominator tree and therefore obviates the construction of these auxiliary graphs. For… CONTINUE READING
Highly Cited
This paper has 63 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 40 extracted citations

Generating Testing and Analysis Tools with Aria

ACM Trans. Softw. Eng. Methodol. • 1996
View 4 Excerpts
Highly Influenced

Recovering Feature-to-Code Mappings in Mixed-Variability Software Systems

2014 IEEE International Conference on Software Maintenance and Evolution • 2014
View 1 Excerpt

63 Citations

0510'94'99'05'11'17
Citations per Year
Semantic Scholar estimates that this publication has 63 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…