Lazy Sequentialization for TSO and PSO via Shared Memory Abstractions

Tomasco, Ermenegildo, Nguyen Lam, Truc, Inverso, Omar, Fischer, Bernd, La Torre, Salvatore and Parlato, Gennaro (2016) Lazy Sequentialization for TSO and PSO via Shared Memory Abstractions At Formal Methods in Computer-Aided Design (FMCAD), United States. 02 - 06 Oct 2016.


[img] PDF tsopso.pdf - Other
Download (244kB)
[img] PDF tsopsowithappendix.pdf - Other
Download (318kB)


Lazy sequentialization is one of the most effective approaches for the bounded verification of concurrent programs. Existing tools assume sequential consistency (SC), thus the feasibility of lazy sequentializations for weak memory models (WMMs) remains untested. Here, we describe the first lazy sequentialization approach for the total store order (TSO) and partial store order (PSO) memory models. We replace all shared memory accesses with operations on a shared memory abstraction (SMA), an abstract data type that encapsulates the semantics of the underlying WMM and implements it under the simpler SC model. We give efficient SMA implementations for TSO and PSO that are based on temporal circular doubly-linked lists, a new data structure that allows an efficient simulation of the store buffers. We show experimentally, both on the SV-COMP concurrency benchmarks and a real world instance, that this approach works well in combination with lazy sequentialization on top of bounded model checking.

Item Type: Conference or Workshop Item (Paper)
Venue - Dates: Formal Methods in Computer-Aided Design (FMCAD), United States, 2016-10-02 - 2016-10-06
Organisations: Electronic & Software Systems
ePrint ID: 397759
Date :
Date Event
2 May 2016Submitted
9 July 2016Accepted/In Press
Date Deposited: 05 Jul 2016 15:53
Last Modified: 17 Apr 2017 02:26
Further Information:Google Scholar

Actions (login required)

View Item View Item