Work

Sequentializing Parameterized Programs

Year: 2012

Type: article

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

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.87.4

Authors: Salvatore La Torre, P. Madhusudan, Gennaro Parlato

Institutions: University of Salerno, University of Illinois Urbana-Champaign, University of Southampton

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: National Science Foundation, Ministero dell’Istruzione, dell’Università e della Ricerca, Università degli Studi di Salerno

Award: CAREER: The Automata Theoretic Method in Software Verification