A minimal property for characterizing deadlock-free programs

DOI10.1016/S0020-0190(00)00158-7zbMath0996.68034OpenAlexW2161091067MaRDI QIDQ1603421

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

static analysisdistributed computingconcurrencytheory of computationdeadlocksprogram properties

Mathematics Subject Classification ID

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

Cites Work

• Distributed deadlock detection
• A general-purpose algorithm for analyzing concurrent programs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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