Toward an Implementation Theory of Nondeterministic Concurrent Languages

Nondeterministic concurrent programming languages (ncpl) are languages which contain as primitive constructs nondeterministic choice and concurrent composition (inter-leaving). The best known are the languages based on CCS of Milner which are used as mathematical models of communication of concurrent processes. Concurrent constraint programming languages have been intensively studied during the last decade, reeecting the eeorts directed to extend the constraint logic programming paradigm, and also may be characterized as a subclass of ncpl. The universal generator of histories for ncp languages under development is considered as a new uniied approach for the deenition of the operational semantics of these languages, their comparative studies and the development of prototypes for new applications. This generator is a generic program which may be used as a mathematical model for diierent classes of programs. The universal generator has been used to checking the operational semantics of Scc | the synchronous concurrent constraint language developed jointly The experiments have been performed for ground term constraints with set theoretic inclusion as an entailment relation and for Herbrand universe as another entailment system. As a result of these experiments the soundness and eeciency of operational semantics for Scc has been basically connrmed. At the same time some gaps in the deenition of operational semantics have been discovered and the improved semantics has been established and implemented by generator.

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

[2]  Alexander A. Letichevsky,et al.  Computations in APS , 1993, Theor. Comput. Sci..

[3]  Gert Smolka.  The Oz Programming Model , 1996 .

[4]  Philippe Codognet,et al.  A Generalized Semantics for Concurrent Constraint Languages and their Abstract Interpretation , 1995, Constraint Processing, Selected Papers.

[5]  Frank S. de Boer,et al.  Non-monotonic Concurrent Constraint Programming , 1993, ILPS.

[6]  Sven-Olof Nyström,et al.  Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations , 1993, ILPS.

[7]  Maurizio Gabbrielli,et al.  Compositional analysis for concurrent constraint programming , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[8]  Frank S. de Boer,et al.  On the Semantics of Concurrent Constraint Programming , 1992, ALPUK.

[9]  Jean-Marie Jacquet,et al.  New Versions of Ask and Tell for Synchronous Communication in Concurrent Constraint Programming , 1995 .

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

[11]  Jean-Marie Jacquet,et al.  Synchronisation in Scc , 1995, ILPS.

[12]  Frank S. de Boer,et al.  A Process Algebra of Concurrent Constraint Programming , 1992, JICSLP.

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

[14]  Jean-Marie Jacquet,et al.  A Process Algebra for Synchronous Concurrent Constraint Programming , 1996, ALP.

[15]  Maurizio Gabbrielli,et al.  Proving concurrent constraint programs correct , 1994, POPL '94.

[16]  Maurizio Gabbrielli,et al.  Unfolding and Fixpoint Semantics of Concurrent Constraint Logic Programs , 1990, ALP.

[17]  Peter Sestoft,et al.  Partial evaluation and automatic program generation , 1993, Prentice Hall international series in computer science.