The theory of deadlock avoidance via discrete control

DOI10.1145/1480881.1480913MaRDI QIDQ5261522zbMATHOpenAlexFDO

Authors Yin Wang, Stéphane Lafortune, Terence Kelly, Manjunath Kudlur, Scott A. Mahlke

Publication date 3 July 2015

Published in Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.5659

zbMATH Keywords

discrete control theoryparallel programmingconcurrent programmingmulticore processorsmultithreaded programmingdynamic deadlock avoidance

Mathematics Subject Classification ID

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

Recommendations

• An automatic technique for static deadlock prevention
• A Transformation to Provide Deadlock-Free Programs
• Prevention of deadlocks in parallel programs of multiprocessor machines
• Deadlock checking by data race detection
• Deadlock checking by data race detection

Cited in

(11)

• Integrating discrete controller synthesis into a reactive programming language compiler
• Automated deadlock detection in synchronized reentrant multithreaded call-graphs
• Concurrency bugs in multithreaded software: modeling and analysis using Petri nets
• Graph Games and Reactive Synthesis
• A controller synthesis framework for automated service composition
• An automatic technique for static deadlock prevention
• Eliminating concurrency bugs in multithreaded software: an approach based on control of Petri nets
• Generic locking and deadlock-prevention with C++
• Deadlock-free monitors
• scientific article; zbMATH DE number 744042 (Why is no real title available?)
• Distributed Control of Discrete-Event Systems: A First Step

This page was built for publication: The theory of deadlock avoidance via discrete control

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