Proving concurrent constraint programs correct

  • Authors:
  • Frank S. De Boer;Maurizio Gabbrielli;Elena Marchiori;Catuscia Palamidessi

  • Affiliations:
  • Univ. Utrecht, Utrecht, The Netherlands;Univ. di Pisa, Pisa, Italy;Univ. di Venezia, Italy;Univ. di Genova, Genova, Italy

  • Venue:
  • ACM Transactions on Programming Languages and Systems (TOPLAS)
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce a simple compositional proof system for proving (partial) correctness of concurrent constraint programs (CCP). The proof system is based on a denotational approximation of the strongest postcondition semantics of CCP programs. The proof system is proved to be correct for full CCP and complete for the class of programs in which the denotational semantics characterizes exactly the strongest postcondition. This class includes the so-called confluent CCP, a special case of which is constraint logic programming with dynamic scheduling.