Compositional analysis for concurrent constraint programming
- 1 January 1993
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A framework for the analysis of concurrent constraint programming (CCP) is proposed. The approach is based on simple denotational semantics that approximate the usual semantics in the sense that they give a superset of the input-output relation of a CCP program. Analyses based on these semantics can be easily and efficiently implemented using standard techniques from the analysis of logic programKeywords
This publication has 8 references indexed in Scilit:
- Efficient analysis of concurrent constraint logic programsPublished by Springer Nature ,1993
- The semantic foundations of concurrent constraint programmingPublished by Association for Computing Machinery (ACM) ,1991
- A fully abstract model for concurrent constraint programmingPublished by Springer Nature ,1991
- Concurrent constraint programmingPublished by Association for Computing Machinery (ACM) ,1990
- The family of concurrent logic programming languagesACM Computing Surveys, 1989
- Functional computations in logic programsACM Transactions on Programming Languages and Systems, 1989
- Domains for denotational semanticsPublished by Springer Nature ,1982
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977