A logic of reachable patterns in linked data-structures

Journal of Logic and Algebraic Programming

Volumn 73, Issue 1-2, 2007, Pages 111-142

  Yorsh, Greta ^a   Rabinovich, Alexander ^a   Sagiv, Mooly ^a   Meyer, Antoine ^a   Bouajjani, Ahmed ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Decidable logic with reachability; Heap manipulating programs; Pattern; Program verification; Reachability; Routing expression; Shape analysis; Transitive closure logics; Weak monadic second order logic

Indexed keywords

DECIDABLE LOGIC WITH REACHABILITY; HEAP-MANIPULATING PROGRAMS; PROGRAM VERIFICATION; ROUTING EXPRESSION; SHAPE ANALYSIS;

BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER SOFTWARE; DATA STRUCTURES; DYNAMIC PROGRAMMING;

COMPUTABILITY AND DECIDABILITY;

EID: 34447333644     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2006.12.001     Document Type: Article

References (49)

1. Areces C., Blackburn P., and Marx M. Hybrid logics: characterization, interpolation and complexity. J. Symbolic Logic 66 3 (2001) 977-1010
2. Arnborg S., Lagergren J., and Seese D. Easy problems for tree-decomposable graphs. J. Algorithms 12 2 (1991) 308-340
3. I. Balaban, A. Pnueli, L.D. Zuck, Shape analysis by predicate abstraction, in: VMCAI, 2005, pp. 164-180.
4. M. Benedikt, T. Reps, M. Sagiv, A decidable logic for describing linked data structures, in: European Symp. on Programming, March 1999, pp. 2-19.
5. J. Berdine, C. Calcagno, P. O'Hearn, A decidable fragment of separation logic, in: FSTTCS'04, LNCS, vol. 3328, 2004.
6. Bonatti P.A. Towards service description logics. JELIA (2002), Springer-Verlag, London, UK 74-85
7. Bonatti P.A., and Peron A. On the undecidability of logics with converse, nominals, recursion and counting. Artificial Intelligence 158 1 (2004) 75-96
8. Bouajjani A., Habermehl P., Moro P., and Vojnar T. Verifying programs with dynamic 1-selector-linked structures in regular model checking. Proc. of TACAS '05. LNCS vol. 3440 (2005), Springer
9. Bozga M., and Iosif R. Quantitative verification of programs with lists. VISSAS Int. Workshop (2005), IOS Press
10. M. Bozga, R. Iosif, Y. Lakhnech, On logics of aliasing, in: Static Analysis Symp., 2004, pp. 344-360.
11. Burdy L., Cheon Y., Cok D., Ernst M., Kiniry J., Leavens G.T., Leino K.R.M., and Poll E. An overview of jml tools and applications. Int. J. Software Tools Technol. Transfer 7 3 (2005) 212-232
12. C. Calcagno, P. Gardner, M. Hague, From separation logic to first-order logic, in: FOSSACS'05, LNCS, vol. 3441, 2005.
13. C. Calcagno, H. Yang, P. O'Hearn, Computability and complexity results for a spatial assertion language for data structures, in: FSTTCS'01, LNCS, vol. 2245, 2001.
14. D. Calvanese, G. De Giacomo, M. Lenzerini, Reasoning in expressive description logics with fixpoints based on automata on infinite trees, in: IJCAI, 1999, pp. 84-89.
15. Courcelle B. The monadic second-order logic of graphs, ii: Infinite graphs of bounded width. Math. Syst. Theory 21 4 (1989) 187-221
16. Reinhard Diestel, Graph Theory, Springer-Verlag, 2000. Electronic Edition.
17. In: Baader F., et al. (Ed). The Description Logic Handbook: Theory, Implementation, and Applications (2003), Cambridge University Press
18. T. Genet, V. Tong, Reachability analysis of term rewriting systems with timbuk, in: LPAR, 2001, pp. 695-706.
19. L. Georgieva, P. Maier, Description logics for shape analysis, in: SEFM, 2005, pp. 321-331.
20. Grädel E. Guarded fixed point logic and the monadic theory of trees. Theor. Comput. Sci. 288 (2002) 129-152
21. Grädel E., Otto M., and Rosen E. Undecidability results on two-variable logics. Arch. Math. Logic 38 (1999) 313-354
22. Grädel E., and Walukiewicz I. Guarded fixed point logic. LICS'99 (1999), IEEE
23. Graedel E., Kolaitis P., and Vardi M. On the decision problem for two variable logic. Bull. Symbolic Logic (1997)
24. L. Hendren, Parallelizing programs with recursive data structures, Ph.D. thesis, Cornell Univ., Ithaca, NY, January 1990.
25. Hendren L., Hummel J., and Nicolau A. Abstractions for recursive pointer data structures: improving the analysis and the transformation of imperative programs. SIGPLAN Conf. on Prog. Lang. Design and Impl. (1992), ACM Press, New York, NY 249-260
26. J.G. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige, T. Rauhe, A. Sandholm, Mona: Monadic second-order logic in practice, in: TACAS, 1995.
27. Hoare C.A.R. Recursive data structures. Int. J. Comput. Inform. Sci. 4 2 (1975) 105-132
28. Immerman N. Languages that capture complexity classes. SIAM J. Comput. 16 (1987) 760-778
29. N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, G. Yorsh, The boundary between decidability and undecidability of transitive closure logics, in: CSL, 2004.
30. N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, G. Yorsh, Verification via structure simulation, in: CAV, 2004.
31. S.S. Ishtiaq, P.W. O'Hearn, Bi as an assertion language for mutable data structures, in: POPL, 2001, pp. 14-26,.
32. Klarlund N., and Schwartzbach M.I. Graph types. POPL'93 (1993), ACM
33. V. Kuncak, M. Rinard, Generalized records and spatial conjunction in role logic, in: Static Analysis Symp., Verona, Italy, August 26-28, 2004.
34. S.K. Lahiri, S. Qadeer, Verifying properties of well-founded linked lists, in: Symp. on Princ. of Prog. Lang., 2006.
35. T. Lev-Ami, M. Sagiv, TVLA: a system for implementing static analyses, in: Static Analysis Symp., 2000, pp. 280-301.
36. Albert R. Meyer, Weak monadic second-order theory of successor is not elementary recursive, in: Logic Colloquium (Proc. Symposium on Logic, Boston, 1972), vol. 453, 1975, pp. 132-154.
37. A. Møller, M.I. Schwartzbach, The pointer assertion logic engine, in: SIGPLAN Conf. on Prog. Lang. Design and Impl., 2001, pp. 221-231.
38. Mortimer M. On languages with two variables. Z. Math. Logik Grundlagen Math. 21 (1975) 135-140
39. F. Nielson, H. Riis Nielson, H. Seidl, Normalizable horn clauses, strongly recognizable relations, and spi, in: SAS, 2002, pp. 20-35.
40. C.M. Papadimitriou, Addison-Wesley, 1994.
41. Rabin M. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141 (1969) 1-35
42. T. Reps, M. Sagiv, R. Wilhelm, Static program analysis via 3-valued logic, in: CAV, 2004, pp. 15-30.
43. Reynolds J.C. Separation logic: a logic for shared mutable data structures. LICS'02 (2002), IEEE
44. Robertson N., and Seymour P.D. Graph minors. ii. algorithmic aspects of tree-width. J. Algorithms 7 3 (1986) 309-322
45. Sagiv M., Reps T., and Wilhelm R. Solving shape-analysis problems in languages with destructive updating. ACM Trans. Program. Lang. Syst. 20 1 (1998) 1-50
46. M. Sagiv, T. Reps, R. Wilhelm, Parametric shape analysis via 3-valued logic, ACM Trans. Program. Lang. Syst., 2002.
47. U. Sattler, M.Y. Vardi, The hybrid-calculus, in: IJCAR, 2001, pp. 76-91.
48. D. Seese, Interpretability and tree automata: a simple way to solve algorithmic problems on graphs closely related to trees, in: Tree Automata and Languages, 1992, pp. 83-114.
49. G. Yorsh, M. Sagiv, A. Rabinovich, A. Bouajjani, A. Meyer, Verification framework based on the logic of reachable patterns, in preparation.