Proving Concurrent Constraint Programs Correct

@inproceedings{Boer1994ProvingCC,
  title={Proving Concurrent Constraint Programs Correct},
  author={Frank S. de Boer and Maurizio Gabbrielli and Elena Marchiori and Catuscia Palamidessi},
  booktitle={POPL},
  year={1994}
}
We develop a compositional proof-system for the partial correctness of concurrent constraint programs. Soundness and (relative) completeness of the system are proved with respect to a denotational semantics based on the notion of strongest postcondition. The strongest postcondition semantics provides a justification of the declarative nature of concurrent constraint programs, since it allows to view programs as theories in the specification logic. 
Highly Cited
This paper has 94 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

94 Citations

0510'94'99'05'11'17
Citations per Year
Semantic Scholar estimates that this publication has 94 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…