Lazy-CSeq: a lazy sequentialization tool for c (competition contribution)


Inverso, Omar, Tomasco, Ermenegildo, Fischer, Bernd, La Torre, Salvatore and Parlato, Gennaro (2014) Lazy-CSeq: a lazy sequentialization tool for c (competition contribution) At Tools and Algorithms for the Construction and Analysis of Systems - TACAS (SV-COMP).

Download

[img] PDF LazyCsequCOMP13.pdf - Other
Download (134kB)

Description/Abstract

We describe a version of the lazy sequentialization schema by La Torre, Madhusudan, and Parlato that is optimized for bounded programs, and avoids the re-computation of the local state of each process at each context switch. Lazy-CSeq implements this sequentialization schema for sequentially consistent C programs using POSIX threads. Experiments show that it is very competitive.

Item Type: Conference or Workshop Item (Paper)
Venue - Dates: Tools and Algorithms for the Construction and Analysis of Systems - TACAS (SV-COMP), 2014-04-10
Organisations: Electronic & Software Systems
ePrint ID: 363742
Date :
Date Event
10 April 2014Published
Date Deposited: 01 Apr 2014 16:35
Last Modified: 23 Feb 2017 00:53
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/363742

Actions (login required)

View Item View Item