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.

[1]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[2]  Frank S. de Boer,et al.  On Blocks: Locality and Asynchronous Communication (Extended Abstract) , 1992, REX Workshop.

[3]  Pascal Raymond,et al.  The synchronous data flow programming language LUSTRE , 1991, Proc. IEEE.

[4]  Dana S. Scott,et al.  Concurrent constraint programming languages , 1989 .

[5]  A. Tarski,et al.  Cylindric Algebras. Part II , 1988 .

[6]  Gert Smolka.  The Definition of Kernel Oz , 1994 .

[7]  Gérard Berry,et al.  The Esterel Synchronous Programming Language: Design, Semantics, Implementation , 1992, Sci. Comput. Program..

[8]  Alberto Policriti,et al.  Modeling concurrent systems specified in a temporal concurrent constraint language-I , 2001, APPIA-GULP-PRODE.

[9]  Frank S. de Boer,et al.  A Fully Abstract Model for Concurrent Constraint Programming , 1991, TAPSOFT, Vol.1.

[10]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[11]  Frank S. de Boer,et al.  The Failure of Failures in a Paradigm for Asynchronous Communication , 1991, CONCUR.

[12]  Stephen A. Cook,et al.  Soundness and Completeness of an Axiom System for Program Verification , 1978, SIAM J. Comput..

[13]  Maurizio Gabbrielli,et al.  Proving concurrent constraint programs correct , 1997, TOPL.

[14]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[15]  Insup Lee,et al.  A Process Algebra of Communicating Shared Resources with Dense Time and Priorities , 1997, Theor. Comput. Sci..

[16]  Matthew Hennessy,et al.  A Temporal Process Algebra , 1990, FORTE.

[17]  Michael Fisher,et al.  An introduction to executable temporal logics , 1996, The Knowledge Engineering Review.

[18]  Frank D. Valencia,et al.  A Temporal Concurrent Constraint Programming Calculus , 2001, CP.

[19]  Thierry Gautier,et al.  Programming real-time applications with SIGNAL , 1991, Proc. IEEE.

[20]  Maurizio Gabbrielli,et al.  A denotational semantics for Timed Linda , 2001, PPDP '01.

[21]  Prakash Panangaden,et al.  The semantic foundations of concurrent constraint programming , 1991, POPL '91.

[22]  Maurizio Gabbrielli,et al.  A Timed Concurrent Constraint Language , 2000, Inf. Comput..

[23]  Bengt Jonsson,et al.  A model and proof system for asynchronous networks , 1985, PODC '85.

[24]  Matthew Hennessy,et al.  A Process Algebra for Timed Systems , 1995, Inf. Comput..

[25]  Maurizio Gabbrielli,et al.  A temporal logic for reasoning about timed concurrent constraint programs , 2001, Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001.

[26]  Radha Jagadeesan,et al.  Timed Default Concurrent Constraint Programming , 1996, J. Symb. Comput..