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


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.

Download

[img] PDF UnboundedLazy.pdf - Other
Download (114kB)

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

Item Type: Conference or Workshop Item (Paper)
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
Related URLs:
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Organisations: Electronic & Software Systems
ePrint ID: 370672
Date :
Date Event
April 2015Published
Date Deposited: 31 Oct 2014 21:58
Last Modified: 17 Apr 2017 07:07
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/370672

Actions (login required)

View Item View Item