Concurrent constraint programming: Towards probabilistic abstract interpretation

Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn , Issue , 2000, Pages 127-138

  Di Pierro, Alessandra ^b   Wiklicky, Herbert ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b NONE

Author keywords

Probabilistic abstract interpretation; Probabilistic concurrent constraint programming; Static analysis

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; CONSTRAINT THEORY; PROBABILITY; SEMANTICS;

CONSTRAINT PROGRAMMING;

COMPUTER PROGRAMMING;

EID: 0034593091     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. S. Abramsky and C. Hankin, editors. Abstract Interpretation of Declarative Languages. Ellis Horwood, Chichester, England, 1987.
2. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Technical Report. CSR-96-12, School of Computer Science, University of Birmingham, June 1996.
3. F. J. Beutler. The operator theory of the pseudo-inverse. Journal of Mathematical Analysis and Applications, 10:451-470,471-493, 1965.
4. P. Billingsley. Probability and Measure. Wiley & Sons, New York, 2nd edition, 1986.
5. S. Bistarelli, P. Codognet, Y. Georget, and F. Rossi. Abstracting soft constraint. In K. Apt, T. Kakas, E. Monfroy, and F. Rossi, editors, Proceedings of the ERCIM/COMPULOG Workshop on Constraints, Pahos, Cyprus, 1999. University of Cyprus.
6. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based constraint satisfaction and optimization. Journal of the ACM, 44(2):201-236, 1997.
7. S. L. Campbell and D. Meyer. Generalized Inverse of Linear Transformations. Constable and Company, London, 1979.
8. P. Cousot. Constructive design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation. In S. Brooks and M. Mislove, editors, 13th International Symposium on Mathematical Foundations of Programming Semantics (MFPS97), volume 6 of Electronic Notes in Theoretical Computer Science, Amsterdam, 1997. Elsevier.
9. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Symposium on Principles of Programming Languages (POPL), pages 238-252, Los Angeles, 1977.
10. P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Symposium on Principles of Programming Languages (POPL), pages 269-282, San Antonio, Texas, 1979.
11. P. Cousot and R. Cousot. Abstract Interpretation and Applications to Logic Programs. Journal of Logic Programming, 13(2-3):103-180, July 1992.
12. P. Cousot and R. Cousot. Inductive Definitions, Semantics and Abstract Interpretation. In 19th ACM Symposium on Principles of Programming Languages (POPL'92), pages 83-94, 1992.
13. D. Dams, R. Gerth, and O. Grumberg. Abstract Interpretations of Reactive Systems. ACM Trans. Program. Lang. Syst., 19(2):253 291, 1997.
14. F. S. de Boer, A. Di Pierro, and C. Palamidessi. Nondeterminism and Infinite Computations in Constraint Programming. Theoretical Computer Science, 151(1):37-78, 1995.
15. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating continuous markov processes. In LICS2000, 2000.
16. A. Di Pierro and H. Wiklieky. An operational semantics for Probabilistic Concurrent Constraint Programming. In P. Iyer, Y. Choo, and D. Schmidt, editors, ICCL'98 - International Conference on Computer Languages, pages 174-183. IEEE Computer Society Press, 1998.
17. A. Di Pierro and H. Wiklicky. Probabilistic Concurrent Constraint Programming: Towards a fully abstract model. In L. Brim, J. Gruska, and J. Zlatuska, editors, MFCS'98 - Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 446-455, Berlin New York, August 1998. Springer Verlag.
18. A. Di Pierro and H. Wiklicky. On the Precision of Abstract Interpretations. In Tenth International Workshop on Logic-based Program Synthesis and Transformation (LOPSTR 2000), pages 36-44, London, UK, 2000.
19. A. Di Pierro and H. Wiklicky. Quantitative observables and averages in Probabilistic Constraint Programming. In K. Apt, A. Kakas, E. Monfroy, and F. Rossi, editors, New Trends in Constraints, volume 1865 of Lecture Notes in Artificial Intelligence. Springer Verlag, 2000.
20. R. Engelking. General Topology, volume 6 of Sigma Series in Pure Mathematics. Heldermann Verlag, Berlin, 1989.
21. M. Falaschi, M. Gabrielli, K. Marriott, and C. Palamidessi. Compositional analysis for concurrent constraint programming. In IEEE Symposium on Logic in Computer Science, (LICS), pages 210-221, 1993.
22. R. Giacobazzi, F. Ranzato, and F. Scozzari. Making Abstract Interpretations Complete. Journal of the ACM, 47(2):361-416, 2000.
23. V. Gupta, R. Jagadeesan, and P. Panangaden. Stochastic programs as concurrent constraint programs. In Symposium on Principles of Programming Languages (POPL). ACM, 1999.
24. R. Jagadeesan, V. Saraswat, and V. Shanbhogue. Angelic non-determinism in concurrent constraint programming. Technical report, Xerox Park, 1991.
25. C. Jones. Probabilistic Non-Determinism. PhD thesis, University of Edinburgh, Edingburgh, 1993.
26. C. Jones and G. Plotkin. A probabilistic powerdomain of evaluations. In Symposium on Logic in Computer Science (LICS), pages 186 195. IEEE Computer Society Press, 1989.
27. A. Jung and R. Tix. The troublesome probabilistic powerdomain. In A. Edalat, A. Jung, K. Keimel, and M. Kwiatkowska, editors, Third Workshop on Computation and Approximation, volume 13 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers B.V., 1998. 23 pages.
28. T. Kohonen. Self-Organization and Associative Memory. Springer-Verlag, Berlin, 3 edition, 1989.
29. D. Kozen. Semantics for probabilistic programs. Journal of Computer and System Sciences, 22:328-350, 1981.
30. M. Kwiatkowska. Infinite Behaviour and Fairness in Concurrent Constraint Programming. In J. W. de Bakker, W. P. Roever, and G. Rozenberg, editors, Semantics: Foundations and Applications, volume 666 of Lecture Notes in Computer Science, pages 348-383, Beekbergen The Nederland, June 1992. REX Workshop, Springer Verlag.
31. C. Morgan, A. McIver, K. Seidel, and J. Sanders. Probabilistic predicate transformers. Technical Report PRG-TR-4-95, Programming Research Group, Oxford University Computing Laboratory, 1995.
32. F. Nielson, H. R. Nielson, and C. Hankin. Principles of Program Aanalysis. Springer Verlag, Berlin Heidelberg, 1999.
33. V. V. Prasolov. Problems and Theorems in Linear Algebra, volume 134 of Translation of Mathematical Monographs. American Mathematical Society, Providence, Rhode Island, 1994.
34. N. Saheb-Djahromi. CPO's of measures for nondeterminism. Theoretical Computer Science, 12:19-37, 1980.
35. V. Saraswat, M. Rinard, and P. Panangaden. Semantics foundations of concurrent constraint programming. In Symposium on Principles of Programming Languages (POPL), pages 333-353. ACM, 1991.