The University of Southampton
University of Southampton Institutional Repository

Lazy-CSeq 1.0: (Competition Contribution)

Lazy-CSeq 1.0: (Competition Contribution)
Lazy-CSeq 1.0: (Competition Contribution)
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 generation, 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.
University of Southampton
Inverso, Omar
1a7b5398-791c-479b-88c9-2442212d0a28
Nguyen, Truc
0a373da7-0868-466d-a3b8-060868037acc
Tomasco, Ermenegildo
7b944585-0193-4dab-861b-8d5cdccf82cd
Fischer, Bernd
0c9575e6-d099-47f1-b3a2-2dbc93c53d18
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
Inverso, Omar
1a7b5398-791c-479b-88c9-2442212d0a28
Nguyen, Truc
0a373da7-0868-466d-a3b8-060868037acc
Tomasco, Ermenegildo
7b944585-0193-4dab-861b-8d5cdccf82cd
Fischer, Bernd
0c9575e6-d099-47f1-b3a2-2dbc93c53d18
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923

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

Record type: Monograph (Project Report)

Abstract

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

Text SV-COMP_2016_paper_21.pdf - Other
Download (108kB)

More information

Published date: October 2015
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 387010
URI: https://eprints.soton.ac.uk/id/eprint/387010
PURE UUID: 7993ae64-59c7-4bb9-8aac-b4ec967b8869

Catalogue record

Date deposited: 05 Feb 2016 16:29
Last modified: 26 Jun 2018 16:30

Export record

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×