Abstract
We propose a framework for the analysis of concurrent constraint programming (ccp). Our approach is based on simple denotational semantics which 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 programs.
Original language | English |
---|---|
Title of host publication | Logic in Computer Science |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Pages | 210-221 |
Number of pages | 12 |
ISBN (Print) | 0818631422 |
Publication status | Published - 1993 |
Externally published | Yes |
Event | Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science - Montreal, Canada Duration: 19 Jun 1993 → 23 Jun 1993 |
Conference
Conference | Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science |
---|---|
Country/Territory | Canada |
City | Montreal |
Period | 19/06/93 → 23/06/93 |