Lazy-CSeq 1.0:(Competition Contribution)

Inverso, Omar, Nguyen, Truc, Tomasco, Ermenegildo, Fischer, Bernd, La Torre, Salvatore and Parlato, Gennaro (2015) Lazy-CSeq 1.0:(Competition Contribution) University of Southampton


[img] PDF SV-COMP_2016_paper_21.pdf - Other
Download (108kB)


Sequentialization translates concurrent programs into (under certain
assumptions) equivalent nondeterministic sequential programs and so reduces
concurrent verification to its sequential counterpart. In previous work, we have
developed and implemented in the Lazy-CSeq tool a lazy sequentialization schema
for bounded programs that introduces very small memory overheads and very few
sources of nondeterminism and is thus very effective in practice [1, 2].
The current version of Lazy-CSeq adds deadlock detection, counterexample gen-
eration, and explicit schedule control. It also implements an improved version of
the original schema, which uses an optimized representation of the context switch
points and eagerly guesses these, but retains its other characteristics. Experiments
show that these optimizations lead to some performance gains.

Item Type: Monograph (Project Report)
Organisations: Electronic & Software Systems
ePrint ID: 387010
Date :
Date Event
October 2015Published
Date Deposited: 05 Feb 2016 16:29
Last Modified: 17 Apr 2017 04:16
Further Information:Google Scholar

Actions (login required)

View Item View Item