Sciweavers

64 search results - page 1 / 13
» Formal verification of concurrent programs with read-write l...
Sort
View
FCSC
2010
170views more  FCSC 2010»
13 years 2 months ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li
MEMOCODE
2010
IEEE
13 years 2 months ago
Modular verification of synchronization with reentrant locks
We present a modular approach for verification of synchronization behavior in concurrent programs that use reentrant locks. Our approach decouples the verification of the lock impl...
Tevfik Bultan, Fang Yu, Aysu Betin-Can
APLAS
2008
ACM
13 years 6 months ago
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 permissionaccounting separation logic....
Christian Haack, Marieke Huisman, Clément H...
CAV
2006
Springer
141views Hardware» more  CAV 2006»
13 years 8 months ago
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
Robert Colvin, Lindsay Groves, Victor Luchangco, M...
POPL
2010
ACM
14 years 2 months ago
Sequential Verification of Serializability
Serializability is a commonly used correctness condition in concurrent programming. When a concurrent module is serializable, certain other properties of the module can be verifie...
G. Ramalingam, Hagit Attiya, Noam Rinetzky