Sciweavers

67 search results - page 2 / 14
» Local Verification of Global Invariants in Concurrent Progra...
Sort
View
FCSC
2010
170views more  FCSC 2010»
13 years 4 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
CAV
2008
Springer
122views Hardware» more  CAV 2008»
13 years 9 months ago
Thread Quantification for Concurrent Shape Analysis
In this paper we address the problem of shape analysis for concurrent programs. We present new algorithms, based on abstract interpretation, for automatically verifying properties ...
Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Rama...
APLAS
2008
ACM
13 years 9 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
2009
Springer
165views Hardware» more  CAV 2009»
14 years 7 months ago
Symbolic Counter Abstraction for Concurrent Software
Counter Abstraction for Concurrent Software G?erard Basler1 , Michele Mazzucchi1 , Thomas Wahl1,2 , Daniel Kroening1,2 1 Computer Systems Institute, ETH Zurich, Switzerland 2 Compu...
Daniel Kroening, Gérard Basler, Michele Maz...
CAV
2008
Springer
170views Hardware» more  CAV 2008»
13 years 8 months ago
Local Proofs for Linear-Time Properties of Concurrent Programs
Abstract. This paper develops a local reasoning method to check lineartime temporal properties of concurrent programs. In practice, it is often infeasible to model check over the p...
Ariel Cohen 0002, Kedar S. Namjoshi