The University of Southampton
University of Southampton Institutional Repository

On Sequentializing Concurrent Programs

Record type: Conference or Workshop Item (Paper)

We propose a general framework for compositional under-approximate concurrent program analyses by reduction to sequential program analyses—so-called sequentializations. We notice the existing sequentializations—based on bounding the number of execution contexts, execution rounds, or delays from a deterministic task-schedule—rely on three key features for scalable concurrent program analyses: (i) reduction to the sequential program model, (ii) compositional reasoning to avoid expensive task-product constructions, and (iii) parameterized exploration bounds. To understand how those sequentializations can be unified and generalized, we define a general framework which preserves their key features, and in which those sequentializations are particular instances. We also identify a most general instance which considers more executions, by composing the rounds of different tasks in any order, restricted only by the unavoidable program and task-creation causality orders. In fact, we show this general instance is fundamentally more powerful by identifying an infinite family of state-reachability problems (to states g1,g2,...) which can be answered precisely with a fixed exploration bound, whereas the existing sequentializations require an increasing bound k to reach each gk. Our framework applies to a general class of shared-memory concurrent programs, with dynamic task-creation and arbitrary preemption.

PDF sas2011.pdf - Accepted Manuscript
Download (831kB)

Citation

Bouajjani, Ahmed, Emmi, Michael and Parlato, Gennaro (2011) On Sequentializing Concurrent Programs At SAS, Italy. 14 - 16 Sep 2011.

More information

Accepted/In Press date: 2011
Additional Information: Event Dates: 14-16 September 2011
Venue - Dates: SAS, Italy, 2011-09-14 - 2011-09-16
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 272451
URI: http://eprints.soton.ac.uk/id/eprint/272451
PURE UUID: 11833c2a-2ab1-4417-96f4-0b14cb15c9a5

Catalogue record

Date deposited: 13 Jun 2011 13:21
Last modified: 18 Jul 2017 06:24

Export record

Contributors

Author: Ahmed Bouajjani
Author: Michael Emmi
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.

×