Sciweavers

54 search results - page 2 / 11
» Reasoning About Threads Communicating via Locks
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
NGC
2008
Springer
149views Communications» more  NGC 2008»
13 years 4 months ago
A New Type System for JVM Lock Primitives
A bytecode verifier for the Java virtual machine language (JVML) statically checks that bytecode does not cause any fatal error. However, the present verifier does not check correc...
Futoshi Iwama, Naoki Kobayashi
CONCUR
1998
Springer
13 years 9 months ago
Reasoning about Asynchronous Communication in Dynamically Evolving Object Structures
Abstract. This paper introduces a compositional Hoare logics for reasoning about the correctness of systems composed of a dynamically evolving collection of processes (also called ...
Frank S. de Boer
SPIN
2009
Springer
13 years 11 months ago
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks
Abstract. We present a new decision procedure for detecting property violations in pushdown models for concurrent programs that use lock-based synchronization, where each thread’...
Nicholas Kidd, Peter Lammich, Tayssir Touili, Thom...
PPOPP
2011
ACM
12 years 7 months ago
Cooperative reasoning for preemptive execution
We propose a cooperative methodology for multithreaded software, where threads use traditional synchronization idioms such as locks, but additionally document each point of potent...
Jaeheon Yi, Caitlin Sadowski, Cormac Flanagan