Model-Checking Parameterized Concurrent Programs Using Linear Interfaces

Torre, Salvatore La, Madhusudan, P. and Parlato, Gennaro (2010) Model-Checking Parameterized Concurrent Programs Using Linear Interfaces. In, CAV, Edinburgh,, UK, 15 - 19 Jul 2010. Springer, 629-644.


[img] PDF - Version of Record
Download (267Kb)


We consider the verification of parameterized Boolean programs— abstractions of shared-memory concurrent programs with an unbounded number of threads. We propose that such programs can be model-checked by iteratively considering the program under k-round schedules, for increasing values of k, using a novel compositional construct called linear interfaces that summarize the effect of a block of threads in a k-round schedule. We also develop a game-theoretic sound technique to show that k rounds of schedule suffice to explore the entire search-space, which allows us to prove a parameterized program entirely correct. We implement a symbolic model-checker, and report on experiments verifying parameterized predicate abstractions of Linux device drivers interacting with a kernel to show the efficacy of our technique.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Event Dates: July 15-19, 2010
ISBNs: 9783642142949
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
ePrint ID: 272454
Accepted Date and Publication Date:
Date Deposited: 13 Jun 2011 13:37
Last Modified: 31 Mar 2016 14:21
Further Information:Google Scholar

Actions (login required)

View Item View Item

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