Abstract
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.
Keywords
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.
Preview
Unable to display preview. Download preview PDF.
References
M. García de la Banda, M. Hermenegildo, and K. Marriott. Independence in Constraint Logic Programs. In Proc. ILPS. MIT Press, 1993.
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.
F.S. De Boer and C. Palamidessi. A fully abstract model for concurrent constraint programming. In Proc. CAAP. Springer-Verlag, 1991.
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.
J. Jaffar and J.L. Lassez. Constraint logic programming. In Proc. POPL. ACM, 1987.
A. King and P. Soper. Schedule Analysis of Concurrent Logic Programs. In Proc. JICSLP, pages 478–492, MIT Press, 1992.
M. Koorsloot and E. Tick. Sequentializing parallel programs. In Phoenix Seminar and Workshop on Declarative Programming. Hohritt, Sasbach-walden, Germany, Springer-Verlag, 1991.
U. Montanari and F. Rossi. True concurrency in concurrent constraint programming. In Proc. ILPS. MIT Press, 1991.
U. Montanari and F. Rossi. Contextual nets. Technical Report TR-4/93, CS Department, University of Pisa, Italy, 1993.
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.
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1985.
V.A. Saraswat. Concurrent Constraint Programming. MIT Press, 1993.
V. A. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. POPL. ACM, 1990.
V. A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In Proc. POPL. ACM, 1991.
D. S. Scott. Domains for denotational semantics. In Proc. ICALP. Springer-Verlag, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag
About this paper
Cite this paper
Bueno, F., Hermenegildo, M., Montanari, U., Rossi, F. (1994). From eventual to atomic and locally atomic CC programs: A concurrent semantics. In: Levi, G., Rodríguez-Artalejo, M. (eds) Algebraic and Logic Programming. ALP 1994. Lecture Notes in Computer Science, vol 850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58431-5_10
Download citation
DOI: https://doi.org/10.1007/3-540-58431-5_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58431-5
Online ISBN: 978-3-540-48791-3
eBook Packages: Springer Book Archive