Fencing off Go: liveness and safety for channel-based programming

DOI10.1145/3009837.3009847MaRDI QIDQ5370909zbMATH OpenOpenAlexFDO

Authors Julien Lange, Nicholas Ng, Bernardo Toninho, Nobuko Yoshida

Publication date 20 October 2017

Published in Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.08843, http://hdl.handle.net/10044/1/43690

zbMATH Keywords

typesprocess calculussafety and livenesschannel-based programmingcompile-time (static) deadlock detectionmessage-passing programming

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Abstract: Go is a production-level statically typed programming language whose design features explicit message-passing primitives and lightweight threads, enabling (and encouraging) programmers to develop concurrent systems where components interact through communication more so than by lock-based shared memory concurrency. Go can only detect global deadlocks at runtime, but provides no compile-time protection against all too common communication mismatches or partial deadlocks. This work develops a static verification framework for liveness and safety in Go programs, able to detect communication errors and partial deadlocks in a general class of realistic concurrent programs, including those with dynamic channel creation, unbounded thread creation and recursion. Our approach infers from a Go program a faithful representation of its communication patterns as a behavioural type. By checking a syntactic restriction on channel usage, dubbed fencing, we ensure that programs are made up of finitely many different communication patterns that may be repeated infinitely many times. This restriction allows us to implement procedures to check for liveness and safety in types which in turn approximates liveness and safety in Go programs. We have implemented a type inference and liveness and safety checks in a tool-chain and tested it against publicly available Go programs. Note: This is a revised extended version of a paper that appeared in POPL 2017, see page 13 for details.

Recommendations

• Static trace-based deadlock analysis for synchronous Mini-Go
• Process-local static analysis of synchronous processes
• Deadlock-free channels and locks
• scientific article; zbMATH DE number 1231692
• Types for deadlock-free higher-order programs

Cited in

(11)

• Static trace-based deadlock analysis for synchronous Mini-Go
• Partially typed multiparty sessions with internal delegation
• scientific article; zbMATH DE number 7566072 (Why is no real title available?)
• Operational semantics of a weak memory model with channel synchronization
• MAG\(\pi\): types for failure-prone communication
• Data flow analysis of asynchronous systems using infinite abstract domains
• Partially Typed Multiparty Sessions
• Operational semantics of a weak memory model with channel synchronization
• Using session types for reasoning about boundedness in the \(\pi\)-calculus
• Declarative choreographies and liveness
• A Theory of Formal Choreographic Languages

This page was built for publication: Fencing off Go: liveness and safety for channel-based programming

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