Sciweavers

6 search results - page 1 / 2
» Reasoning about Java's Reentrant Locks
Sort
View
APLAS
2008
ACM
13 years 5 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...
PPOPP
2011
ACM
12 years 6 months ago
OoOJava: software out-of-order execution
Developing parallel software using current tools can be challenging. Even experts find it difficult to reason about the use of locks and often accidentally introduce race condit...
James Christopher Jenista, Yong Hun Eom, Brian Dem...
TLDI
2005
ACM
126views Formal Methods» more  TLDI 2005»
13 years 9 months ago
Type inference for atomicity
Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...
Cormac Flanagan, Stephen N. Freund, Marina Lifshin
SIGSOFT
2008
ACM
14 years 4 months ago
Randomized active atomicity violation detection in concurrent programs
Atomicity is an important specification that enables programmers to understand atomic blocks of code in a multi-threaded program as if they are sequential. This significantly simp...
Chang-Seo Park, Koushik Sen
CAV
2010
Springer
239views Hardware» more  CAV 2010»
13 years 7 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...