Static Trace-Based Deadlock Analysis for Synchronous Mini-Go
Abstract
We consider the problem of static deadlock detection for programs in the Go programming language which make use of synchronous channel communications. In our analysis, regular expressions extended with a fork operator capture the communication behavior of a program. Starting from a simple criterion that characterizes traces of deadlock-free programs, we develop automata-based methods to check for deadlock-freedom. The approach is implemented and evaluated with a series of examples.
BibTeX
@inproceedings{Stadtmueller-al:APLAS16,
author = {Kai Stadtm{\"{u}}ller and
Martin Sulzmann and
Peter Thiemann},
title = {Static {Trace-Based} Deadlock Analysis for Synchronous {Mini-Go}},
booktitle = {APLAS},
pages = {116--136},
series = {LNCS},
volume = {10017},
year = {2016},
doi = {10.1007/978-3-319-47958-3\_7},
}