Static trace-based deadlock analysis for synchronous Mini-Go

From MaRDI portal




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.





Describes a project that uses

Uses Software






This page was built for publication: Static trace-based deadlock analysis for synchronous Mini-Go

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179284)