The University of Southampton
University of Southampton Institutional Repository

Unbounded Lazy-CSeq: a lazy sequentialization tool for C programs with unbounded context switches (competition contribution)

Unbounded Lazy-CSeq: a lazy sequentialization tool for C programs with unbounded context switches (competition contribution)
Unbounded Lazy-CSeq: a lazy sequentialization tool for C programs with unbounded context switches (competition contribution)
We describe a new CSeq module for the verification of multi-threaded C programs with dynamic thread creation. This module implements a variation of the lazy sequentialization algorithm implemented in Lazy-CSeq. The main novelty is that we now support an unbounded number of context switches and allow unbounded loops, while the number of allowed threads still remains bounded. This is achieved by a modified sequentialization transformation and the use of the CPAChecker as sequential verification backend.
Lam Nguyen, 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
Lam Nguyen, 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

Lam Nguyen, Truc, Fischer, Bernd, La Torre, Salvatore and Parlato, Gennaro (2015) Unbounded Lazy-CSeq: a lazy sequentialization tool for C programs with unbounded context switches (competition contribution) At 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), United Kingdom. 11 - 18 Apr 2015. 3 pp.

Record type: Conference or Workshop Item (Paper)

Abstract

We describe a new CSeq module for the verification of multi-threaded C programs with dynamic thread creation. This module implements a variation of the lazy sequentialization algorithm implemented in Lazy-CSeq. The main novelty is that we now support an unbounded number of context switches and allow unbounded loops, while the number of allowed threads still remains bounded. This is achieved by a modified sequentialization transformation and the use of the CPAChecker as sequential verification backend.

PDF UnboundedLazy.pdf - Other
Download (114kB)

More information

Published date: April 2015
Venue - Dates: 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), United Kingdom, 2015-04-11 - 2015-04-18
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 370672
URI: http://eprints.soton.ac.uk/id/eprint/370672
PURE UUID: 83fe247e-1edb-4074-8f86-a47e5debcc74

Catalogue record

Date deposited: 31 Oct 2014 21:58
Last modified: 17 Jul 2017 21:49

Export record

Contributors

Author: Truc Lam Nguyen
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.

×