Reasoning about Java's reentrant locks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Reasoning about Java's reentrant locks


This paper presents a verification technique for a concurrent Java-like language with reentrant locks. The verification technique is based on permission-accounting separation logic. As usual, each lock is associated with a resource invariant, when acquiring the lock the resources are obtained by the thread holding the lock, and when releasing the lock, the resources are released. To accommodate for reentrancy, the notion of lockset is introduced: a multiset of locks held by a thread. Keeping track of the lockset enables the logic to ensure that resources are not re-acquired upon reentrancy, thus avoiding the introduction of new resources in the system. To be able to express flexible locking policies, we combine the verification logic with value-parametrized classes. Verified programs satisfy the following properties: data race freedom, absence of null-dereferencing and partial correctness. The verification technique is illustrated on several examples, including a challenging lock-coupling algorithm.
Fichier principal
Vignette du fichier
aplas.pdf (172.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00320115 , version 1 (10-09-2008)


  • HAL Id : inria-00320115 , version 1


Christian Haack, Marieke Huisman, Clément Hurlin. Reasoning about Java's reentrant locks. The Sixth ASIAN Symposium on Programming Languages and Systems (APLAS 2008), Dec 2008, Bangalore, India. ⟨inria-00320115⟩


103 View
236 Download


Gmail Facebook X LinkedIn More