A New Type System for Deadlock-Free Processes

DOI10.1007/11817949_16zbMath1151.68537OpenAlexW1560340731MaRDI QIDQ5756618

Naoki Kobayashi

Publication date: 4 September 2007

Published in: CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11817949_16

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (29)

Ghost signals: verifying termination of busy waiting ⋮ Binary Session Types for Psi-Calculi ⋮ Static Trace-Based Deadlock Analysis for Synchronous Mini-Go ⋮ Contracts for Mobile Processes ⋮ Conflation Confers Concurrency ⋮ Effect-polymorphic behaviour inference for deadlock checking ⋮ Name-passing calculi: from fusions to preorders and types ⋮ Comparing type systems for deadlock freedom ⋮ Conversation types ⋮ Separating Sessions Smoothly ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Deadlock checking by a behavioral effect system for lock handling ⋮ Honesty by Typing ⋮ Unnamed Item ⋮ Types for complexity of parallel computation in pi-calculus ⋮ Session coalgebras: a coalgebraic view on session types and communication protocols ⋮ An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems ⋮ Responsiveness in process calculi ⋮ An extensible approach to session polymorphism ⋮ Deadlock Detection in Linear Recursive Programs ⋮ A lightweight deadlock analysis for programs with threads and reentrant locks ⋮ Unnamed Item ⋮ Deadlock analysis of unbounded process networks ⋮ Objects and session types ⋮ Unnamed Item ⋮ Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines ⋮ Prioritise the best variation

This page was built for publication: A New Type System for Deadlock-Free Processes