Compositional analysis of modular logic programs

Michael Codish, Saumya K Debray, Roberto Giacobazzi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

36 Citations (Scopus)

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. We claim that for a substantial class of programs, compositional analyses which are based on a notion of abstract unfolding provide the same precision as non-compositional analysis. 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.

Original languageEnglish (US)
Title of host publicationConference Record of the Annual ACM Symposium on Principles of Programming Languages
PublisherPubl by ACM
Pages451-464
Number of pages14
ISBN (Print)0897915607
StatePublished - 1993
Externally publishedYes
Event20th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - Charleston, SC, USA
Duration: Jan 10 1993Jan 13 1993

Other

Other20th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
CityCharleston, SC, USA
Period1/10/931/13/93

Fingerprint

Semantics
Chemical analysis

ASJC Scopus subject areas

  • Software

Cite this

Codish, M., Debray, S. K., & Giacobazzi, R. (1993). Compositional analysis of modular logic programs. In Conference Record of the Annual ACM Symposium on Principles of Programming Languages (pp. 451-464). Publ by ACM.

Compositional analysis of modular logic programs. / Codish, Michael; Debray, Saumya K; Giacobazzi, Roberto.

Conference Record of the Annual ACM Symposium on Principles of Programming Languages. Publ by ACM, 1993. p. 451-464.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Codish, M, Debray, SK & Giacobazzi, R 1993, Compositional analysis of modular logic programs. in Conference Record of the Annual ACM Symposium on Principles of Programming Languages. Publ by ACM, pp. 451-464, 20th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC, USA, 1/10/93.
Codish M, Debray SK, Giacobazzi R. Compositional analysis of modular logic programs. In Conference Record of the Annual ACM Symposium on Principles of Programming Languages. Publ by ACM. 1993. p. 451-464
Codish, Michael ; Debray, Saumya K ; Giacobazzi, Roberto. / Compositional analysis of modular logic programs. Conference Record of the Annual ACM Symposium on Principles of Programming Languages. Publ by ACM, 1993. pp. 451-464
@inproceedings{a4d6044ad2bc43a4af23037480901fc9,
title = "Compositional analysis of modular logic programs",
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. We claim that for a substantial class of programs, compositional analyses which are based on a notion of abstract unfolding provide the same precision as non-compositional analysis. 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.",
author = "Michael Codish and Debray, {Saumya K} and Roberto Giacobazzi",
year = "1993",
language = "English (US)",
isbn = "0897915607",
pages = "451--464",
booktitle = "Conference Record of the Annual ACM Symposium on Principles of Programming Languages",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Compositional analysis of modular logic programs

AU - Codish, Michael

AU - Debray, Saumya K

AU - Giacobazzi, Roberto

PY - 1993

Y1 - 1993

N2 - 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. We claim that for a substantial class of programs, compositional analyses which are based on a notion of abstract unfolding provide the same precision as non-compositional analysis. 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.

AB - 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. We claim that for a substantial class of programs, compositional analyses which are based on a notion of abstract unfolding provide the same precision as non-compositional analysis. 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.

UR - http://www.scopus.com/inward/record.url?scp=0027147076&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027147076&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027147076

SN - 0897915607

SP - 451

EP - 464

BT - Conference Record of the Annual ACM Symposium on Principles of Programming Languages

PB - Publ by ACM

ER -