21 search results - page 1 / 5 » A Deadlock-Free Semantics for Shared Memory Concurrency |
ICTAC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We design a deadlock-free semantics for a concurrent, functional and imperative programming language where locks are implicitly and univocally associated with pointers. T...
ENTCS
2006
13 years 4 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
SAS
2010
Springer
13 years 3 months ago
2010
Springer
Recent innovations in automatic parallelizing compilers are showing impressive speedups on multicore processors using shared memory with asynchronous channels. We have formulated a...
ISOLA
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Memory models of shared memory concurrent programs define the values a read of a shared memory location is allowed to see. Such memory models are typically weaker than t...
CONCUR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper we show how to compress efficiently the statespace of a concurrent system (here applied to a simple shared memory model, but this is no way limited to that ...