Proving correctness of Timed Concurrent Constraint Programs
<|reference_start|>Proving correctness of Timed Concurrent Constraint Programs: 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.<|reference_end|>
@article{de boer2002proving,
    title={Proving correctness of Timed Concurrent Constraint Programs},
    author={F.S. de Boer, M. Gabbrielli and M.C. Meo},
    journal={arXiv preprint arXiv:cs/0208042},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0208042},
    primaryClass={cs.LO cs.PL}
}