A characterization of symmetric semantics by domain complementation

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

Volumn , Issue , 2000, Pages 115-126

  Giacobazzi, Roberto ^a   Mastroeni, Isabella ^a  

^a UNIVERSITY OF VERONA   (Italy)

Author keywords

Abstract interpretation; Concurrent constraint programming; Domain complementation; Program semantics

Indexed keywords

CONSTRAINT THEORY; LOGIC PROGRAMMING; MATHEMATICAL OPERATORS; SEMANTICS; SET THEORY;

PROGRAM SEMANTICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0034593054     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/351268.351281     Document Type: Conference Paper

References (30)

1. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1-168. Clarendon Press, Oxford, U.K., 1994.
2. B. Alpern and F. B. Schneider. Recognizing safety and liveness. Distributed Comp., 2:117-126, 1987.
3. K. R. Apt and G. D. Plotkin. Countable nondeterminism and random assignment. J. ACM, 33(4):724-767, 1986.
4. G. Birkhoff. Lattice Theory. AMS Colloquium Publication, 3rd edition. AMS, Providence, RI, 1967.
5. M. Comini and C. Levi. An algebraic theory of observables. In M. Bruynooghe, editor, Proc. of the 1994 Internat. Logic Programming Symp. (ILPS '94), pages 172-186. The MIT Press, Cambridge, Mass., 1994.
6. A. Cortesi, G. Filé, R. Giaeobazzi, C. Palamidessi, and F. Ranzato. Complementation in abstract interpretation. ACM Trans. Program. Lang. Syst., 19(1):7-47, 1997.
7. P. Cousot. Abstract interpretation. ACM Comput. Surv., 28(2):324-328, 1996.
8. P. Cousot. Constructive design of a hierarchy of semantics of a transition system by abstract interpretation (Invited Paper). In S. Brookes and M. Mislove, editors, Proc. of the 13th Internat. Symp. on Mathematical Foundations of Programming Semantics (MFPS '97), volume 6 of Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam, 1997. URL: http://www.elsevier.nl/locate/entcs/volume6.html, 25 pages, extended version to appear in Theor. Comput. Sci.
9. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the 4th ACM Symp. on Principles of Programming Languages (POPL '77), pages 238-252. ACM Press, New York, 1977.
10. P. Cousot and R. Cousot. Constructive versions of Tarski's fixed point theorems. Pacific J. Math., 82(1):43-57, 1979.
11. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Conference Record of the 6th ACM Symp. on Principles of Programming Languages (POPL '79), pages 269-282. ACM Press, New York, 1979.
12. P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Conference Record of the 19th ACM Symp. on Principles of Programming Languages (POPL '92), pages 83-94. ACM Press, New York, 1992.
13. F. de Boer, M. Gabbrielli, E. Marchiori, and O. Palamidessi. Proving concurrent constraint programs correct. In Conference Record of the ACM Symp. on Principles of Programming Languages (POPL '94). ACM Press, New York, 1994.
14. E. Dijkstra. Guarded commands, nondeterminism and formal derivation of programs. Comm. of The ACM, 18(8):453-457, 1975.
15. P. Dwinger. On the closure operators of a complete lattice, Indagat. Math., 16:560-563, 1954.
16. G. Filé, R. Giacobazzi, and F. Ranzato. A unifying view of abstract domain design. ACM Comput. Surv., 28(2):333-336, 1996.
17. G. Filé and F. Ranzato. Complementation of abstract domains made easy. In M. Mailer, editor, Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming (JICSLP '96), pages 348-362. The MIT Press, Cambridge, Mass., 1996.
18. R. Giacobazzi. "Optimal" collecting semantics for analysis in a hierarchy of logic program semantics. In C. Puech and R. Reischuk, editors, Proc. of the 13th Internat. Symp. on Theoretical Aspects of Computer Science (STACS '96), volume 1046 of Lecture Notes in Computer Science, pages 503-514. Springer-Verlag, Berlin, 1996.
19. R. Giacobazzi, C. Palamidessi, and F. Ranzato. Weak relative pseudo-complements of closure operators. Algebra Universalist 36(3):405-412, 1996.
20. R. Giacobazzi and F. Ranzato. Complementing logic program semantics. In M. Hanus and M. Rodríguez Artalejo, editors, Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP '96), Lecture Notes in Computer Science, pages 238-253. Springer-Verlag, Berlin, 1996.
21. R. Giacobazzi and F. Ranzato. Refining and compressing abstract domains. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proc. of the 24th Internat. Colloq. on Automata, Languages and Programming (ICALP '97), volume 1256 of Lecture Notes in Computer Science, pages 771-781. Springer-Verlag, Berlin, 1997.
22. R. Giaeobazzi and F. Ranzato. The reduced relative power operation on abstract domains. Theor. Comput. Sci, 216:159-211, 1999.
23. L. Henkin, J. Monk, and A. Tarski. Cylindric Algebras. Part I. North-Holland, Amsterdam, 1971.
24. P. V. Hentenryck, V. Saraswat, and Y. Deville. Constraint processing in cc(FD). In A. Podelski, editor, Constraint programming: Basics and trends, volume 910 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1995.
25. C. Hoare. An axiomatic basis for computer programming. Comm. of The ACM, 12(10):576-580, 1969.
26. J. Morgado. Note on complemented closure operators of complete lattices. Portug. Math., 21(3):135-142, 1962.
27. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Comput. Science Dept., Aarhus Univ., Aarhus, Denmark, 1981.
28. V. Saraswat. Concurrent Constraint Programming Languages. The MIT Press, Cambridge, Mass., 1993.
29. V. Saraswat, V. A. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In Conference Record of the 18th ACM Symp. on Principles of Programming Languages (POPL '91), pages 333-353. ACM Press, New York, 1991.
30. Z. Shmuely. The structure of Galois connections. Pacific J. Math., 54(2):209-225, 1974.