Static Trace-Based Deadlock Analysis for Synchronous Mini-Go
Programming Languages
2016-09-05 v2
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.
Keywords
Cite
@article{arxiv.1608.08330,
title = {Static Trace-Based Deadlock Analysis for Synchronous Mini-Go},
author = {Kai Stadtmüller and Martin Sulzmann and Peter Thiemann},
journal= {arXiv preprint arXiv:1608.08330},
year = {2016}
}