Home

Static Deadlock Detection in SHIM with an Automata Type Checking System

Nalini Vasudevan; Stephen A. Edwards; Dave Aaron Smith

Title:
Static Deadlock Detection in SHIM with an Automata Type Checking System
Author(s):
Vasudevan, Nalini
Edwards, Stephen A.
Smith, Dave Aaron
Date:
Type:
Technical reports
Department:
Computer Science
Permanent URL:
Series:
Columbia University Computer Science Technical Reports
Part Number:
CUCS-053-08
Publisher:
Department of Computer Science, Columbia University
Publisher Location:
New York
Abstract:
With the advent of multicores, concurrent programming languages are become more prevelant. Data Races and Deadlocks are two major problems with concurrent programs. SHIM is a concurrent programming language that guarantees absence of data races through its semantics. However, a program written in SHIM can deadlock if not carefully written. In this paper, we present a divide-and-merge technique to statically detect deadlocks in SHIM. SHIM is asynchronous, but we can greatly reduce its state space without loosing precision because of its semantics.
Subject(s):
Computer science
Item views:
189
Metadata:
text | xml

In Partnership with the Center for Digital Research and Scholarship at Columbia University Libraries/Information Services | Terms of Use