Incremental analysis of constraint logic programs

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… (More)
DOI: 10.1145/349214.349216

Topics

8 Figures and Tables

Statistics

051015'00'02'04'06'08'10'12'14'16'18
Citations per Year

91 Citations

Semantic Scholar estimates that this publication has 91 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics