Lazy-CSeq: a lazy sequentialization tool for C


Inverso, Omar, Tomasco, Ermenegildo, Fischer, Bernd, La Torre, Salvatore and Parlato, Gennaro (2014) Lazy-CSeq: a lazy sequentialization tool for C At 20th International Conference Tools and Algorithms for the Construction and Analysis of Systems (TACAS). 05 - 13 Apr 2014. , pp. 398-401. (doi:10.1007/978-3-642-54862-8_29).

Download

[img] PDF chp%3A10.1007%2F978-3-642-54862-8_29.pdf_auth66=1403795058_f11101e40d33f08492c04225c1ca92eb&ext=.pdf - Version of Record
Restricted to Repository staff only

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)
Digital Object Identifier (DOI): doi:10.1007/978-3-642-54862-8_29
Additional Information: Competition contribution
Venue - Dates: 20th International Conference Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2014-04-05 - 2014-04-13
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Organisations: Electronic & Software Systems
ePrint ID: 366335
Date :
Date Event
April 2014Published
Date Deposited: 30 Jun 2014 12:01
Last Modified: 22 Feb 2017 23:59
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/366335

Actions (login required)

View Item View Item