Proving correctness of timed concurrent constraint programs

  • Authors:
  • Frank S. De Boer;Maurizio Gabbrielli;Maria Chiara Meo

  • Affiliations:
  • CWI and Universiteit Utrecht, Amsterdam, The Netherlands;Università di Bologna, Bologna, Italy;Università di Chieti-Pescara, Pescara, Italy

  • Venue:
  • ACM Transactions on Computational Logic (TOCL)
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

A temporal logic is presented for reasoning about the correctness of timed concurrent constraint programs. The logic is based on modalities which allow one to specify what a process produces as a reaction to what its environment inputs. These modalities provide an assumption/commitment style of specification which allows a sound and complete compositional axiomatization of the reactive behavior of timed concurrent constraint programs.