The University of Southampton
University of Southampton Institutional Repository

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

Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-Threaded C-Programs
Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-Threaded C-Programs
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.
Inverso, Omar
1a7b5398-791c-479b-88c9-2442212d0a28
Nguyen Lam, Truc
0a373da7-0868-466d-a3b8-060868037acc
Fischer, Bernd
0c9575e6-d099-47f1-b3a2-2dbc93c53d18
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
Inverso, Omar
1a7b5398-791c-479b-88c9-2442212d0a28
Nguyen Lam, Truc
0a373da7-0868-466d-a3b8-060868037acc
Fischer, Bernd
0c9575e6-d099-47f1-b3a2-2dbc93c53d18
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923

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

Record type: Conference or Workshop Item (Paper)

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.

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

More information

Accepted/In Press date: 18 August 2015
Venue - Dates: 30th IEEE/ACM International Conference on Automated Software Engineering (ASE 2015), 2015-08-18
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 379595
URI: http://eprints.soton.ac.uk/id/eprint/379595
PURE UUID: dd2dbf97-e802-4a7c-8ed2-3d0765755373

Catalogue record

Date deposited: 24 Jul 2015 08:58
Last modified: 17 Jul 2017 20:42

Export record

Contributors

Author: Omar Inverso
Author: Truc Nguyen Lam
Author: Bernd Fischer
Author: Salvatore La Torre
Author: Gennaro Parlato

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.

×