Proving correctness of timed concurrent constraint programs
ACM Transactions on Computational Logic · 2004
DOI: 10.1145/1024922.1024926 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Computational Logic, 2004. Verfasst von Frank S. De Boer und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 22 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Boer, F. S. D., Gabbrielli, M., & Meo, M. C. (2004). Proving correctness of timed concurrent constraint programs. ACM Transactions on Computational Logic. https://doi.org/10.1145/1024922.1024926
Vancouver
Boer FSD, Gabbrielli M, Meo MC. Proving correctness of timed concurrent constraint programs. ACM Transactions on Computational Logic. 2004. doi:10.1145/1024922.1024926
BibTeX
@article{Boer2004,
author = {Boer, Frank S. De and Gabbrielli, Maurizio and Meo, Maria Chiara},
title = {Proving correctness of timed concurrent constraint programs},
journal = {ACM Transactions on Computational Logic},
year = {2004},
doi = {10.1145/1024922.1024926}
}
EUVIMED