Static Deadlock Detection in SHIM with an Automata Type Checking System release_xp66nukarnaztfanyv422djnke

by Nalini Vasudevan, Stephen A. Edwards, Dave Aaron Smith, Columbia University. Computer Science

Published by Columbia University.

2017  

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.
In text/plain format

Archived Files and Locations

application/pdf  54.4 kB
file_k5lmvoyk4reuba73r3khu6eyjy
web.archive.org (webarchive)
www1.cs.columbia.edu (web)
application/pdf  82.6 kB
file_esq32zp5mnewjaooumbb7q3kkm
web.archive.org (webarchive)
academiccommons.columbia.edu (web)
Read Archived PDF
Archived
Type  article-journal
Stage   published
Date   2017-06-16
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 9a807676-de29-471b-aee1-8517ebc56a92
API URL: JSON