Description logics for shape analysis

Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005

Volumn , Issue , 2005, Pages 321-330

  Georgieva, Lilia ^a   Maier, Patrick ^b  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT SETS; DESCRIPTION LOGIC; LOGICAL FORMULAS; PARAMETERIZED; PREDICATE ABSTRACTIONS; PROGRAM STATE; SHAPE ANALYSIS; SYMBOLIC REPRESENTATION;

FORMAL LANGUAGES; GRAPHIC METHODS; SOFTWARE ENGINEERING;

DATA DESCRIPTION;

EID: 37349011148     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2005.16     Document Type: Conference Paper

References (28)

1. F. Baader, D. Calvanese, D. L. McGuinness, D. Nardi, and P. F. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2003.
2. T. Ball, A. Podelski, and S. Rajamani. Boolean and cartesian abstraction for model checking C programs. In Proc. TACAS'01, LNCS 2031, pages 268-283. Springer, 2001.
3. P. Bonatti and A. Peron. On the undecidability of logics with converse, nominals, recursion and counting. Artificial Intelligence, 158:75-96, 2004.
4. D. Calvanese, G. De Giacomo, and M. Lenzerini. Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In Proc. IJCAI'99, pages 84-89. Morgan Kaufmann, 1999.
5. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis by construction of approximation of fixed points. In Proc. POPL'77, pages 238-252. ACM Press, 1977.
6. P. Fradet and D. Metayer. Shape types. In Proc. POPL'97, pages 27-39. ACM Press, 1997.
7. E. Grädel. On the restraining power of guards. J. Symbolic Logic, 64:1719-1742, 1999.
8. E. Grädel and I. Walukiewicz. Guarded fixed point logic. In Proc. LICS'99, pages 45-54. IEEE Computer Society Press, 1999.
9. S. Graf and H. Saidi. Construction of abstract shape graphs with PVS. In Proc. CAV'97, LNCS 1254, pages 72-83. Springer, 1997.
10. V. Haarslev and R. Möller. RACER system description. In Proc. IJCAR'01, LNCS 2083, pages 29-44. Springer, 2001.
11. J. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In Proc. TACAS'95, LNCS 1019, pages 89-110, 1995.
12. I. Horrocks. Using an expressive description logic: FaCT or fiction? In Proc. KR'98, pages 636-647. Morgan Kaufman, 1998.
13. N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, and G. Yorsh. The boundary between decidability and undecidability for transitive-closure logics. In Proc. CSL'04, LNCS 3210, pages 160-174. Springer, 2004.
14. N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, and G. Yorsh. Verification via structure simulation. In Proc. CAV'04, LNCS 3114, pages 281-294. Springer, 2004.
15. D. Kozen. Results on the propositional ?-calculus. In Proc. ICALP'82, LNCS 140, pages 348-359. Springer, 1982.
16. V. Kuncak and M. Rinard. On role logic. Technical Report 925, MIT Computer Science and Artificial Intelligence Laboratory, 2003.
17. T. Lev-Ami and S. Sagiv. TVLA: A system for implementing static analyses. In Proc. SAS'00, LNCS 1824, pages 280-301. Springer, 2000.
18. A. Møller and M. I. Schwartzbach. The pointer assertion logic engine. In Proc. PLDI'01, pages 221-231, 2001.
19. A. Podelski and T. Wies. Boolean heaps. In Proc. SAS'05, 2005. To appear.
20. I. Pratt-Hartmann. Complexity of the two-variable fragment with counting quantifiers. J. of Logic, Language and Information. To appear.
21. A. Rensink. Canonical graph shapes. In Proc. ESOP'04, LNCS 2986, pages 401-415. Springer, 2004.
22. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. TOPLAS, 24:217-298, 2002.
23. U. Sattler and M. Y. Vardi. The hybrid ?-calculus. In Proc. IJCAR'01, LNAI 2083, pages 76-91. Springer, 2001.
24. M. Schmidt-Schauß and G. Smolka. Attributive concept descriptions with complements. J. Artificial Intelligence, 48:1-26, 1991.
25. R. S. Streett and E. A. Emerson. An automata theoretic decision procedure for the propositional ?-calculus. Information and Computation, 81:249-264, 1989.
26. C. Weidenbach, U. Brahm, T. Hillenbrand, E. Keen, C. Theobald, and D. Topic. SPASS version 2. 0. In Proc. CADE'02, LNCS 2392, pages 275-279. Springer, 2002.
27. T. Wies. Symbolic shape analysis. Master's thesis, MPI Informatik, Saarbrücken, Germany, 2004.
28. G. Yorsh, T. Reps, and S. Sagiv. Symbolically computing most-precise abstract operations for shape analysis. In Proc. TACAS'04, LNCS 2988, pages 530-545. Springer, 2004.