The University of Southampton
University of Southampton Institutional Repository

Reducing Context-Bounded Concurrent Reachability to Sequential Reachability

Torre, Salvatore La, Madhusudan, P. and Parlato, Gennaro (2009) Reducing Context-Bounded Concurrent Reachability to Sequential Reachability At CAV, France. 26 Jun - 02 Jul 2009. , pp. 477-492.

Record type: Conference or Workshop Item (Paper)


We give a translation from concurrent programs to sequential programs that reduces the context-bounded reachability problem in the concurrent program to a reachability problem in the sequential one. The translation has two salient features: (a) the sequential program tracks, at any time, the local state of only one thread (though it does track multiple copies of shared variables), and (b) all reachable states of the sequential program correspond to reachable states of the concurrent program. We also implement our transformation in the setting of concurrent recursive programs with finite data domains, and show that the resulting sequential program can be model-checked efficiently using existing recursive sequential program reachability tools.

PDF fulltext.pdf - Version of Record
Download (257kB)

More information

Published date: 2009
Additional Information: Event Dates: June 26 - July 2, 2009
Venue - Dates: CAV, France, 2009-06-26 - 2009-07-02
Organisations: Electronic & Software Systems


Local EPrints ID: 272456
ISBN: 978-3-642-02657-7
PURE UUID: 42852d71-80cb-49f1-869a-c0e0c1296a81

Catalogue record

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

Export record


Author: Salvatore La Torre
Author: P. Madhusudan
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 supports OAI 2.0 with a base URL of

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.