Vasudevan Nalini author Columbia University. Computer Science Edwards Stephen A. author Columbia University. Computer Science Smith Dave Aaron author Columbia University. Computer Science Columbia University. Computer Science originator contributor text Technical reports New York Department of Computer Science, Columbia University 2008 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. Computer science CUCS-053-08 http://hdl.handle.net/10022/AC:P:29609 English NNC NNC 2011-04-26 11:14:57 -0400 2011-08-01 12:43:55 -0400 3905 eng