1101 search results - page 49 / 221 » Forcing in proof theory |
TCC
2009
Springer
14 years 10 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
DAC
2007
ACM
14 years 11 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
POPL
2007
ACM
14 years 10 months ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
CADE
2003
Springer
14 years 10 months ago
2003
Springer
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
TASE
2009
IEEE
14 years 4 months ago
2009
IEEE
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...