5084 search results - page 895 / 1017 » Proving Possibility Properties |
142
click to vote
ESORICS
2008
Springer
15 years 6 months ago
2008
Springer
We are interested in this problem: a verifier, with a small and reliable storage, wants to periodically check whether a remote server is keeping a large file x. A dishonest server,...
130
click to vote
FOSSACS
2008
Springer
15 years 5 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
126
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
128
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
128
click to vote
BCSHCI
2007
15 years 5 months ago
2007
The use of formal models for user interface design can provide a number of benefits. It can help to ensure consistency across designs for multiple platforms, prove properties such...