Truly concurrent constraint programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1119, Issue , 1996, Pages 373-388

  Gupta, Vineet ^a   Jagadeesan, Radha ^b   Saraswat, Vijay ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

^b Dept of Mathematical Sciences ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; SEMANTICS;

CAUSAL DEPENDENCIES; CLOSURE OPERATORS; COMPUTATION MODEL; CONCURRENT CONSTRAINT; CONCURRENT CONSTRAINT PROGRAMMING; PARTIAL INFORMATION; TRACE OPERATORS; TRUE CONCURRENCY;

COMPUTATION THEORY;

EID: 2342525651     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61604-7_65     Document Type: Conference Paper

References (23)

1. S. Abramsky. Domain theory in logical form. Annals of Pure and Applied Logic, 51:1-77, 1991
2. L. Aceto and M. Hennessy. Towards action-refinement in process algebras. In Proceedings, Fourth Annual Symposium on Logic in Computer Science, pages 138-145. IEEE Computer Society Press, 1989
3. G. Boudol, I. Castellani, Matthew C. Hennessy, and A. Kiehn. A theory of processes with localities. In Proceedings of lnternational Conference on Concurrency Theory, Volume 630 of Lecture Notes in Computer Science, pages 108-122, 1992
4. E S. de Boer, M. Gabrielli, Elena Marchiori, and Camscia Palamidessi. Proving concurrent programs correct. In Proceedings of the 21st ACM SlGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 98-108, 1994
5. E S. de Boer and Catuscia Palamidessi. A fully abstract model for concurrent constraint programming. In Proceedings of TAPSOFT/CAAP, pages 296-319, LNCS 493, 1991
6. E S. de Boer, Catuscia Palamidessi, and Eike Best. Concurrent constraint programruing with information removal. In Proceedings of the Concurrent Constraint Programming Workshop, pages 1-13, Venice, 1995
7. J. deKleer. An assumption based TMS. Artifical Intelligence, 28:127-162, 1986
8. R. de Nicola and M.C.B. Hennessy. Testing equivalences forprocesses. Theoreacal Computer Science, 34:83-133, 1984.
9. Markns Fromherz and Vijay Saraswat. Model-based computing: Using concurrent constraint programming for modeling and model compilation. In Principles and Practices of Constraint Programming, volume 976 of LNCS, pages 629-635. Springer Verlag, 1995.
10. Roberto Gorrieri. Refinement, Atomicity, and Transactions for Process Description Languages. PhD thesis, University of Pisa, 1991.
11. N. Heintze. Set-Based Program analysis. PhD thesis, Carnegie Mellon University, 1992.
12. Ugo Montanari and Francesca Rossi. True concurrency semantics for concurrent constraint programminmg. In V. Saraswat and K. Ueda, editors, Proc. of the 1991 International Logic Programming Symposium, 1991.
13. Ugo Montanari and Francesca Rossi. A concurrent semantics for concurrent constraint programs via contextual nets. In Principles andPranctices of Constraint Programming, pages 3-27, 1995.
14. G.D. Plotkin. A powerdomain construction. SIAMJ. of Computing, 5(3):452-487, September 1976.
15. V.R. Pratt. Modeling concurrency with partial orders. Int. J. of Parallel Programming, 15(1):33-71, February 1986.
16. Vijay A. Saraswat. The Category of Constraint Systems is Cartesian-closed. In Proc. 7th IEEE Symp. on Logic in Computer Science, Santa Cruz, 1992.
17. Vijay A. Saraswat. Concurrent constraint programming. Doctoral Dissertation Award and Logic Programming Series. MR" Press, 1993.
18. M. B. Smyth. Powerdomains. Journal of Computer and System Sciences, 16:23-36, February 1978.
19. Vijay A. Saraswat and Martin Rinard. Concurrent constraint programming. In Proceedings of Seventeenth A CM Symposium on Principles of Programming Languages, San Fransisco, January 1990.
20. V. A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In Proceedings of Eighteenth ACM Symposium on Principles of Programming Languages, Orlando, January 1991.
21. Rob van Glabbeek and Flits Vaandrager. Petri net models for algebraic theories of concurrency. In Proceedings of PARLE, Volume 259 of the Lecture Notes in Computer Science, pages 224-242, 1987.
22. Walter Vogler. Modular Construction and Partial Order Semantics of Petri Nets, volume 625 ofLNCS. Springer-Verlag, 1992. 252 pp.
23. Glynn Winskel. Event structures. In Petri Nets: Applications and Relationships to Other Models of Concurrency, Volume 255 of Lecture Notes in Computer Science, pages 325-392,1987.