Deadlock Analysis of Wait-Notify Coordination - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Deadlock Analysis of Wait-Notify Coordination

(1) , (2)
1
2

Abstract

Deadlock analysis of concurrent programs that contain coordination primitives (wait, notify and Open image in new window ) is notoriously challenging. Not only these primitives affect the scheduling of processes, but also notifications unmatched by a corresponding wait are silently lost. We design a behavioral type system for a core calculus featuring shared objects and Java-like coordination primitives. The type system is based on a simple language of object protocols – called usages – to determine whether objects are used reliably, so as to guarantee deadlock freedom.
Not file

Dates and versions

hal-02166082 , version 1 (26-06-2019)

Identifiers

  • HAL Id : hal-02166082 , version 1

Cite

Laneve Cosimo, Luca Padovani. Deadlock Analysis of Wait-Notify Coordination. The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy - Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday, 2019, Paris, France. pp.50-67. ⟨hal-02166082⟩
56 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More