Negation and control in Prolog
Negation and control in Prolog
Conditional rewrite rules: Confluence and termination
Journal of Computer and System Sciences
Operational and denotational semantics of prolog
Journal of Logic Programming
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Strand: new concepts in parallel programming
Strand: new concepts in parallel programming
Handbook of theoretical computer science (vol. B)
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
The expressive power of indeterminate dataflow primitives
Information and Computation
Control generation for logic programs
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Analyzing logic programs with dynamic scheduling
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Go¨del programming language
The Go¨del programming language
Declarative programming in Prolog
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Nondeterminism and infinite computations in constraint programming
Selected papers of the workshop on Topology and completion in semantics
Formal Justification of a Proof System for Communicating Sequential Processes
Journal of the ACM (JACM)
A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
A Discipline of Programming
Verification of Logic Programs with Delay Declarations
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Efficient Analysis of Concurrent Constraint Logic Programs
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
A Dataflow Semantics for Constraint Logic Programs
PLILPS '95 Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs
The Failure of Failures in a Paradigm for Asynchronous Communication
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
A Hyperdoctrinal View of Concurrent Constraint Programming
Proceedings of the REX Workshop on Sematics: Foundations and Applications
Logical Aspects of Denotational Semantics
Category Theory and Computer Science
Confluence in Concurrent Constraint Programming
Confluence in Concurrent Constraint Programming
Concurrent constraint programming languages
Concurrent constraint programming languages
Partial evaluation of concurrent constraint languages
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
Transformations of CCP programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the expressive power of temporal concurrent constraint programming languages
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
A Verification Framework for Agent Communication
Autonomous Agents and Multi-Agent Systems
Temporal concurrent constraint programming: denotation, logic and applications
Nordic Journal of Computing
Proving Correctness and Completeness of Normal Programs - A Declarative Approach
Proceedings of the 17th International Conference on Logic Programming
Proving the Equivalence of CLP Programs
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Propagation Completeness of Reactive Constraints
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
First-Order Logic as a Constraint Programming Language
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Temporal Concurrent Constraint Programming: Applications and Behavior
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Proving Correctness of Timed Concurrent Constraint Programs
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Quantitative Observables and Averages in Probabilistic Constraint Programming
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
A Temporal Concurrent Constraint Programming Calculus
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Temporal concurrent constraint programming: applications and behavior
Formal and natural computing
Proving correctness of timed concurrent constraint programs
ACM Transactions on Computational Logic (TOCL)
Abstractions for fault-tolerant global computing
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Decidability of infinite-state timed CCP processes and first-order LTL
Theoretical Computer Science - Expressiveness in concurrency
A compositional semantics for CHR
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Proving correctness and completeness of normal programs – a declarative approach
Theory and Practice of Logic Programming
On illegal composition of first-class agent interaction protocols
ACSC '08 Proceedings of the thirty-first Australasian conference on Computer science - Volume 74
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Annotation and matching of first-class agent interaction protocols
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
A compositional semantics for CHR
ACM Transactions on Computational Logic (TOCL)
Annotation and Matching of First-Class Agent Interaction Protocols
Argumentation in Multi-Agent Systems
Using constraints and process algebra for specification of first-class agent interaction protocols
ESAW'06 Proceedings of the 7th international conference on Engineering societies in the agents world VII
Declarative diagnosis of temporal concurrent constraint programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Concurrent and reactive constraint programming
A 25-year perspective on logic programming
Hi-index | 0.00 |
We introduce a simple compositional proof system for proving (partial) correctness of concurrent constraint programs (CCP). The proof system is based on a denotational approximation of the strongest postcondition semantics of CCP programs. The proof system is proved to be correct for full CCP and complete for the class of programs in which the denotational semantics characterizes exactly the strongest postcondition. This class includes the so-called confluent CCP, a special case of which is constraint logic programming with dynamic scheduling.