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.
Chapter PDF
Similar content being viewed by others
References
L. Aceto and D. Murphy. Timing and causality in process algebra. Acta Informatica, 33(4): 317–350, 1996.
J. Baeten and J. Bergstra. Real time process algebra. Formal Aspects of Computing, 3(2): 142–188, 1991.
G. Berry and G. Gonthier. The ESTEREL programming language: Design, semantics and implementation. Science of Computer Programming, 19(2):87–152, 1992.
F.S. de Boer, M. Gabbrielli, E. Marchiori and C. Palamidessi. Proving Concurrent Constraint Programs Correct. TOPLAS, 19(5): 685–725. ACM Press, 1997.
F.S. de Boer, M. Gabbrielli and M.C. Meo. A Timed CCP Language. Information and Computation, 161, 2000.
F.S. de Boer, M. Gabbrielli, and M. C. Meo. A Denotational Semantics for a Timed Linda Language. In Proc. PPDP 2001. ACM Press, 2001.
F.S. de Boer, M. Gabbrielli and M.C. Meo. A Temporal Logic for reasoning about Timed Concurrent Constraint Programs. In Proc. TIME 01. IEEE Press, 2001.
F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. The failure of failures in a paradigm for asynchronous communication. In Proc. of CONCUR’91, vol. 527 of LNCS, pages 111–126. Springer-Verlag, 1991.
F.S. de Boer and C. Palamidessi. A Fully Abstract Model for Concurrent Constraint Programming. In S. Abramsky and T.S.E. Maibaum, editors, Proc. of TAPSOFT/CAAP, vol. 493 of LNCS, pages 296–319. Springer-Verlag, 1991.
P. Bremond-Gregoire and I. Lee. A Process Algebra of Communicating Shared Resources with Dense Time and Priorities. Theoretical Computer Science 189, 1997. Springer-Verlag, 1997.
S. Brookes. A fully abstract semantics of a shared variable parallel language. In Proc. Eighth LICS. IEEE Computer Society Press, 1993.
S. Cook. Soundness and completeness of an axiom system for program verification. SIAM Journal of Computation 7, 1, 70–90.
M. Falaschi, A. Policriti, A. Villanueva. Modeling Concurrent systems specified in a Temporal Concurrent Constraint language. in Proc. AGP’2000. 2000.
M. Fisher. An introduction to Executable Temporal Logics. Knowledge Engineering Review, 6(1): 43–56, 1996.
N. Halbwachs, P. Caspi, and D. Pilaud. The synchronous programming language LUSTRE. In Special issue on Another Look at Real-time Systems, Proceedings of the IEEE, 1991.
D. Harel. Statecharts: A Visual Formalism for Complex Systems. Science of Computer Programming 8, pages 231–274, 1987.
L. Henkin, J.D. Monk, and A. Tarski. Cylindric Algebras (Part I). North-Holland, 1971.
M. Hennessy and T. Regan. A temporal process algebra. Information and Computation, 117: 221–239, 1995.
P. Le Guernic, M. Le Borgue, T. Gauthier, and C. Le Marie. Programming real time applications with SIGNAL. In Special issue on Another Look at Real-time Systems, Proceedings of the IEEE, 1991.
B. Jonsson. A model and a proof system for asynchronous processes. In Proc. of the 4th ACM Symp. on Principles of Distributed Computing, pages 49–58. ACM Press, 1985.
M. Nielsen and F.D. Valencia. The ntcc Calculus and its applications. Draft, 2001.
Z. Manna and A. Pnueli. The temporal logic of reactive systems. Springer-Verlag, 1991.
C. Palamidessi and F.D. Valencia. A Temporal Concurrent Constraint Programming Calculus. In Proc. CP 0 1, LNCS 2239, pag. 302–316. Springer-Verlag, 2001.
V.A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, January 1989. Published by The MIT Press, 1991.
V.A. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. of POPL, pages 232–245. ACM Press, 1990.
V.A. Saraswat, R. Jagadeesan, and V. Gupta Timed Default Concurrent Constraint Programming. Journal of Symbolic Computation, 22(5–6):475–520, 1996.
V.A. Saraswat, M. Rinard, and P. Panangaden. Semantics foundations of Concurrent Constraint Programming. In Proc. of POPL. ACM Press, 1991.
G. Smolka. The Definition of Kernel Oz. In A. Podelski editor, Constraints: Basics and Trends, vol. 910 of LNCS, pages 251–292. Springer-Verlag, 1995.
F.D. Valencia. Reactive Constraint Programming. Brics Progress Report, June 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Boer, F.S., Gabbrielli, M., Meo, M.C. (2002). Proving Correctness of Timed Concurrent Constraint Programs. In: Nielsen, M., Engberg, U. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2002. Lecture Notes in Computer Science, vol 2303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45931-6_4
Download citation
DOI: https://doi.org/10.1007/3-540-45931-6_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43366-8
Online ISBN: 978-3-540-45931-6
eBook Packages: Springer Book Archive