See this document in CiteSeerX!

A Confluent Calculus for Concurrent Constraint Programming with Guarded Choice (1995)  (Make Corrections)  (4 citations)
Kim Marriott, Martin Odersky
Theoretical Computer Science



  Home/Search   Context   Related

 
View or download:
unisa.edu.au/~cismxo/paper...cp95.ps.gz
diwww.epfl.ch/~odersky/pap...cp95.ps.gz
lampwww.epfl.ch/~odersky/p...cp95.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  unisa.edu.au/~cismxo/papers/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . Confluence is an important and desirable property as it allows the program to be understood by considering any desired scheduling rule, rather than having to consider all possible schedulings. Unfortunately, the usual operational semantics for concurrent constraint programs is not confluent as different process schedulings give rise to different sets of possible outcomes. We show that it is possible to give a natural confluent calculus for concurrent constraint programs, if the syntactic... (Update)

Context of citations to this paper:   More

.... [10] One problem with CC languages is that it is difficult to reason about and to analyze concurrent programs [4] Recent work, e.g. [6] (which also contains more references) has tried to solve the problem by giving a declarative semantics to CC programs. By declarative...

...deterministic programs is less expressive and too strict for the CHR formalism. Our approach is orthogonal to the work in program analysis in [10] and [6] where a different, less rigid notion of confluence is defined: A CC program is confluent, if different process schedulings...

Cited by:   More
Denotational Semantics for Asynchronous Concurrent Languages - Nyström (1996)   (Correct)
A Confluent Semantic Basis For The Analysis Of.. - Codish, Falaschi, .. (1994)   (Correct)
Implementing Constraint Solvers: Theory and Practice - Abdennadher, Frühwirth, Meuss (1996)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Assessment of a Storage Optimisation Tool for AKL - Sjöland, Brand, Sahlin   (Correct)
0.3:   Constraints for Free in Concurrent Computation - Niehren, Müller (1995)   (Correct)
0.3:   Compositional Analysis of Suspension Free cc Programs - Zaffanella   (Correct)

Similar documents based on text:   More   All
0.7:   Temporal Concurrent Constraint Programming - Valencia (2001)   (Correct)
0.5:   Timed Concurrent Constraint Programming: Decidability Results.. - Valencia (2003)   (Correct)
0.4:   An interpreter for Timed Concurrent Constraints in.. - Sjöland, Klintskog.. (2001)   (Correct)

Related documents from co-citation:   More   All
3:   Semantic foundation of concurrent constraint programming - Saraswat, Rinard et al. - 1991
3:   Communicating Sequential Processes (context) - Hoare - 1985
3:   The Family of Concurrent Logic Programming Languages (context) - Shapiro - 1989

BibTeX entry:   (Update)

K. Marriott and M. Odersky. A confluent calculus for concurrent constraint programming with guarded choice. In Ugo Montanari Francesca Rossi, editor, Principles and Practice of Constraint Programming, Proceedings First International Conference, CP'95, Cassis, France, pages 310--327, Berlin, September 1995. Springer. http://citeseer.ist.psu.edu/marriott95confluent.html   More

@article{ marriott97confluent,
    author = "Kim Marriott and Martin Odersky",
    title = "A confluent calculus for concurrent constraint programming",
    journal = "Theoretical Computer Science",
    volume = "173",
    number = "1",
    pages = "209--233",
    year = "1997",
    url = "citeseer.ist.psu.edu/marriott95confluent.html" }
Citations (may not include all citations):
1838   Foundations of Logic Programming (context) - Lloyd - 1987
729   The Lambda Calculus: its Syntax and Semantics (context) - Barendregt - 1984
247   Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1980
216   The semantic foundations of concurrent constraint programmin.. - Saraswat, Rinard et al. - 1991
151   Logic semantics for a class of committed-choice programs (context) - Maher - 1987
101   Concurrent constraint programming (context) - Saraswat, Rinard - 1990
30   Combinatory Reduction Systems (context) - Klop - 1980
30   Compositional analysis for concurrent constraint programming - Falaschi, Gabbrielli et al. - 1993
26   Abstract interpretation for concurrent logic languages (context) - Codognet, Codognet et al. - 1990
21   Efficient analysis of concurrent constraint logic programs (context) - Codish, Falaschi et al. - 1993
18   Suspension analyses for concurrent logic programs - Codish, Falaschi et al. - 1994
9   Abstracting synchronization in concurrent constraint program.. - Zaffanella, Levi et al. - 1994
7   Funktionale Berechnung in einem uniform nebenlaufigen Kalkul.. (context) - Niehren - 1994
5   A confluent relational calculus for higher-order programming.. - Niehren, Smolka - 1994
5   CC programs with both in- and nondeterminism: A concurrent s.. - Montanari, Rossi et al. - 1994
5   Confluence and concurrent constraint programming (context) - Falaschi, Gabbrielli et al. - 1995
1   volume 64 of Studies in Logic and the Foundations of Mathema.. (context) - Henkin, Donald et al. - 1971

Documents on the same site (http://www.cis.unisa.edu.au/~cismxo/papers/):   More
Making the future safe for the past: Adding.. - Bracha, Odersky.. (1998)   (Correct)
Two Ways to Bake Your Pizza - Translating Parameterised Types.. - Odersky (1997)   (Correct)
Observers for Linear Types - Martin Odersky (1992)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC