The University of Southampton
University of Southampton Institutional Repository

Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C with unboundedly many Context Switches: (Competition Contribution)

Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C with unboundedly many Context Switches: (Competition Contribution)
Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C with unboundedly many 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 do not bound here the number of round-robin schedules in an
execution and the loops that do not contain a thread creation statement are not
unwound (and thus unboundedly many iterations can be considered). As in Lazy-
CSeq the number of thread creations per run is bounded as well as the depth of
recursive calls. For the experiments we use CPAChecker as backend
University of Southampton
Nguyen, Truc
0a373da7-0868-466d-a3b8-060868037acc
Inverso, Omar
1a7b5398-791c-479b-88c9-2442212d0a28
Tomasco, Ermenegildo
7b944585-0193-4dab-861b-8d5cdccf82cd
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Fischer, Bernd
0c9575e6-d099-47f1-b3a2-2dbc93c53d18
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
Nguyen, Truc
0a373da7-0868-466d-a3b8-060868037acc
Inverso, Omar
1a7b5398-791c-479b-88c9-2442212d0a28
Tomasco, Ermenegildo
7b944585-0193-4dab-861b-8d5cdccf82cd
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Fischer, Bernd
0c9575e6-d099-47f1-b3a2-2dbc93c53d18
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923

Nguyen, Truc, Inverso, Omar, Tomasco, Ermenegildo, La Torre, Salvatore, Fischer, Bernd and Parlato, Gennaro (2015) Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C with unboundedly many Context Switches: (Competition Contribution) University of Southampton

Record type: Monograph (Project Report)

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 do not bound here the number of round-robin schedules in an
execution and the loops that do not contain a thread creation statement are not
unwound (and thus unboundedly many iterations can be considered). As in Lazy-
CSeq the number of thread creations per run is bounded as well as the depth of
recursive calls. For the experiments we use CPAChecker as backend

PDF SV-COMP_2016_paper_28.pdf - Other
Download (96kB)

More information

Published date: October 2015
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 387011
URI: http://eprints.soton.ac.uk/id/eprint/387011
PURE UUID: 273bbd75-b37c-4cd6-b513-747bf5a64406

Catalogue record

Date deposited: 05 Feb 2016 16:35
Last modified: 17 Jul 2017 19:45

Export record

Contributors

Author: Truc Nguyen
Author: Omar Inverso
Author: Ermenegildo Tomasco
Author: Salvatore La Torre
Author: Bernd Fischer
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.

×