Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-Threaded C-Programs


Inverso, Omar, Nguyen Lam, Truc, Fischer, Bernd, La Torre, Salvatore and Parlato, Gennaro (2015) Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-Threaded C-Programs At 30th IEEE/ACM International Conference on Automated Software Engineering (ASE 2015).

Download

[img] PDF lazy-cseq-ase.pdf - Accepted Manuscript
Download (281kB)

Description/Abstract

Lazy-CSeq is a context-bounded verification tool for sequentially consistent C programs using POSIX threads. It first translates a multi-threaded C program into a bounded nondeterministic sequential C program that preserves bounded reachability for all round-robin schedules up to a given number of rounds. It then reuses existing high-performance bounded model checkers as sequential verification backends.

Lazy-CSeq handles the full C language and the main parts of the POSIX thread API, such as dynamic thread creation and deletion, and synchronization via thread join, locks, and condition variables.

It supports assertion checking and deadlock detection, and returns counterexamples in case of errors. Lazy-CSeq outperforms other concurrency verification tools and has won the concurrency category of the last two SV-COMP verification competitions.

Item Type: Conference or Workshop Item (Paper)
Venue - Dates: 30th IEEE/ACM International Conference on Automated Software Engineering (ASE 2015), 2015-08-18
Organisations: Electronic & Software Systems
ePrint ID: 379595
Date :
Date Event
18 August 2015Accepted/In Press
Date Deposited: 24 Jul 2015 08:58
Last Modified: 17 Apr 2017 05:34
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/379595

Actions (login required)

View Item View Item