The University of Southampton
University of Southampton Institutional Repository

Verifying Multi-threaded Software using SMT-based Context-Bounded Model Checking

Verifying Multi-threaded Software using SMT-based Context-Bounded Model Checking
Verifying Multi-threaded Software using SMT-based Context-Bounded Model Checking
We describe and evaluate three approaches to model check multi-threaded software with shared variables and locks using bounded model checking based on Satisfiability Modulo Theories (SMT) and our modelling of the synchronization primitives of the Pthread library. In the lazy approach, we generate all possible interleavings and call the SMT solver on each of them individually, until we either find a bug, or have systematically explored all interleavings. In the schedule recording approach, we encode all possible interleavings into one single formula and then exploit the high speed of the SMT solvers. In the underapproximation and widening approach, we reduce the state space by abstracting the number of interleavings from the proofs of unsatisfiability generated by the SMT solvers. In all three approaches, we bound the number of context switches allowed among threads in order to reduce the number of interleavings explored. We implemented these approaches in ESBMC, our SMT-based bounded model checker for ANSI-C programs. Our experiments show that ESBMC can analyze larger problems and substantially reduce the verification time compared to state-of-the-art techniques that use iterative context-bounding algorithms or counter-example guided abstraction refinement.
Cordeiro, Lucas
3580f117-e41c-4235-982c-51d383e40883
Fischer, Bernd
0c9575e6-d099-47f1-b3a2-2dbc93c53d18
Cordeiro, Lucas
3580f117-e41c-4235-982c-51d383e40883
Fischer, Bernd
0c9575e6-d099-47f1-b3a2-2dbc93c53d18

Cordeiro, Lucas and Fischer, Bernd (2011) Verifying Multi-threaded Software using SMT-based Context-Bounded Model Checking At International Conference on Software Engineering. 21 - 28 May 2011.

Record type: Conference or Workshop Item (Other)

Abstract

We describe and evaluate three approaches to model check multi-threaded software with shared variables and locks using bounded model checking based on Satisfiability Modulo Theories (SMT) and our modelling of the synchronization primitives of the Pthread library. In the lazy approach, we generate all possible interleavings and call the SMT solver on each of them individually, until we either find a bug, or have systematically explored all interleavings. In the schedule recording approach, we encode all possible interleavings into one single formula and then exploit the high speed of the SMT solvers. In the underapproximation and widening approach, we reduce the state space by abstracting the number of interleavings from the proofs of unsatisfiability generated by the SMT solvers. In all three approaches, we bound the number of context switches allowed among threads in order to reduce the number of interleavings explored. We implemented these approaches in ESBMC, our SMT-based bounded model checker for ANSI-C programs. Our experiments show that ESBMC can analyze larger problems and substantially reduce the verification time compared to state-of-the-art techniques that use iterative context-bounding algorithms or counter-example guided abstraction refinement.

PDF icse2011-slides.pdf - Other
Download (497kB)

More information

Accepted/In Press date: 26 May 2011
Additional Information: Event Dates: May 21-28, 2011
Venue - Dates: International Conference on Software Engineering, 2011-05-21 - 2011-05-28
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 272474
URI: http://eprints.soton.ac.uk/id/eprint/272474
PURE UUID: 45247280-7aae-4d84-95fc-aee09c1f4938

Catalogue record

Date deposited: 15 Jun 2011 14:34
Last modified: 18 Jul 2017 06:24

Export record

Contributors

Author: Lucas Cordeiro
Author: Bernd Fischer

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×