Compositional analysis for concurrent constraint programming

Moreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

25 Citations (Scopus)

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 languageEnglish
Title of host publicationLogic in Computer Science
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages210-221
Number of pages12
ISBN (Print)0818631422
Publication statusPublished - 1993
Externally publishedYes
EventProceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science - Montreal, Canada
Duration: 19 Jun 199323 Jun 1993

Conference

ConferenceProceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science
CountryCanada
CityMontreal
Period19/06/9323/06/93

Cite this