Bounded model checking of multi-threaded c programs via lazy sequentialization


Inverso, Omar, Tomasco, Ermenegildo, Fischer, Bernd, La Torre, Salvatore and Parlato, Gennaro (2014) Bounded model checking of multi-threaded c programs via lazy sequentialization At 26th International Conference on Computer Aided Verification (CAV 2014), Austria. 18 - 22 Jul 2014. 18 pp.

Download

[img] PDF LazyCseqPaper.pdf - Other
Download (334kB)

Description/Abstract

Bounded model checking (BMC) has successfully been used for many practical program verification problems, but concurrency still poses a challenge. Here we describe a new approach to BMC of sequentially consistent C programs using POSIX threads. Our approach first translates a multi-threaded C program into a nondeterministic sequential C program that preserves reachability for all round-robin schedules with a given bound on the number of rounds. It then re-uses existing high-performance BMC tools as backends for the sequential verification problem. Our translation is carefully designed to introduce very small memory overheads and very few sources of nondeterminism, so that it produces tight SAT/SMT formulae, and is thus very effective in practice: our prototype won the concurrency category of SV-COMP14. It solved all verification tasks successfully and was 30x faster than the best tool with native concurrency handling.

Item Type: Conference or Workshop Item (Paper)
Venue - Dates: 26th International Conference on Computer Aided Verification (CAV 2014), Austria, 2014-07-18 - 2014-07-22
Related URLs:
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Organisations: Electronic & Software Systems
ePrint ID: 365365
Date :
Date Event
July 2014Published
Date Deposited: 03 Jun 2014 08:51
Last Modified: 23 Feb 2017 00:20
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/365365

Actions (login required)

View Item View Item