Quantitative Separation Logic and programs with lists

Journal of Automated Reasoning

Volumn 45, Issue 2, 2010, Pages 131-156

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

^a VERIMAG   (France)

Author keywords

List structures; Program verification; Separation Logic

Indexed keywords

ATOMIC FORMULAE; FIRST ORDER LOGIC; LIST STRUCTURES; LOGICAL VARIABLES; MODEL-THEORETIC; NATURAL NUMBER; PRESBURGER; PROGRAM VERIFICATION; QUANTITATIVE SEPARATION; SEPARATION LOGIC; SHAPE GRAPH; SINGLY-LINKED LIST;

COMPUTABILITY AND DECIDABILITY;

EID: 77955709969     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/s10817-010-9179-9     Document Type: Article

References (24)

1. ARMC. http://www.mpi-sb.mpg.de/~rybal/armc/. Accessed 30 June 2010
2. ASPIC. http://laure.gonnord.org/pro/aspic/aspic.html. Accessed 30 June 2010
3. L2CA. http://www-verimag.imag.fr/~async/L2CA/l2ca.html. Accessed 30 June 2010
4. Smallfoot. http://www.dcs.qmul.ac.uk/research/logic/theory/projects/ smallfoot/index.html. Accessed 30 June 2010
5. Annichini, A., Bouajjani, A., Sighireanu, M.: Trex: a tool for reachability analysis of complex systems. In: Proc. CAV. 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: Proc. TACAS. LNCS, vol.2725. Springer, Heidelberg (2004)
7. Benedikt, M., Reps, T., Sagiv, M.: A decidable logic for describing linked data structures. In: Proc. European Symposium on Programming. LNCS. Springer, Heidelberg (1999)
8. Berdine, J., Calcagno, C., O'Hearn, P.: A decidable fragment of separation logic. In: FSTTCS. 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: Proc. Computer Aided Verification (CAV). LNCS. Springer, Heidelberg (2006)
10. Bouajjani,A., Drǎgoi, C., Enea, C., Sighireanu, M.:Alogic-based framework for reasoning about composite data structures. In: CONCUR 2009: Proceedings of the 20th International Conference on Concurrency Theory, pp. 178-195. Springer, Heidelberg (2009)
11. Brochenin, R., Demri, S., Lozes, E.: On the almighty wand. In: CSL '08: Proceedings of the 22nd International Workshop on Computer Science Logic, pp. 323-338. Springer, Heidelberg (2008)
12. Burstall, R.M.: Some techniques for proving correctness of programs which alter data structures. Mach. Intell. 7, 23-50 (1972)
13. Gulwani, S., Tiwari, A.: An abstract domain for analyzing heap-manipulating low-level software. In: Computer Aided Verification. LNCS, vol.4590, pp. 379-392. Springer, Heidelberg (2007)
14. Immerman, N., Rabinovich, A., Reps, T., Sagiv, M., Yorsh, G.: Verification via structure simulation. In: CAV. LNCS, vol.3114. Springer, Heidelberg (2004)
15. Ishtiaq, S., O'Hearn, P.: BI as an assertion language for mutable data structures. In: POPL. Springer, Heidelberg (2001)
16. Magill, S., Berdine, J., Clarke, E., Cook, B.: Arithmetic strengthening for shape analysis. In: SAS. LNCS, vol.4634. Springer, Heidelberg (2007)
17. Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
18. O'Hearn, P., Calcagno, C., Yang, H.: Computability and complexity results for a spatial assertion language for data structures. In: FSTTCS. LNCS, vol.2245. Springer, Heidelberg (2001)
19. Presburger, M.: Über die Vollstandigkeit eines gewissen Systems der Arithmetik. In: Comptes Rendus du I Congrés des Pays Slaves. Warsaw (1929)
20. 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)
21. Sofronie-Stokkermans, V.: Locality results for certain extensions of theories with bridging functions. In: CADE-22: Proceedings of the 22nd International Conference on Automated Deduction, pp. 67-83. Springer, Heidelberg (2009)
22. Wolper, P., Boigelot, B.: Verifying systems with infinite but regular state spaces. In: Proc. CAV. 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.B., Manna, Z.: Decision procedures for term algebras with integer constraints. Inf. Comput. 204(10), 1526-1574 (2006)