Proving correctness of Timed Concurrent Constraint Programs
Logic in Computer Science
2007-05-23 v1 Programming Languages
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.
Cite
@article{arxiv.cs/0208042,
title = {Proving correctness of Timed Concurrent Constraint Programs},
author = {F. S. de Boer and M. Gabbrielli and M. C. Meo},
journal= {arXiv preprint arXiv:cs/0208042},
year = {2007}
}