Quantitative separation logic and programs with lists

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

Volumn 5195 LNAI, Issue , 2008, Pages 34-49

  Bozga, Marius ^a   Iosif, Radu ^a   Perarnau, Swann ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMIC FORMULAE; AUTOMATED REASONING; JOINT CONFERENCE; QUANTITATIVE SEPARATION; SEPARATION LOGIC;

COMPUTABILITY AND DECIDABILITY; FORMAL LOGIC; ISOMERS; SEPARATION;

AUTOMATA THEORY;

EID: 53149102097     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71070-7_4     Document Type: Conference Paper

References (24)

1. ARMC, http://www.mpi-sb.mpg.de/~rybal/armc/
2. ASPIC, http://www-verimag.imag.fr/~gonnord/aspic/aspic.html
3. L2CA, http://www-verimag.imag.fr/~async/L2CA/12ca.html
4. Smallfoot, http://www.dcs.qmul.ac.uk/research/logic/theory/projects/ smallfoot/index.html
5. Annichini, A., Bouajjani, A., Sighireanu, M.: Trex: A tool for reachability analysis of complex systems. In: Betty, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS. vol. 2102, pp. 368-372. Springer, Heidelberg (2001)
6. Bardin, S., Finkel, A., Leroux, J.. Petrucci, L.: Fast: Fast accelereation of symbolic transition systems. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS. vol. 2988. Springer. Heidelberg (2004)
7. Benedikt, M., Reps, T.. Sagiv, M.: A decidable logic for describing linked data structures. In: Swierstra, S.D. (ed.) ESOP 1999. LNCS. vol. 1576. Springer. Heidelberg (1999)
8. Berdine, J., Calcagno, C.. O'Hearn, P.: A Decidable Fragment of Separation Logic. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328. Springer, Heidelberg (2004)
9. Bouajjani, A., Bozga, M.. Habermehl, P., Iosif, R., Moro, P., Vojnar, T.: Programs with lists are counter automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS. vol. 4144. Springer, Heidelberg (2006)
10. Bozga, M., Iosif, R., Perarnau, S.: Quantitative separation logic and programs with lists. Technical Report TR 2007-9. VERIMAG (2007)
11. Burstall, R.M.: Some techniques for proving correctness of programs which alter data structures. Machine Intelligence 7, 23-50 (1972)
12. Gulwani, S., McCloskey, B., Tiwari, A.: Lifting abstract interpreters to quantified logical domains. In: Proc. 35th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM Press, New York (2008)
13. Gulwani, S., Tiwari, A.: An abstract domain for analyzing heap-manipulating low-level software. In: Proc. Intl. Conference on Computer Aided Verification (2007)
14. Immerman, N., Rabinovich, A., Reps, T., Sagiv, M.. Yorsh, G.: Verification via Structure Simulation. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114. Springer. Heidelberg (2004)
15. Ishtiaq, S., O'Hearn, P.: BI as an assertion language for mutable data structures. In: POPL (2001)
16. Klaedtke, F. Ruess, H.: Monadic second-order logics with cardinalities. In: Proc. 30th International Colloquium on Automata. Languages and Programming. LNCS. Springer, Heidelberg (2003)
17. Magill, S., Berdine, J., Clarke, E., Cook, B.: Arithmetic Strengthening for Shape Analysis. In: Riis Nielson, H., Filé, G. (eds.) SAS 2007. LNCS, vol. 4634. Springer, Heidelberg (2007)
18. Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall. Englewood Cliffs (1967)
19. O'Hearn, P., Calcagno, C. Yang, H.: Computability and Complexity Results for a Spatial Assertion Language for Data Structures. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245. Springer, Heidelberg (2001)
20. Presburger, M.: Über die Vollstandigkeit eines gewissen Systems der Arithmetik. Comptes rendus du I Congrès des Pays Slaves. Warsaw (1929)
21. Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: Proc. 17th IEEE Symposium on Logic in Computer Science. LNCS. Springer. Heidelberg (2002)
22. Wolper, P., Boigelot, B.: Verifying systems with infinite but regular state spaces. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 88-97. Springer, Heidelberg (1998)
23. Yorsh, G., Rabinovich, A., Sagiv, M., Meyer, A., Bouajjani, A.: A logic of reachable patterns in linked data-structures. In: Proc. Foundations of Software Science and Computation Structures. LNCS. Springer, Heidelberg (2006)
24. Zhang, T., Sipma, H., Manna, Z.: Decision procedures for recursive data structures with integer constraints. In: Proc. Intl. Joint Conference of Automated Reasoning (2004)