A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An Expressive Framework for Verifying Deadlock Freedom
[chapter]
2013
Lecture Notes in Computer Science
This paper presents an expressive specification and verification framework for ensuring deadlock freedom of shared-memory concurrent programs that manipulate locks. We introduce a novel delayed lockset checking technique to guarantee deadlock freedom of programs with interactions between thread and lock operations. With disjunctive formulae, we highlight how an abstraction based on precise lockset can be supported in our framework. By combining our technique with locklevels, we form a unified
doi:10.1007/978-3-319-02444-8_21
fatcat:e7dxh2jhubbn3imnldqwokbley