|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
ANP89
|
|
 |
BB90
|
|
| |
CM88
|
|
| |
dBP90a
|
F.S. de Boer and C. Palamidessi. A fully abstract model for concurrent constraint logic lant~ua~es. In Proceedings of CONCUR '90, 1990.
|
| |
dBP90b
|
|
| |
DL86
|
|
| |
FT89
|
|
| |
GCLS88
|
Rob Gerth, Mike Codish, Yossi Lichtenstein, and Ehud Shapiro. A fully abstract denotational semantics for Flat Concurrent Prolog. In LICS 88, 1988.
|
| |
Gir87
|
|
| |
Gir89
|
|
| |
GKK+80
|
G.Gierz, K.H.Hoffman, K.Keimel, 3.D.Lawson, M.Mislove, and D.S.Scott, editors. A compendium of continuous lattices. Springer-Verlag Berlin Heidelberg New York, 1980.
|
| |
GL90
|
M. Gabbrielli and G. Levi. Unfolding and fixpoint semantics of concurrent constraint logic programs. Technical report, University of Pisa, 1990.
|
| |
GMS89
|
Haim Gaifman, Michael J. Maher, and Ehud Shapiro. Reactive behavior semantics for concurrent constraint logic programs. In North American Logic Programming Conference. MIT Press, October t 989.
|
| |
HMT71
|
Leon Henldn, J. Donald Monk, and Alfred Tarsld. Cylindric Algebras (Part I). North Holland Publishing Company, 1971.
|
| |
Hoa89
|
C.A.R. Hoare. A theory of conjunction and concurrency. Oxford PRG, May 1989.
|
| |
Hoa90
|
|
 |
JL87
|
|
| |
Jos90
|
Mark B. Josephs. Receptive process theory. Technical report, Programming Research Group, Oxford University, July 1990.
|
| |
JP90
|
|
| |
JPP89
|
|
| |
Kah74
|
G. Kahn. The semantics of a simple language for parallel programming. In J.L. Rosenfeld, editor, Proceeedings of IFIP Congress 74, pages 471- 475., August 1974.
|
| |
KYSK88
|
S. Kliger, E. Yardeni, E. Shapiro, and K. Kahn. The language fcp(:,?). In Conference on Fifth Generation Computer Systems, December 1988.
|
| |
Lev88
|
Giorgio Levi. Models, unfolding rules and fixpoint semantics. In Proceeedings of the Fifth International Conference and Symposium on Logic Programming, Seattle, pages 1649-1665, August 1988.
|
 |
Lin85
|
|
| |
LS86
|
|
| |
Mah87
|
Michael Maher. Logic semantics for a cla.ss of committed-choice programs. In .~th International Conference on Logic Programming. MIT Press, May 1987.
|
| |
Mil90
|
|
| |
MPW89
|
R. Mflner, J. G. Parrow, and D. J. Walker. A calculus for mobile processes. LFCS Report ECS- LFCS-89-85, University of Edinburgh, 1989.
|
| |
MR97
|
M. Makkai and G. Reyes. First order categorical logic, volume 611 of Lecture Notes in Mathematics. Springer-Verlag, 197.
|
| |
OH86
|
|
| |
Plo76
|
G.D. Plotkin. A powerdomain construction. SIAM J. of Computing, 5(3):452-487, September 1976.
|
| |
Ros88
|
A.W. Roscoe. An alternative order for the failures model. Technical Report Technical Monograph PRG-67, Programming Research Group, Oxford University, July 1988.
|
| |
Sar85
|
|
| |
Sar88
|
Vijay A. Saraswat. A somewhat logical formulation of CLP synchronization primitives. In Proceedings of LP 88. MIT Press, August 1988.
|
| |
Sar89
|
|
| |
Sco76
|
Dana S. Scott. Data types as lattices. SIAM, 5(3):522-587, 1976.
|
| |
Sco82
|
|
| |
SKL90
|
|
| |
SPRng
|
Vijay A. Saraswat, Prakash Panang~den, and Martin Rinard. What is a constraint? Technical report, Xerox PARC, forthcoming.
|
 |
SR90
|
|
| |
Tar56
|
A. Tarski. Logics, semantics and metamathematics. Oxford University Press, 1956. Translated by J.H. Woodger.
|
CITED BY 52
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Frank S. de Boer , Maurizio Gabbrielli , Elena Marchiori , Catuscia Palamidessi, Proving concurrent constraint programs correct, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.98-108, January 16-19, 1994, Portland, Oregon, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Mogens Nielsen , Catuscia Palamidessi , Frank D. Valencia, On the expressive power of temporal concurrent constraint programming languages, Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.156-167, October 06-08, 2002, Pittsburgh, PA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Vineet Gupta , Radha Jagadeesan , Prakash Panangaden, Stochastic processes as concurrent constraint programs, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.189-202, January 20-22, 1999, San Antonio, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Vijay A. Saraswat , Radha Jagadeesan , Vineet Gupta, Default timed concurrent constraint programming, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.272-285, January 23-25, 1995, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
Radha Jagadeesan , Will Marrero , Corin Pitcher , Vijay Saraswat, Timed constraint programming: a declarative approach to usage control, Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.164-175, July 11-13, 2005, Lisbon, Portugal
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|