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). Tools and Algorithms for the Construction and Analysis of Systems - TACAS (SV-COMP).

Record type: Conference or Workshop Item (Paper)

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.

Text

LazyCsequCOMP13.pdf - Other

Download (134kB)

More information

Published date: 10 April 2014

Venue - Dates: Tools and Algorithms for the Construction and Analysis of Systems - TACAS (SV-COMP), 2014-04-10

Organisations: Electronic & Software Systems

Learn more about Cyber Physical Systems research

Identifiers

Local EPrints ID: 363742

URI: http://eprints.soton.ac.uk/id/eprint/363742

PURE UUID: aadfced6-105b-4b46-930b-299aeaa7ef5c

Catalogue record

Date deposited: 01 Apr 2014 16:35

Last modified: 14 Mar 2024 16:29

Export record

Share this record

Share this on Facebook Share this on Twitter Share this on Weibo

Contributors

Author: Omar Inverso

Author: Ermenegildo Tomasco

Author: Bernd Fischer

Author: Salvatore La Torre

Author: Gennaro Parlato

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

Library staff additional information