Partial orders for efficient bounded model checking of concurrent software

Authors:
Jade Alglave;Daniel Kroening;Michael Tautschnig
Affiliations:
University College London, UK;University of Oxford, UK;Queen Mary, University of London, UK
Venue:
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Year:
2013

Citing 33
Cited 0

Modeling concurrency with partial orders

International Journal of Parallel Programming
Event structures

Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Using true concurrency to model execution of parallel programs

International Journal of Parallel Programming
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem

Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Shared Memory Consistency Models: A Tutorial

Computer
All from One, One for All: on Model Checking Using Representatives

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Behavioral consistency of C and verilog programs using bounded model checking

Proceedings of the 40th annual Design Automation Conference
The Java memory model

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CheckFence: checking consistency of concurrent data types on relaxed memory models

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs

IEEE Transactions on Computers
Foundations of the C++ concurrency memory model

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Efficient Modeling of Concurrent Systems in BMC

SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Reducing concurrent analysis under a context bound to sequential analysis

Formal Methods in System Design
A Better x86 Memory Model: x86-TSO

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
MemSAT: checking axiomatic specifications of memory models

PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Staged concurrent program analysis

Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering
On interference abstractions

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verifying multi-threaded software using smt-based context-bounded model checking

Proceedings of the 33rd International Conference on Software Engineering
Understanding POWER multiprocessors

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Automatic inference of memory fences

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Getting rid of store-buffers in TSO analysis

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Threader: a constraint-based verifier for multi-threaded programs

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Context-Bounded model checking of concurrent software

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
SATABS: SAT-Based predicate abstraction for ANSI-C

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A memory model sensitive checker for c#

FM'06 Proceedings of the 14th international conference on Formal Methods
Fences in weak memory models (extended version)

Formal Methods in System Design
A Survey of Automated Techniques for Formal Software Verification

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An axiomatic memory model for POWER multiprocessors

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Software verification for weak memory via program transformation

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Checking and enforcing robustness against TSO

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Second competition on software verification

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
CSeq: a sequentialization tool for C

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The number of interleavings of a concurrent program makes automatic analysis of such software very hard. Modern multiprocessors' execution models make this problem even harder. Modelling program executions with partial orders rather than interleavings addresses both issues: we obtain an efficient encoding into integer difference logic for bounded model checking that enables first-time formal verification of deployed concurrent systems code. We implemented the encoding in the CBMC tool and present experiments over a wide range of memory models, including SC, Intel x86 and IBM Power. Our experiments include core parts of PostgreSQL, the Linux kernel and the Apache HTTP server.