Types for deadlock-free higher-order programs

DOI10.1007/978-3-319-19195-9_1MaRDI QIDQ2827445zbMATH OpenOpenAlexFDO

Authors Luca Padovani, Luca Novara

Publication date 19 October 2016

Published in Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01767327/file/978-3-319-19195-9_1_Chapter.pdf

Mathematics Subject Classification ID

Theory of programming languages (68N15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A New Type System for Deadlock-Free Processes
• A type system for lock-free processes
• scientific article; zbMATH DE number 1759631
• scientific article; zbMATH DE number 1231692
• Comparing type systems for deadlock freedom

Cited in

(26)

• A type system for lock-free processes
• Comparing type systems for deadlock freedom
• Towards static deadlock resolution in the -calculus
• A Hybrid Type System for Lock-Freedom of Mobile Processes
• scientific article; zbMATH DE number 1231503 (Why is no real title available?)
• scientific article; zbMATH DE number 1231692 (Why is no real title available?)
• scientific article; zbMATH DE number 1302023 (Why is no real title available?)
• scientific article; zbMATH DE number 1735626 (Why is no real title available?)
• Type and behaviour reconstruction for higher-order concurrent programs
• scientific article; zbMATH DE number 1088044 (Why is no real title available?)
• scientific article; zbMATH DE number 1759483 (Why is no real title available?)
• scientific article; zbMATH DE number 1759631 (Why is no real title available?)
• Deadlock and lock freedom in the linear -calculus
• Comparing deadlock-free session typed processes
• Type-safe higher-order channels in ML-like languages
• Type-safe higher-order channels with channel locality
• Fencing off Go: liveness and safety for channel-based programming
• scientific article; zbMATH DE number 2242604 (Why is no real title available?)
• Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts
• A New Type System for Deadlock-Free Processes
• Type systems for concurrent programs.
• Asynchronous functional sessions: cyclic and concurrent
• Deadlock Analysis of Wait-Notify Coordination
• Asynchronous session-based concurrency: deadlock-freedom in cyclic process networks
• Deadlock freedom for asynchronous and cyclic process networks
• A gentle overview of asynchronous session-based concurrency: deadlock freedom by typing

This page was built for publication: Types for deadlock-free higher-order programs

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