Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Compact finite difference schemes for ocean models: 1. Ocean waves
Journal of Computational Physics
Testing Deadlock-Freedom of Computer Systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A dynamic logic of multiprocessing with incomplete information
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The complexity of problems in systems of communicating sequential processes (Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The Deadlock problem: a classifying bibliography
ACM SIGOPS Operating Systems Review
Code aware resource management
Proceedings of the 5th ACM international conference on Embedded software
Deadlock avoidance, non-linearity and games
VECoS'10 Proceedings of the Fourth international conference on Verification and Evaluation of Computer and Communication Systems
Code aware resource management
Formal Methods in System Design
| Hi-index | 48.22 |
The deadlock avoidance problem may be defined informally as the determination, from some a priori information about the processes, resources, operating system, etc., of the “safe situations” which may be realized without endangering the smooth running of the system. When each process specifies its future needs by a flowchart of need-defined steps, a global approach to the phenomenon and its interpretation as a game between the operating system and the processes allows formalization of risk and safety concepts. The bipartite graph representation of this game may then be used to construct explicitly the set of safe states and to study their properties.