Advertisement
Published in:
2006 | OriginalPaper | Chapter
Model Checking Multithreaded Programs with Asynchronous Atomic Methods
Authors : Koushik Sen, Mahesh Viswanathan
Published in: Computer Aided Verification
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchronously and concurrently on different threads. This paper investigates the problem of model checking programs that follow this idiom. We present a programming language
Spl
that encapsulates this design pattern.
Spl
extends simplified form of sequential Java to which we add the capability of making asynchronous method invocations in addition to the standard synchronous method calls and the ability to execute asynchronous methods in threads atomically and concurrently. Our main result shows that the control state reachability problem for finite
Spl
programs is decidable. Therefore, such multithreaded programs can be model checked using the counterexample guided abstraction-refinement framework.