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


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

Download

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

Description/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

Item Type: Monograph (Project Report)
Organisations: Electronic & Software Systems
ePrint ID: 387011
Date :
Date Event
October 2015Published
Date Deposited: 05 Feb 2016 16:35
Last Modified: 10 Mar 2017 11:13
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/387011

Actions (login required)

View Item View Item