Sequentializing parameterized programs

Salvatore La Torre, P. Madhusudan, Gennaro Parlato

Research output: Contribution to journalConference articlepeer-review


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. Our transformation utilizes linear interfaces to sequentialize the program, and to ensure the sequential program explores only reachable states and preserves local invariants.

Original languageEnglish (US)
Pages (from-to)48-55
Number of pages8
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
StatePublished - Jul 15 2012
Event4th Workshop on Foundations of Interface Technologies, FIT 2012 - Tallinn, Estonia
Duration: Mar 25 2012 → …

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Sequentializing parameterized programs'. Together they form a unique fingerprint.

Cite this