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

DOI10.1145/3009837.3009847zbMATH Open1380.68298arXiv1610.08843OpenAlexW2564372592MaRDI QIDQ5370909FDOQ5370909

Nicholas Ng, Nobuko Yoshida, Bernardo Toninho, Julien Lange

Publication date: 20 October 2017

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

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.

Full work available at URL: https://arxiv.org/abs/1610.08843

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

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)

Cited In (10)

• Using session types for reasoning about boundedness in the \(\pi\)-calculus
• Title not available (Why is that?)
• Operational semantics of a weak memory model with channel synchronization
• Operational semantics of a weak memory model with channel synchronization
• A Theory of Formal Choreographic Languages
• Declarative choreographies and liveness
• Partially Typed Multiparty Sessions
• Partially typed multiparty sessions with internal delegation
• Data flow analysis of asynchronous systems using infinite abstract domains
• MAG\(\pi\): types for failure-prone communication

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)