153 search results - page 3 / 31 » Independence and Concurrent Separation Logic |
SAS
2010
Springer
13 years 7 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...
CONCUR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
ESOP
2004
Springer
14 years 1 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
ESOP
2008
Springer
13 years 10 months ago
2008
Springer