1499 search results - page 88 / 300 » Chopping Concurrent Programs |
114
click to vote
CONCUR
2012
Springer
13 years 3 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
TACAS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
201
Voted
CONCUR
2011
Springer
14 years 18 days 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...
ICCS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Camelot is a resource-bounded functional programming language which compiles to Java byte code to run on the Java Virtual Machine. We extend Camelot to include language s...
127
click to vote
TACAS
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...