2227 search results - page 188 / 446 » Reversibility and Models for Concurrency |
157
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
169
click to vote
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
We introduce a Game Semantics where strategies are partial orders, and composition is a generalization of the merging of orders. Building on this, to bridge between Game Semantics ...
151
click to vote
ISPW
2006
IEEE
16 years 19 days ago
2006
IEEE
Workflows emphasize the partial order of activities, and the flow of data between activities. In contrast, cooperative processes emphasize the sharing of artefact, and its gradual ...
171
Voted
LPAR
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
142
click to vote
ESOP
2004
Springer
16 years 10 hour ago
2004
Springer
A transaction defines a locus of computation that satisfies important concurrency and failure properties; these so-called ACID properties provide strong serialization guarantees ...