709 search results - page 3 / 142 » An Equational Theory for Transactions |
APAL
2002
13 years 5 months ago
2002
We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class (that is, the variety) genera...
FOSSACS
2006
Springer
13 years 9 months ago
2006
Springer
We prove that the equational theory of the process algebra BCCSP modulo completed simulation equivalence does not have a finite basis. Furthermore, we prove that with a finite alph...
MASCOTS
2010
13 years 7 months ago
2010
In this paper, we develop a queuing theory based analytical model to evaluate the performance of transactional memory. Based on the statistical characteristics observed on actual e...
ICDT
1997
ACM
13 years 10 months ago
1997
ACM
Abstract. The correctness of nested transactions for multidatabases differs from that of at transactions in that, for nested transactions the execution order of siblings at each re...
TGC
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. We study the link between formal and cryptographic models for security protocols in the presence of passive and adaptive adversaries. We first describe the seminal resul...