Sequentializing parameterized programs


La Torre, Salvatore, Madhusudan, P. and Parlato, Gennaro (2012) Sequentializing parameterized programs At 4th International Workshop on Foundations of Interface Technologies. 21 pp.

Download

[img] PDF sequ-parameterized.pdf - Version of Record
Download (235kB)

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

Item Type: Conference or Workshop Item (Paper)
Venue - Dates: 4th International Workshop on Foundations of Interface Technologies, 2012-03-01
Subjects: Q Science > QA Mathematics > QA76 Computer software
Organisations: Electronic & Software Systems
ePrint ID: 272453
Date :
Date Event
March 2012e-pub ahead of print
Date Deposited: 13 Jun 2011 13:31
Last Modified: 23 Feb 2017 08:30
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/272453

Actions (login required)

View Item View Item