Separation Logic Verification of C Programs with an SMT Solver

Electronic Notes in Theoretical Computer Science

Volumn 254, Issue , 2009, Pages 5-23

  Botinčan, Matko ^a   Parkinson, Matthew ^b   Schulte, Wolfram ^c  

^a UNIVERSITY OF ZAGREB   (Croatia)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c MICROSOFT RESEARCH   (United States)

Author keywords

automated theorem proving; automated verification; C programming language; Separation logic

Indexed keywords

AUTOMATED THEOREM PROVING; AUTOMATED VERIFICATION; C PROGRAMMING LANGUAGES; C PROGRAMS; MEMORY MODELS; MODULAR VERIFICATION; PROOF SEARCH; REWRITE RULES; SEPARATION LOGIC;

AUTOMATION; C (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; LINGUISTICS; PROBLEM SOLVING; SEPARATION;

THEOREM PROVING;

EID: 74249103917     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.09.057     Document Type: Article

References (31)

1. Appel A.W., and Blazy S. Separation logic for small-step cminor. Proceedings of TPHOLs 2007. Lecture Notes in Computer Science volume 4732 (2007), Springer 5-21
2. T. Ball, B. Hackett, S.K. Lahiri, and S. Qadeer. Annotation-based property checking for systems software. Technical Report MSR-TR-2008-82, Microsoft Research, May 2008
3. Barnett M., Leino K.R.M., and Schulte W. The Spec# programming system: An overview. Proceedings of CASSIS 2004. LNCS volume 3362 (2005), Springer 49-69
4. Berdine J., Calcagno C., and O'Hearn P.W. Symbolic execution with separation logic. Proceedings of APLAS 2005. LNCS volume 3780 (2005), Springer 52-68
5. Berdine J., Calcagno C., and O'Hearn P.W. Smallfoot: Modular automatic assertion checking with separation logic. Proceedings of FMCO 2005. LNCS volume 4111 (2006), Springer 115-137
6. Chatterjee S., Lahiri S.K., Qadeer S., and Rakamaric Z. A reachability predicate for analyzing low-level software. Proceedings of TACAS 2007. LNCS volume 4424 (2007), Springer 19-33
7. Chin W.N., David C., Nguyen H.H., and Qin S. Enhancing modular OO verification with separation logic. Proceedings of POPL 2008 (2008), ACM 87-99
8. D. Cock. Bitfields and tagged unions in C: Verification through automatic generation. In Proceedings of VERIFY 2008, volume 372 of CEUR Workshop Proceedings, pages 44-55, 2008
9. E. Cohen, M. Moskal, W. Schulte, and S. Tobies. A precise yet efficient memory model for C. In Proceedings of the 4th International Workshop on Systems Software Verification (SSV'09), 2009
10. Crocker D., and Carlton J. Verification of C programs using automated reasoning. Proceedings of SEFM 2007 (2007), IEEE Computer Society 7-14
11. Dahlweid M., Moskal M., Santen T., Tobies S., and Schulte W. VCC: Contract-based modular verification of concurrent C. ICSE 2009 (2009), ACM
12. de Moura L.M., and Bjørner N. Z3: An efficient SMT solver. Proceedings of TACAS 2008. Lecture Notes in Computer Science volume 4963 (2008), Springer 337-340
13. Distefano D., O'Hearn P.W., and Yang H. A local shape analysis based on separation logic. Proceedings of TACAS 2006. LNCS volume 3920 (2006), Springer 287-302
14. Distefano D., and Parkinson M.J. jStar: Towards practical verification for java. Proceedings of OOPSLA 2008 (2008), ACM 213-226
15. Filliâtre J.C., and Marché C. The Why/Krakatoa/Caduceus platform for deductive program verification. Proceedings of CAV 2007. LNCS volume 4590 (2007), Springer 173-177
16. Flanagan C., Leino K.R.M., Lillibridge M., Nelson G., Saxe J.B., and Stata R. Extended static checking for java. Proceedings of PLDI 2002 (2002), ACM 234-245
17. S. Ishtiaq and P. W. O'Hearn. BI as an assertion language for mutable data structures. In Proceedings of POPL, pages 14-26, 2001
18. Lahiri S.K., and Qadeer S. Back to the future: revisiting precise program verification using SMT solvers. Proceedings of POPL 2008 (2008), ACM 171-182
19. Leroy X., and Blazy S. Formal verification of a c-like memory model and its uses for verifying program transformations. J. Autom. Reasoning 41 1 (2008) 1-31
20. Moy Y. Union and cast in deductive verification. Proceedings of C/C++ Verification Workshop. Lecture Notes in Computer Science volume 4963 (2008), Springer 337-340
21. Mürk O., Larsson D., and Hähnle R. KeY-C: A tool for verification of C programs. Proceedings of CADE 2007. Lecture Notes in Computer Science volume 4603 (2007), Springer 385-390
22. Nguyen H.H., and Chin W.-N. Enhancing program verification with lemmas. Proceedings of CAV 2008. Lecture Notes in Computer Science volume 5123 (2008), Springer 355-369
23. M. Norrish. C formalised in HOL. Technical Report UCAM-CL-TR-453, University of Cambridge, December 1998
24. P.W. O'Hearn, J.C. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In Proceedings of CSL, pages 1-19, 2001
25. J. Peleska and H. Löding. Symbolic and abstract interpretation for C/C++ programs. In Proceedings of the 3rd International Workshop on Systems Software Verification (SSV'08), 2008
26. Rakamaric Z., Bruttomesso R., Hu A.J., and Cimatti A. Verifying heap-manipulating programs in an SMT framework. Proceedings of ATVA 2007. LNCS volume 4762 (2007), Springer 237-252
27. Reynolds J.C. Separation logic: A logic for shared mutable data structures. Proceedings of LICS 2002 (2002), IEEE Computer Society 55-74
28. H. Tuch. Formal Memory Models for Verifying C Systems Code. PhD thesis, University of New South Wales, Australia, 2008
29. Tuch H. Structured types and separation logic. Electr. Notes Theor. Comput. Sci. 217 (2008) 41-59
30. Tuch H., Klein G., and Norrish M. Types, bytes, and separation logic. Proceedings of POPL 2007 (2007), ACM 97-108
31. G. Yorsh. Logical characterizations of heap abstractions. Master's thesis, School of Computer Science, Tel-Aviv University, Israel, 2003