Effectively-propositional reasoning about reachability in linked data structures

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

Volumn 8044 LNCS, Issue , 2013, Pages 756-772

  Itzhaky, Shachar ^a   Banerjee, Anindya ^b   Immerman, Neil ^c   Nanevski, Aleksandar ^b   Sagiv, Mooly ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b IMDEA SOFTWARE INSTITUTE   (Spain)

^c UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURE INVARIANTS; DESCRIPTIVE COMPLEXITY; FUNCTION SYMBOLS; LINKED DATA STRUCTURES; PROGRAM TERMINATION; SAFETY PROPERTY; THEOREM PROVERS; TRANSITIVE CLOSURE;

COMPUTER AIDED ANALYSIS; DECISION THEORY; FORMAL LOGIC; THEOREM PROVING;

DATA STRUCTURES;

EID: 84881183094     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-39799-8_53     Document Type: Conference Paper

References (22)

1. SMTLIB: Satisfiability modulo theories library, http://smtlib.cs.uiowa. edu/docs.html
2. Technical report, http://www.cs.tau.ac.il/~shachar/dl/tr-2013.pdf
3. Bouajjani, A., Drǎgoi, C., Enea, C., Sighireanu, M.: Accurate invariant checking for programs manipulating lists and arrays with infinite data. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol. 7561, pp. 167-182. Springer, Heidelberg (2012)
4. de Moura, L., Bjørner, N.S.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
5. Demetrescu, C., Italiano, G.F.: Decremental all-pairs shortest paths. In: Encyclopedia of Algorithms (2008)
6. Dong, G., Su, J.: Incremental maintenance of recursive views using relational calculus/sql. SIGMOD Record 29, 44-51 (2000)
7. Flanagan, C., Saxe, J.B.: Avoiding exponential explosion: generating compact verification conditions. In: POPL (2001)
8. Frade, M., Pinto, J.: Verification conditions for source-level imperative programs. Computer Science Review 5(3), 252-277 (2011)
9. Henriksen, J., Jensen, J., Jørgensen, M., Klarlund, N., Paige, B., Rauhe, T., Sandholm, A.: Mona: Monadic second-order logic in practice. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 89-110. Springer, Heidelberg (1995) (Pubitemid 126004023)
10. Hesse, W.: Dynamic computational complexity. PhD thesis, Dept. of Computer Science, University of Massachusetts, Amherst, MA (2003)
11. Immerman, N., Rabinovich, A., Reps, T., Sagiv, M., Yorsh, G.: The boundary between decidability and undecidability for transitive-closure logics. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 160-174. Springer, Heidelberg (2004) (Pubitemid 39751586)
12. Kautz, H., Selman, B.: Knowledge compilation and theory approximation. J. ACM 43(2), 193-224 (1996)
13. Lahiri, S.K., Qadeer, S.: Back to the future: revisiting precise program verification using smt solvers. In: POPL (2008)
14. Lev-Ami, T., Immerman, N., Reps, T.W., Sagiv, M., Srivastava, S., Yorsh, G.: Simulating reachability using first-order logic with applications to verification of linked data structures. Logical Methods in Computer Science 5(2) (2009)
15. Madhusudan, P., Parlato, G., Qiu, X.: Decidable logics combining heap structures and data. In: POPL (2011)
16. McCarthy, J.: Towards a mathematical science of computation. In: IFIP Congress, pp. 21-28 (1962)
17. Møller, A., Schwartzbach, M.I.: The pointer assertion logic engine. In: PLDI (2001)
18. Nelson, G.: Verifying reachability invariants of linked structures. In: POPL (1983)
19. Piskac, R., de Moura, L.M., Bjørner, N.: Deciding effectively propositional logic using dpll and substitution sets. J. Autom. Reasoning 44(4), 401-424 (2010)
20. Reps, T.W., Sagiv, M., Loginov, A.: Finite differencing of logical formulas for static analysis. ACM Trans. Program. Lang. Syst. 32(6) (2010)
21. Rinetzky, N., Bauer, J., Reps, T.W., Sagiv, S., Wilhelm, R.: A semantics for procedure local heaps and its abstractions. In: POPL (2005)
22. Yorsh, G., Rabinovich, A.M., Sagiv, M., Meyer, A., Bouajjani, A.: A logic of reachable patterns in linked data-structures. J. Log. Algebr. Program 73(1-2), 111-142 (2007)