A logic of reachable patterns in linked data-structures

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

Volumn 3921 LNCS, Issue , 2006, Pages 94-110

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

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTABILITY AND DECIDABILITY; COMPUTER SYSTEMS PROGRAMMING; DATA STRUCTURES; INVARIANCE;

DECIDABLE LOGIC; DESTRUCTIVE POINTER; MUTATIONS;

FORMAL LOGIC;

EID: 33745790035     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11690634_7     Document Type: Conference Paper

References (37)

1. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12(2): 308-340, 1991.
2. I. Balaban, A. Pnueli, and L. D. Zuck. Shape analysis by predicate abstraction. In VMCAI, pages 164-180, 2005.
3. M. Benedikt, T. Reps, and M. Sagiv. A decidable logic for describing linked data structures. In European Symp. On Programming, pages 2-19, March 1999.
4. J. Berdine, C. Calcagno, and P. O'Hearn. A Decidable Fragment of Separation Logic. In FSTTCS'04. LNCS 3328, 2004.
5. A. Bouajjani, P. Habermehl, P.Moro, and T. Vojnar. Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking. In Proc. of TACAS '05, volume 3440 of LNCS. Springer, 2005.
6. M. Bozga and R. Iosif. Quantitative Verification of Programs with Lists. In VISSAS intern, workshop. IOS Press, 2005.
7. M. Bozga, R. Iosif, and Y. Lakhnech. On logics of aliasing. In Static Analysis Symp., pages 344-360, 2004.
8. L. Burdy, Y. Cheon, D. Cok, M. Ernst, J. Kiniry, G. T. Leavens, K. R. M. Leino, and E. Poll. An overview of jml tools and applications. Int. J. on Software Tools for Technology Transfer, 7(3):212-232, 2005.
9. C. Calcagno, P. Gardner, and M. Hague. From Separation Logic to First-Order Logic. In FOSSACS'05. LNCS 3441, 2005.
10. C. Calcagno, H. Yang, and P. O'Hearn. Computability and Complexity Results for a Spatial Assertion Language for Data Structures. In FSTTCS'01. LNCS 2245, 2001.
11. B. Courcelle. The monadic second-order logic of graphs, ii: Infinite graphs of bounded width. Mathematical Systems Theory, 21(4):187-221, 1989.
12. E. Grädel. Guarded fixed point logic and the monadic theory of trees. Theoretical Computer Science, 288:129-152, 2002.
13. E. Grädel, M.Otto, and E.Rosen. Undecidability results on two-variable logics. Archive of Math. Logic, 38:313-354, 1999.
14. E. Grädel and I. Walukiewicz. Guarded Fixed Point Logic. In LICS'99. IEEE, 1999.
15. E. Graedel, P. Kolaitis, and M. Vardi. On the decision problem for two variable logic. Bulletin of Symbolic Logic, 1997.
16. L. Hendren. Parallelizing Programs with Recursive Data Structures. PhD thesis, Cornell Univ., Ithaca, NY, Jan 1990.
17. L. Hendren, J. Hummel, and A. Nicolau. Abstractions for recursive pointer data structures: Improving the analysis and the transformation of imperative programs. In SIGPLAN Conf. on Prog. Lang. Design and Impl., pages 249-260, New York, NY, June 1992. ACM Press.
18. J.G. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In TACAS, 1995.
19. C.A.R. Hoare. Recursive data structures. Int. J. of Comp. and Inf. Sci., 4(2): 105-132, 1975.
20. N. Immerman. Languages that capture complexity classes. SIAM Journal of Computing, 16:760-778, 1987.
21. N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, and G. Yorsh. The boundery between decidability and undecidability of transitive closure logics. In CSL, 2004.
22. N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, and G. Yorsh. Verification via structure simulation. In CAV, 2004.
23. S. S. Ishtiaq and P. W. O'Hearn. Bi as an assertion language for mutable data structures. In POPL, pages 14-26, 2001.
24. N. Klarlund and M. I. Schwartzbach. Graph Types. In POPL'93. ACM, 1993.
25. V. Kuncak and M. Rinard. Generalized records and spatial conjunction in role logic. In Static Analysis Symp., Verona, Italy, August 26-28 2004.
26. S. K. Lahiri and S. Qadeer. Verifying properties of well-founded linked lists. In Symp. on Princ. of Prog. Long., 2006. To appear.
27. T. Lev-Ami and M. Sagiv. TVLA: A system for implementing static analyses. In Static Analysis Symp., pages 280-301, 2000.
28. A. Møller and M.I. Schwartzbach. The pointer assertion logic engine. In SIGPLAN Conf. on Prog. Lang. Design and Impl., pages 221-231, 2001.
29. M. Mortimer. On languages with two variables. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 21:135-140, 1975.
30. M. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141:1-35, 1969.
31. T. Reps, M. Sagiv, and R. Wilhelm. Static program analysis via 3-valued logic. In CAV, pages 15-30, 2004.
32. J. C. Reynolds. Separation Logic: A Logic for Shared Mutable Data Structures. In LICS'02. IEEE, 2002.
33. M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. ACM Transactions on Programming Languages and Systems, 20(1): 1-50, January 1998.
34. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems, 2002.
35. D. Seese. Interpretability and tree automata: A simple way to solve algorithmic problems on graphs closely related to trees. In Tree Automata and Languages, pages 83-114. 1992.
36. G. Yorsh, M. Sagiv, A. Rabinovich, A. Bouajjani, and A. Meyer. A logic of reachable patterns in linked data-structures. Technical report, Tel Aviv University, 2005. Available at "www.cs.tau.ac.il/~gretay".
37. G. Yorsh, M. Sagiv, A. Rabinovich, A. Bouajjani, and A. Meyer. Verification framework based on the logic of reachable patterns. In preparation, 2005.