Demand Interprocedural Program Analysis Using Logic Databases (1994)
| Citations: | 45 - 8 self |
BibTeX
@MISC{Reps94demandinterprocedural,
author = {Thomas W. Reps},
title = {Demand Interprocedural Program Analysis Using Logic Databases},
year = {1994}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper describes how algorithms for demand versions of inerprocedural programanalysis problems can be obtained from their exhaustive counterparts essentially for free, by applying the so-called magic-sets transformation that was developed in the logic-programming and deductive-database communities. Applications to interprocedural dataflow analysis and interprocedural program slicing are described. 1 1 INTRODUCTION Interprocedural analysis concerns the static examination of a program that consists of multiple procedures. Its purpose is to determine certain kinds of summary information associated with the elements of a program (such as reaching definitions, available expressions, live variables, etc.). Most treatments of interprocedural analysis address the exhaustive version of the problem: summary information is to be reported for all elements of the program. This paper concerns the solution of demand versions of interprocedural analysis problems: summary information is to be rep...
