Journal article

Incremental analysis of constraint logic programs

M Hermenegildo, G Puebla, K Marriott, PJ Stuckey

ACM Transactions on Programming Languages and Systems | Published : 2000


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 arbitrar..

View full abstract

Citation metrics