Sequentializing parameterized programs
Sequentializing parameterized programs
We exhibit assertion-preserving (reachability-preserving) transformations from parameterized concurrent shared-memory programs, under a k-round scheduling of processes, to sequential programs. The salient feature of the sequential program is that it tracks the local variables of only one thread at any point, and uses only O(k) copies of shared variables (it does not use extra counters, not even one counter to keep track of the number of threads). Sequentialization is achieved using the concept of a linear interface that captures the effect an unbounded block of processes have on the shared state in a k-round schedule. Linear interfaces in fact serve as summaries for parallel processes, and the sequentialization compiles these linear interfaces to procedural summaries in the sequential program. Our transformation utilizes linear interfaces to sequentialize the program, and to ensure the sequential program explores only reachable states and preserves local invariants.
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Madhusudan, P.
8af89366-038f-4a30-9588-61d3f4477b49
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
La Torre, Salvatore
ec51ffc2-65d9-414e-9dd2-f5f342979c10
Madhusudan, P.
8af89366-038f-4a30-9588-61d3f4477b49
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
La Torre, Salvatore, Madhusudan, P. and Parlato, Gennaro
(2012)
Sequentializing parameterized programs.
4th International Workshop on Foundations of Interface Technologies.
21 pp
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
We exhibit assertion-preserving (reachability-preserving) transformations from parameterized concurrent shared-memory programs, under a k-round scheduling of processes, to sequential programs. The salient feature of the sequential program is that it tracks the local variables of only one thread at any point, and uses only O(k) copies of shared variables (it does not use extra counters, not even one counter to keep track of the number of threads). Sequentialization is achieved using the concept of a linear interface that captures the effect an unbounded block of processes have on the shared state in a k-round schedule. Linear interfaces in fact serve as summaries for parallel processes, and the sequentialization compiles these linear interfaces to procedural summaries in the sequential program. Our transformation utilizes linear interfaces to sequentialize the program, and to ensure the sequential program explores only reachable states and preserves local invariants.
Text
sequ-parameterized.pdf
- Version of Record
More information
e-pub ahead of print date: March 2012
Venue - Dates:
4th International Workshop on Foundations of Interface Technologies, 2012-03-01
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 272453
URI: http://eprints.soton.ac.uk/id/eprint/272453
PURE UUID: d207641e-446b-458c-951b-336d88974575
Catalogue record
Date deposited: 13 Jun 2011 13:31
Last modified: 14 Mar 2024 10:02
Export record
Contributors
Author:
Salvatore La Torre
Author:
P. Madhusudan
Author:
Gennaro Parlato
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