Separation Logic Verification of C Programs with an SMT Solver

Authors:
Matko Botinčan;Matthew Parkinson;Wolfram Schulte
Affiliations:
University of Zagreb, Croatia;University of Cambridge, UK;Microsoft Research, Redmond, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 18
Cited 4

BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extended static checking for Java

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Types, bytes, and separation logic

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verification of C Programs Using Automated Reasoning

SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
Enhancing modular OO verification with separation logic

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Back to the future: revisiting precise program verification using SMT solvers

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations

Journal of Automated Reasoning
Structured Types and Separation Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
jStar: towards practical verification for java

Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
The Why/Krakatoa/Caduceus platform for deductive program verification

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Verifying heap-manipulating programs in an SMT framework

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Separation logic for small-step cminor

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Smallfoot: modular automatic assertion checking with separation logic

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Symbolic execution with separation logic

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
The spec# programming system: an overview

CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
A local shape analysis based on separation logic

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

VCC: A Practical System for Verifying Concurrent C

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Reasoning about memory layouts

Formal Methods in System Design
Safe asynchronous multicore memory operations

ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Natural proofs for structure, data, and separation

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a methodology for automated modular verification of C programs against specifications written in separation logic. The distinguishing features of the approach are representation of the C memory model in separation logic by means of rewrite rules suitable for automation and the careful integration of an SMT solver behind the separation logic prover to guide the proof search.