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

DOI10.1145/3009837.3009847zbMath1380.68298arXiv1610.08843OpenAlexW2564372592MaRDI QIDQ5370909

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)

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (8)

A Theory of Formal Choreographic Languages ⋮ Declarative choreographies and liveness ⋮ Partially Typed Multiparty Sessions ⋮ Using session types for reasoning about boundedness in the \(\pi\)-calculus ⋮ Data flow analysis of asynchronous systems using infinite abstract domains ⋮ Operational semantics of a weak memory model with channel synchronization ⋮ Unnamed Item ⋮ Operational semantics of a weak memory model with channel synchronization

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