Optimized Algorithms for Incremental Analysis of Logic Programs (1996)
| Venue: | In International Static Analysis Symposium, number 1145 in LNCS |
| Citations: | 32 - 22 self |
BibTeX
@INPROCEEDINGS{Puebla96optimizedalgorithms,
author = {Germán Puebla and Manuel Hermenegildo},
title = {Optimized Algorithms for Incremental Analysis of Logic Programs},
booktitle = {In International Static Analysis Symposium, number 1145 in LNCS},
year = {1996},
pages = {270--284},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Global analysis of logic programs can be performed effectively by the use of one of several existing efficient algorithms. However, the traditional global analysis scheme in which all the program code is known in advance and no previous analysis information is available is unsatisfactory in many situations. Incremental analysis of logic programs has been shown to be feasible and much more efficient in certain contexts than traditional (non-incremental) global analysis. However, incremental analysis poses additional requirements on the fixpoint algorithm used. In this work we identify these requirements, present an important class of strategies meeting the requirements, present sufficient a priori conditions for such strategies, and propose, implement, and evaluate experimentally a novel algorithm for incremental analysis based on these ideas. The experimental results show that the proposed algorithm performs very efficiently in the incremental case while being comparable...
