Skip to main content
Article thumbnail
Location of Repository

Incremental analysis of logic programs

By Manuel V. Hermenegildo, K. Marriott and P.J. Stuckey


Global analyzers traditionally read and analyze the entire program at once, in a non-incremental way. However, there are many situations which are not well suited to this simple model and which instead require reanalysis of certain parts of a program which has already been analyzed. In these cases, it appears inefficient to perform the analysis of the program again from scratch, as needs to be done with current systems. We describe how the fixpoint algorithms in current generic analysis engines can be extended to support incremental analysis. The possible changes to a program are classified into three types: addition, deletion, and arbitrary change. For each one of these, we provide one or more algorithms for identifying the parts of the analysis that must be recomputed and for performing the actual recomputation. The potential benefits and drawbacks of these algorithms are discussed. Finally, we present some experimental results obtained with an implementation of the algorithms in the PLAI generic abstract interpretation framework. The results show significant benefits when using the proposed incremental analysis algorithms

Topics: Informática
Publisher: Facultad de Informática (UPM)
Year: 1994
OAI identifier:
Provided by: Archivo Digital UPM

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.