6274 search results - page 550 / 1255 » Proofs, Programs, Processes |
166
click to vote
FSTTCS
2003
Springer
16 years 20 days ago
2003
Springer
Abstract. Transactions are commonly described as being ACID: Allor-nothing, Consistent, Isolated and Durable. However, although these words convey a powerful intuition, the ACID pr...
191
click to vote
ICALP
2003
Springer
16 years 20 days ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
178
click to vote
ICSE
2010
IEEE-ACM
16 years 7 days ago
2010
IEEE-ACM
Though verification tools are finding industrial use, the utility of engineering optimizations that make them scalable and usable is not widely known. Despite the fact that seve...
227
click to vote
SP
2000
IEEE
15 years 12 months ago
2000
IEEE
We address the goal of making Delegation Logic (DL) into a practically implementable and tractable trustmanagement system. DL [22] is a logic-based knowledge representation (i.e.,...
221
click to vote
CSFW
1999
IEEE
15 years 11 months ago
1999
IEEE
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...