The University of Southampton
University of Southampton Institutional Repository

MU-CSeq 0.3: Sequentialization by read-implicit and coarse-grained memory unwindings (competition contribution)

MU-CSeq 0.3: Sequentialization by read-implicit and coarse-grained memory unwindings (competition contribution)
MU-CSeq 0.3: Sequentialization by read-implicit and coarse-grained memory unwindings (competition contribution)
We describe a new CSeq module that implements improved algorithms for the verification of multi-threaded C programs with dynamic thread creation. It is based on sequentializing the programs according to a guessed sequence of write operations in the shared memory (memory unwinding, MU). The original algorithm (implemented in MU-CSeq 0.1) stores the values of all shared variables for each write (read-explicit fine-grained MU), which requires multiple copies of the shared variables. Our new algorithms store only the writes (readimplicit MU) or only a subset of the writes (coarse-grained MU), which reduces the memory footprint of the unwinding and so allows larger unwinding bounds.
Tomasco, Ermenegildo
7b944585-0193-4dab-861b-8d5cdccf82cd
Inverso, Omar
1a7b5398-791c-479b-88c9-2442212d0a28
Fischer, Bernd
0c9575e6-d099-47f1-b3a2-2dbc93c53d18
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
Tomasco, Ermenegildo
7b944585-0193-4dab-861b-8d5cdccf82cd
Inverso, Omar
1a7b5398-791c-479b-88c9-2442212d0a28
Fischer, Bernd
0c9575e6-d099-47f1-b3a2-2dbc93c53d18
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923

Tomasco, Ermenegildo, Inverso, Omar, Fischer, Bernd, La Torre, Salvatore and Parlato, Gennaro (2015) MU-CSeq 0.3: Sequentialization by read-implicit and coarse-grained memory unwindings (competition contribution) At 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), United Kingdom. 11 - 15 Apr 2015. 3 pp.

Record type: Conference or Workshop Item (Paper)

Abstract

We describe a new CSeq module that implements improved algorithms for the verification of multi-threaded C programs with dynamic thread creation. It is based on sequentializing the programs according to a guessed sequence of write operations in the shared memory (memory unwinding, MU). The original algorithm (implemented in MU-CSeq 0.1) stores the values of all shared variables for each write (read-explicit fine-grained MU), which requires multiple copies of the shared variables. Our new algorithms store only the writes (readimplicit MU) or only a subset of the writes (coarse-grained MU), which reduces the memory footprint of the unwinding and so allows larger unwinding bounds.

PDF MU_CSeq2015.pdf - Other
Download (138kB)

More information

Published date: April 2015
Venue - Dates: 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), United Kingdom, 2015-04-11 - 2015-04-15
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 370671
URI: http://eprints.soton.ac.uk/id/eprint/370671
PURE UUID: 8ef95e34-2b3c-441f-b6fb-ac862a4bd16a

Catalogue record

Date deposited: 31 Oct 2014 19:20
Last modified: 17 Jul 2017 21:49

Export record

Contributors

Author: Ermenegildo Tomasco
Author: Omar Inverso
Author: Bernd Fischer
Author: Salvatore La Torre
Author: Gennaro Parlato

University divisions

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 http://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.

×