Sciweavers

1302 search results - page 64 / 261
» Fair Equivalence Relations
Sort
View
CSFW
2009
IEEE
14 years 3 months ago
Minimal Message Complexity of Asynchronous Multi-party Contract Signing
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
Sjouke Mauw, Sasa Radomirovic, Mohammad Torabi Das...
USENIX
1990
13 years 10 months ago
The COPS Security Checker System
In the past several years, there have been a large number of published works that have graphically described a wide variety of security problems particular to Unix. Without fail, ...
Daniel Farmer, Eugene H. Spafford
FTNET
2007
107views more  FTNET 2007»
13 years 9 months ago
Network Optimization and Control
We study how protocol design for various functionalities within a communication network architecture can be viewed as a distributed resource allocation problem. This involves unde...
Srinivas Shakkottai, R. Srikant
DBPL
1995
Springer
106views Database» more  DBPL 1995»
14 years 18 days ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
POPL
2010
ACM
14 years 6 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...