Formal Verification of a Reader-Writer Lock Implementation in C

Authors:
Mark A. Hillebrand;Dirk C. Leinenbach
Affiliations:
German Research Center for Artificial Intelligence (DFKI), Saarbrücken, Germany;German Research Center for Artificial Intelligence (DFKI), Saarbrücken, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 13
Cited 5

Tentative steps toward a development method for interfering programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying properties of parallel programs: an axiomatic approach

Communications of the ACM
Thread-Modular Verification for Shared-Memory Programs

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Permission accounting in separation logic

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resources, concurrency, and local reasoning

Theoretical Computer Science
A Simple Sequential Reasoning Approach for Sound Modular Verification of Mainstream Multithreaded Programs

Electronic Notes in Theoretical Computer Science (ENTCS)
Certifying low-level programs with hardware interrupts and preemptive threads

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
A Precise Yet Efficient Memory Model For C

Electronic Notes in Theoretical Computer Science (ENTCS)
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
Boogie: a modular reusable verifier for object-oriented programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
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 marriage of rely/guarantee and separation logic

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory

VCC: A Practical System for Verifying Concurrent C

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
A Precise Yet Efficient Memory Model For C

Electronic Notes in Theoretical Computer Science (ENTCS)
Verifying the Microsoft Hyper-V Hypervisor with VCC

FM '09 Proceedings of the 2nd World Congress on Formal Methods
Doomed program points

Formal Methods in System Design
Local verification of global invariants in concurrent programs

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification

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 ...