1411 search results - page 51 / 283 » Interactive Coding for Interactive Proofs |
89
Voted
CSL
2008
Springer
15 years 2 months ago
2008
Springer
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
102
click to vote
ENTCS
2007
15 years 12 days ago
2007
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
90
Voted
JIIS
2008
15 years 13 days ago
2008
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
114
Voted
TCS
2008
15 years 10 days ago
2008
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
106
click to vote
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constru...