A minimal property for characterizing deadlock-free programs

DOI10.1016/S0020-0190(00)00158-7MaRDI QIDQ1603421zbMATH OpenOpenAlexFDO

Authors P. Boronat, Vicent Cholvi

Publication date 14 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(00)00158-7

zbMATH Keywords

distributed computingconcurrencytheory of computationstatic analysisdeadlocksprogram properties

Mathematics Subject Classification ID

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

Recommendations

• A Transformation to Provide Deadlock-Free Programs
• Prevention of deadlocks in parallel programs of multiprocessor machines
• Verification, Model Checking, and Abstract Interpretation
• Deadlock-freedom in resource contentions
• Resource-Oriented Deadlock Analysis

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 108539 (Why is no real title available?)
• scientific article; zbMATH DE number 3359777 (Why is no real title available?)
• A general-purpose algorithm for analyzing concurrent programs
• Distributed deadlock detection

Cited in

(1)

• A Transformation to Provide Deadlock-Free Programs

This page was built for publication: A minimal property for characterizing deadlock-free programs

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