Compositional Analysis of Modular Logic Programs (1993)
Cached
Download Links
- [www.cs.arizona.edu]
- [strudel.di.unipi.it]
- [profs.sci.univr.it]
- [ftp.cs.bgu.ac.il]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. Twentieth Annual ACM Symp. on Principles of Programming Languages |
| Citations: | 52 - 10 self |
BibTeX
@INPROCEEDINGS{Codish93compositionalanalysis,
author = {Michael Codish and Saumya Debray and Roberto Giacobazzi},
title = {Compositional Analysis of Modular Logic Programs},
booktitle = {In Proc. Twentieth Annual ACM Symp. on Principles of Programming Languages},
year = {1993},
pages = {451--464},
publisher = {ACM Press}
}
Years of Citing Articles
OpenURL
Abstract
This paper describes a semantic basis for a compositional approach to the analysis of logic programs. A logic program is viewed as consisting of a set of modules, each module defining a subset of the program's predicates. Analyses are constructed by considering abstract interpretations of a compositional semantics. The abstract meaning of a module corresponds to its analysis and composition of abstract meanings corresponds to composition of analyses. Such an approach is essential for large program development so that altering one module does not require re-analysis of the entire program. A compositional analysis for ground dependencies is included to illustrate the approach. To the best of our knowledge this is the first account of a compositional framework for the analysis of (logic) programs. 1 Introduction It is widely acknowledged that as the size of a program increases, it becomes impractical to maintain it as a single monolithic structure. Instead, the program has to be...







