Closed and logical relations for overand under-approximation of powersets

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

Volumn 3148, Issue , 2004, Pages 22-37

  Schmidt, David A ^a,b  

^a KANSAS STATE UNIVERSITY   (United States)

^b ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BINARY RELATION; DESCRIPTION LOGIC; GALOIS CONNECTION; HIGHER-ORDER; INNER STRUCTURE; LOGICAL RELATIONS; PRECISE SIMULATION; UNDER-APPROXIMATION;

DATA DESCRIPTION;

EID: 35048852086     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27864-1_5     Document Type: Article

References (28)

1. S. Abramsky. Abstract interpretation, logical relations, and Kan extensions. J. Logic and Computation, 1:5-41, 1990.
2. S. Abramsky. Domain theory in logical form. Ann. Pure Appl. Logic, 51:1-77, 1991.
3. F. Baader, et al. The Description Logic Handbook. Cambridge Univ. Press, 2003.
4. K. Backhouse and R. Backhouse. Galois connections and logical relations. In Mathematics of Program Construction, LNCS 2386. Springer Verlag, 2002.
5. P. Buneman, S. Davidson, and A. Watters. A semantics for complex objects and approximate queries. In 7th ACM Symp. Principles of Database Systems, 1988.
6. M. Ciocoiu. Ontology-based translation. PhD thesis, University of Maryland, 2001.
7. E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. MIT Press, 2000.
8. P. Cousot and R. Cousot. Abstract interpretation frameworks. J. Logic and Computation, 2:511-547, 1992.
9. P. Cousot and R. Cousot. Higher-order abstract interpretation. In Proceedings IEEE Int. Conf. Computer Lang., 1994.
10. D. Dams. Abstract interpretation and partition refinement for model checking. PhD thesis, Technische Universiteit Eindhoven, The Netherlands, 1996.
11. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Trans. Prog. Lang. Systems, 19:253-291, 1997.
12. R. Giacobazzi and E. Quintarelli. Incompleteness, counterexamples, and refinements in abstract model checking. In Static Analysis Symposium, LNCS 2126, pages 356-373. Springer Verlag, 2001.
13. C. Gunter. The mixed power domain. Theoretical Comp. Sci., 103:311-334, 1992.
14. J. Hartmanis and R.E. Stearns. Pair algebras and their application to automata theory. J. Information and Control, 7:485-507, 1964.
15. R. Heckmann. Power domain constructions. PhD thesis, Univ. Saarbrücken, 1990.
16. R. Heckmann. Set domains. In Proc. European Symp. Programming, LNCS, pages 177-196. Springer Verlag, 1990.
17. M.C.B. Hennessy and Robin Milner. Algebraic laws for non-determinism and concurrency. JACM, 32:137-161, 1985.
18. M. Huth, R. Jagadeesan, and D.A. Schmidt. Modal transition systems: a foundation for three-valued program analysis. In Proc. European Symp. Programming, LNCS, pages 155-169. Springer Verlag, 2001.
19. M. Huth, R. Jagadeesan, and D.A. Schmidt. A domain equation for refinement of partial systems. Mathematical Structures in Computer Science, 2004. In press.
20. D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333-354, 1983.
21. K.G. Larsen. Modal Specifications. In Automatic Verification Methods for Finite State Systems, LNCS 407, pages 232-246. Springer Verlag, 1989.
22. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for verification of concurrent systems. Formal Methods in System Design, 6:1-36, 1995.
23. A. Mycroft and N.D. Jones. A relational framework for abstract interpretation. In Programs as Data Objects, LNCS 217, pages 156-171. Springer Verlag, 1985.
24. F. Nielson. Two-level semantics and abstract interpretation. Theoretical Comp. Sci., 69:117-242, 1989.
25. G. Plotkin. Domains. Lecture notes, Univ. Pisa/Edinburgh, 1983.
26. F. Ranzato and F. Tapparo. Strong preservation as completeness in abstract interpretation. In Proc. European Symp. Programming, LNCS 2986, pages 18-32. Springer Verlag, 2004.
27. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. In Proceedings 28th ACM POPL, 1999.
28. D.A. Schmidt. Structure-preserving binary relations for program abstraction. In The Essence of Computation, LNCS 2566, pages 246-266. Springer Verlag, 2002.