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


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.

Download

[img] PDF MU_CSeq2015.pdf - Other
Download (138kB)

Description/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.

Item Type: Conference or Workshop Item (Paper)
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
Related URLs:
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Organisations: Electronic & Software Systems
ePrint ID: 370671
Date :
Date Event
April 2015Published
Date Deposited: 31 Oct 2014 19:20
Last Modified: 17 Apr 2017 07:07
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/370671

Actions (login required)

View Item View Item