503 search results - page 64 / 101 » Verifying Quantitative Properties Using Bound Functions |
STOC
2007
ACM
15 years 10 months ago
2007
ACM
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
AUTOMATICA
1999
14 years 9 months ago
1999
This paper deals with the optimization of the observer trajectory for target motion analysis. The observations are made of estimated bearings. The problem consists in determining ...
ENTCS
2008
14 years 9 months ago
2008
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
TOPLAS
2008
14 years 9 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
FORMATS
2004
Springer
15 years 1 months ago
2004
Springer
Davies and Wakerly show that Byzantine fault tolerance can be achieved by a cascade of broadcasts and middle value select functions. We present an extension of the Davies and Waker...