798 search results - page 54 / 160 » Proving More Properties with Bounded Model Checking |
126
Voted
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
124
Voted
WDAG
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
159
Voted
CRYPTO
2007
Springer
15 years 8 months 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 ...
132
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
We consider FIFO buffer management for switches providing differentiated services. In each time step, an arbitrary number of packets arrive, and only one packet can be sent. The bu...
129
click to vote
CHARME
2003
Springer
15 years 9 months ago
2003
Springer
Intrusion-tolerance is the technique of using fault-tolerance to achieve security properties. Assuming that faults, both benign and Byzantine, are unavoidable, the main goal of Int...