From eventual to atomic and locally atomic CC programs: A concurrent semantics

  • F. Bueno
  • M. Hermenegildo
  • U. Montanari
  • F. Rossi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 850)


We present a concurrent semantics (i.e. a semantics where concurrency is explicitely represented) for CC programs with atomic tells. This allows to derive concurrency, dependency, and nondeterminism information for such languages. The ability to treat failure information puts CLP programs also in the range of applicability of our semantics: although such programs are not concurrent, the concurrency information derived in the semantics may be interpreted as possible parallelism, thus allowing to safely parallelize those computation steps which appear to be concurrent in the net. Dually, the dependency information may also be interpreted as necessary sequentialization, thus possibly exploiting it to schedule CC programs. The fact that the semantical structure contains dependency information suggests a new tell operation, which checks for consistency only the constraints it depends on, achieving a reasonable trade-off between efficiency and atomicity.


Inference Rule Operational Semantic Constraint System Mutual Exclusion Semantical Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [dlBHM93]
    M. García de la Banda, M. Hermenegildo, and K. Marriott. Independence in Constraint Logic Programs. In Proc. ILPS. MIT Press, 1993.Google Scholar
  2. [BBHRM93]
    P. Bueno, M. García de la Banda, M. Hermenegildo, F. Rossi, and U. Montanari. Towards true concurrency semantics based transformation between CLP and CC. TR CLIP2/93.1, UPM, 1993.Google Scholar
  3. [BP91]
    F.S. De Boer and C. Palamidessi. A fully abstract model for concurrent constraint programming. In Proc. CAAP. Springer-Verlag, 1991.Google Scholar
  4. [HR93]
    M. Hermenegildo and F. Rossi. Strict and Non-Strict Independent And-Parallelism in Logic Programs: Correctness, Efficiency, and Compile-Time Conditions. Journal of Logic Programming, 1993. To appear.Google Scholar
  5. [JL87]
    J. Jaffar and J.L. Lassez. Constraint logic programming. In Proc. POPL. ACM, 1987.Google Scholar
  6. [KS92]
    A. King and P. Soper. Schedule Analysis of Concurrent Logic Programs. In Proc. JICSLP, pages 478–492, MIT Press, 1992.Google Scholar
  7. [KT91]
    M. Koorsloot and E. Tick. Sequentializing parallel programs. In Phoenix Seminar and Workshop on Declarative Programming. Hohritt, Sasbach-walden, Germany, Springer-Verlag, 1991.Google Scholar
  8. [MR91]
    U. Montanari and F. Rossi. True concurrency in concurrent constraint programming. In Proc. ILPS. MIT Press, 1991.Google Scholar
  9. [MR93a]
    U. Montanari and F. Rossi. Contextual nets. Technical Report TR-4/93, CS Department, University of Pisa, Italy, 1993.Google Scholar
  10. [MR93b]
    U. Montanari and F. Rossi. Contextual occurrence nets and concurrent constraint programming. In Proc. Dagstuhl Seminar on Graph Transformations in Computer Science. Springer-Verlag, LNCS, 1993.Google Scholar
  11. [Rei85]
    W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1985.Google Scholar
  12. [Sar93]
    V.A. Saraswat. Concurrent Constraint Programming. MIT Press, 1993.Google Scholar
  13. [SR90]
    V. A. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. POPL. ACM, 1990.Google Scholar
  14. [SRP91]
    V. A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In Proc. POPL. ACM, 1991.Google Scholar
  15. [Sco82]
    D. S. Scott. Domains for denotational semantics. In Proc. ICALP. Springer-Verlag, 1982.Google Scholar

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • F. Bueno
    • 1
  • M. Hermenegildo
    • 1
  • U. Montanari
    • 2
  • F. Rossi
    • 2
  1. 1.Facultad de InformáticaUniversidad Politécnica de Madrid (UPM)MadridSpain
  2. 2.Dipartimento di InformaticaUniversità di PisaPisaItaly

Personalised recommendations