488 search results - page 79 / 98 » Unbounded Transactional Memory |
RTSS
1994
IEEE
14 years 27 days ago
1994
IEEE
Various concurrency control algorithms di er in the time when con icts are detected, and in the way they are resolved. In that respect, the Pessimistic and Optimistic Concurrency ...
FTCS
1998
13 years 10 months ago
1998
Most fault-tolerant systems are designed to stop faulty programs before they write permanent data or communicate with other processes. This property (halt-on-failure) forms the co...
CRYPTO
2007
Springer
14 years 21 days ago
2007
Springer
We consider the problem of secure identification: user U proves to server S that he knows an agreed (possibly low-entropy) password w, while giving away as little information on w ...
ICDCS
2012
IEEE
11 years 11 months ago
2012
IEEE
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
FM
2005
Springer
14 years 2 months ago
2005
Springer
The Mondex Electronic Purse system [18] is an outstanding example of formal refinement techniques applied to a genuine industrial scale application, and notably, was the first ve...