Deadlock-free channels and locks

DOI10.1007/978-3-642-11957-6_22MaRDI QIDQ3558239zbMATH OpenOpenAlexFDO

Authors K. Rustan M. Leino, Peter Müller, Jan Smans

Publication date 4 May 2010

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11957-6_22

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) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Deadlock-free monitors
• Static deadlock prevention in dynamically configured communication networks
• Discovering and correcting a deadlock in a channel implementation
• Deadlock checking by a behavioral effect system for lock handling
• An Expressive Framework for Verifying Deadlock Freedom

Cited in

(9)

• Discovering and correcting a deadlock in a channel implementation
• Deadlock-free monitors
• Verifying deadlock-freedom of communication fabrics
• Deadlock checking by a behavioral effect system for lock handling
• scientific article; zbMATH DE number 7314999 (Why is no real title available?)
• ConSORT: context- and flow-sensitive ownership refinement types for imperative programs
• Separating Lock-Freedom from Wait-Freedom
• Fencing off Go: liveness and safety for channel-based programming
• Ghost signals: verifying termination of busy waiting

This page was built for publication: Deadlock-free channels and locks

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