Loading...
Please wait, while we are loading the content...
Similar Documents
Proving Concurrent Constraint Programs Correct (1994)
| Content Provider | CiteSeerX |
|---|---|
| Author | Boer, Frank S. De Palamidessi, Catuscia Marchiori, Elena Gabbrielli, Maurizio |
| Abstract | We develop a compositional proof-system for the partial correctness of concurrent constraint programs. Soundness and (relative) completeness of the system are proved with respect to a denotational semantics based on the notion of strongest postcondition. The strongest postcondition semantics provides a justification of the declarative nature of concurrent constraint programs, since it allows to view programs as theories in the specification logic. 1 Introduction Concurrent constraint programming ([24, 25, 26]) (ccp, for short) is a concurrent programming paradigm which derives from replacing the store-as-valuation conception of von Neumann computing by the storeas -constraint model. Its computational model is based on a global store, represented by a constraint, which expresses some partial information on the values of the variables involved in the computation. The concurrent execution of different processes, which interact through the common store, refines the partial information of... |
| File Format | |
| Publisher Date | 1994-01-01 |
| Access Restriction | Open |
| Subject Keyword | Concurrent Constraint Program Compositional Proof-system Introduction Concurrent Constraint Programming Global Store Different Process Store-as-valuation Conception Partial Information Concurrent Programming Paradigm Concurrent Constraint Program Correct Common Store Computational Model Von Neumann Computing Concurrent Execution Partial Correctness Postcondition Semantics Specification Logic Denotational Semantics Declarative Nature |
| Content Type | Text |