59 search results - page 6 / 12 » Barriers in Concurrent Separation Logic |
ESWS
2008
Springer
13 years 10 months ago
2008
Springer
tract State Machines to Concurrent Transaction Logic Dumitru Roman1 , Michael Kifer2 , and Dieter Fensel1 1 STI Innsbruck, Austria 2 State University of New York at Stony Brook, US...
GI
2007
Springer
14 years 2 months ago
2007
Springer
: Currently, user interfaces are defined by single applications but workflows may span multiple ones. In the result, users have to work with separated programs in parallel and de...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
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...