Dissemin is shutting down on January 1st, 2025

Published in

Association for Computing Machinery (ACM), ACM Letters on Programming Languages and Systems, 2(22), p. 187-223, 2000

DOI: 10.1145/349214.349216

Association for Computing Machinery (ACM), ACM Letters on Programming Languages and Systems, 5(18), p. 564-614, 1996

DOI: 10.1145/232706.232734

Links

Tools

Export citation

Search in Google Scholar

Global analysis of constraint logic programs

Journal article published in 1996 by M. Garcia de la Banda, M. Hermenegildo ORCID, M. Bruynooghe, V. Dumortier, G. Janssens, W. Simoens
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

Global analyzers traditionally read and analyze the entire program at once, in a nonincremental 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 fixed-point algorithms used in current generic analysis engines for (constraint) logic programming languages 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.