Linear functional fixed-points

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

Volumn 5643 LNCS, Issue , 2009, Pages 124-139

  Bjørner, Nikolaj ^a   Hendrix, Joe ^a  

^a MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTION REFINEMENT; DECISION PROCEDURE; FIXED POINTS; FIXED-POINT LOGIC; LINEAR TIME TEMPORAL LOGIC; PROGRAM VERIFICATION; REACHABILITY; SATISFIABILITY CHECKER; TEMPORAL ABSTRACTION;

ABSTRACTING; COMPUTER AIDED ANALYSIS;

TEMPORAL LOGIC;

EID: 70350223976     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02658-4_13     Document Type: Conference Paper

References (22)

1. Alur, R., Henzinger, T.A.: A really temporal logic. J. ACM 41(1), 181-204 (1994)
2. Balaban, I., Pnueli, A., Zuck, L.D.: Shape analysis of single-parent heaps. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 91-105. Springer, Heidelberg (2007)
3. Bjørner, N., Hendrix, J.: Linear functional fixed-points. Technical Report MSRTR-2009-8, Microsoft Research (2009)
4. Börger, E., Grädel, Gurevich: The Classical Decision Problem. Springer, Heidelberg (1996)
5. de Moura, L., Bjørner, N.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
6. Immerman, N., Rabinovich, A.M., Reps, T.W., Sagiv, S., 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)
7. Lahiri, S.K., Qadeer, S.: Verifying properties of well-founded linked lists. In: Principles of Programming Languages (POPL 2006), pp. 115-126 (2006)
8. Lahiri, S.K., Qadeer, S.: Back to the future: revisiting precise program verification using SMT solvers. In: POPL, pp. 171-182. ACM, New York (2008)
9. Lev-Ami, T., Immerman, N., Reps, T.W., Sagiv, S., Srivastava, S., Yorsh, G.: Simulating reachability using first-order logic with applications to verification of linked data structures. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS, vol. 3632, pp. 99-115. Springer, Heidelberg (2005)
10. Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)
11. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)
12. McPeak, S., Necula, G.C.: Data structure specifications via local equality axioms. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 476-490. Springer, Heidelberg (2005)
13. Møller, A., Schwartzbach, M.I.: The pointer assertion logic engine. In: Program-ming Language Design and Implementation (PLDI 2001), pp. 221-231 (2001)
14. Nelson, G.: Verifying Reachability Invariants of Linked Structures. In: Principles of Programming Languages (POPL 1983), pp. 38-47 (1983)
15. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1(2), 245-257 (1979)
16. Rakamarić, Z., Bingham, J., Hu, A.J.: An inference-rule-based decision procedure for verification of heap-manipulating programs with mutable data and cyclic data structures. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 106-121. Springer, Heidelberg (2007)
17. Ranise, S., Zarba, C.G.: A Theory of Singly-Linked Lists and its Extensible Decision Procedure. In: SEFM 2006, pp. 206-215 (2006)
18. Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: 17th LICS, pp. 55-74. IEEE Computer Society, Los Alamitos (2002)
19. Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics.
20. J. ACM 32(3), 733-749 (1985)
21. Wolper, P.: Specification and synthesis of communicating processes using an extended temporal logic. In: POPL, pp. 20-33 (1982)
22. Yorsh, G., Rabinovich, A.M., Sagiv, S., Meyer, A., Bouajjani, A.: A logic of reachable patterns in linked data-structures. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 94-110. Springer, Heidelberg (2006)