The theory of deadlock avoidance via discrete control

DOI10.1145/1480881.1480913zbMATH Open1315.68073OpenAlexW2067967561MaRDI QIDQ5261522FDOQ5261522

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

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)

Cited In (6)

• Title not available (Why is that?)
• Integrating discrete controller synthesis into a reactive programming language compiler
• Graph Games and Reactive Synthesis
• Concurrency bugs in multithreaded software: modeling and analysis using Petri nets
• Distributed Control of Discrete-Event Systems: A First Step
• A controller synthesis framework for automated service composition

   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 👍 👎

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)