21 search results - page 1 / 5 » Reasoning about Threads with Bounded Lock Chains |
CONCUR
2011
Springer
12 years 4 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
APLAS
2008
ACM
13 years 6 months ago
2008
ACM
This paper presents a verification technique for a concurrent Java-like language with reentrant locks. The verification technique is based on permissionaccounting separation logic....
CAV
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We propose a new technique for the static analysis of concurrent programs comprised of multiple threads. In general, the problem is known to be undecidable even for progr...
APLAS
2007
ACM
13 years 8 months ago
2007
ACM
We present a resource oriented program logic that is able to reason about concurrent heap-manipulating programs with unbounded numbers of dynamically-allocated locks and threads. T...
FCSC
2010
13 years 1 months ago
2010
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...