Deadlock-free channels and locks

DOI10.1007/978-3-642-11957-6_22zbMATH Open1260.68078OpenAlexW1569479239MaRDI QIDQ3558239FDOQ3558239

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

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited In (9)

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

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)