Model Checking Multithreaded Programs with Asynchronous Atomic Methods

Sen, Koushik; Viswanathan, Mahesh

Permalink

https://hdl.handle.net/2142/11156 Copy

Description

Title

Model Checking Multithreaded Programs with Asynchronous Atomic Methods

Author(s)

• Sen, Koushik
• Viswanathan, Mahesh

Issue Date

2006-01

Keyword(s)

computer science

Abstract

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 counter-example guided abstraction-refinement framework.

Type of Resource

text

Permalink

http://hdl.handle.net/2142/11156

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections