Proving correctness of Timed Concurrent Constraint Programs

@article{Boer2004ProvingCO,
  title={Proving correctness of Timed Concurrent Constraint Programs},
  author={Frank S. de Boer and Maurizio Gabbrielli and Maria Chiara Meo},
  journal={ACM Trans. Comput. Log.},
  year={2004},
  volume={5},
  pages={706-731}
}
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.