A Causal Semantics for Timed Default Concurrent Constraint Programming

Authors:
Simone Tini;Andrea Maggiolo-Schettini
Affiliations:
-;-
Venue:
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Year:
2000

Citing 14
Cited 0

The semantic foundations of concurrent constraint programming

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the development of reactive systems

Logics and models of concurrent systems
The ESTEREL synchronous programming language: design, semantics, implementation

Science of Computer Programming
Programming and Verifying Real-Time Systems by Means of the Synchronous Data-Flow Language LUSTRE

IEEE Transactions on Software Engineering - Special issue: specification and analysis of real-time systems
Concurrent constraint programming

Concurrent constraint programming
Default timed concurrent constraint programming

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Timed default concurrent constraint programming

Journal of Symbolic Computation - Special issue: executable temporal logics
Synchronous Programming of Reactive Systems

Synchronous Programming of Reactive Systems
Truly concurrent constraint programming

Theoretical Computer Science
Synchronous Observers and the Verification of Reactive Systems

AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Proved Trees

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
How Vital is Liveness? Verifying Timing Properties of Reactive and Hybrid Systems (Extended Abstract)

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Model-Based Computing: Using Concurrent Constraint Programming for Modeling and Model Compilation

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Partial ordering derivations for CCS

FCT '85 Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a causal semantics for Timed Default Concurrent Constraint Programming which permits associating each output with its cause. We show by an example how this information can simplify program debugging. We prove that the classic operational semantics of the language can be recovered from our causal semantics, and we prove that our causal semantics and the causal semantics of Concurrent Constraint Programming coincide for programs belonging to both languages.