Deadlock Analysis of Wait-Notify Coordination

DOI10.1007/978-3-030-31175-9_4MaRDI QIDQ6489014zbMATH OpenFDO

Authors Cosimo Laneve, Luca Padovani

Publication date 14 March 2024

Full work available at URL https://doi.org/10.1007/978-3-030-31175-9_4

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) 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)

Recommendations

• Deadlock analysis of unbounded process networks
• A Deadlock-Free Semantics for Shared Memory Concurrency
• Deadlock analysis of unbounded process networks
• Deadlock checking by a behavioral effect system for lock handling
• Types for deadlock-free higher-order programs

This page was built for publication: Deadlock Analysis of Wait-Notify Coordination

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