Resource-Oriented Deadlock Analysis

DOI10.1007/978-3-540-74610-2_21MaRDI QIDQ3608662zbMATH OpenOpenAlexFDO

Authors Lee Naish

Publication date 5 March 2009

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74610-2_21

zbMATH Keywords

committed choice nondeterminismconcurrencycoroutiningdeadlock analysisdining philosophersflounderingpartial order

Mathematics Subject Classification ID

Logic programming (68N17) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Two logical methods of deadlock analysis
• An automatic technique for static deadlock prevention
• Verification, Model Checking, and Abstract Interpretation
• Publication:4727428
• A Transformation to Provide Deadlock-Free Programs

Cited in

(7)

• A generalized deadlock predicate
• A minimal property for characterizing deadlock-free programs
• Two logical methods of deadlock analysis
• An automatic technique for static deadlock prevention
• On deadlocks of exclusive AND-requests for resources
• Deadlock detection in linear recursive programs
• Searching for deadlocks while debugging Concurrent Haskell programs

This page was built for publication: Resource-Oriented Deadlock Analysis

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