Gopherlyzer: Static Trace-Based Deadlock Analysis for Synchronous Mini-Go. 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.
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Igarashi, Atsushi (ed.): Programming languages and systems. 14th Asian symposium, APLAS 2016, Hanoi, Vietnam, November 21--23, 2016. Proceedings (2016)
- Stadtmüller, Kai; Sulzmann, Martin; Thiemann, Peter: Static trace-based deadlock analysis for synchronous mini-go (2016)