Sciweavers

4099 search results - page 48 / 820
» A Framework for Interactive Proof
Sort
View
POPL
2010
ACM
15 years 7 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
ENTCS
2008
106views more  ENTCS 2008»
14 years 9 months ago
Verifying Test-Hypotheses: An Experiment in Test and Proof
HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. The HOL-TestGen method is two-staged: first, the origina...
Achim D. Brucker, Lukas Brügger, Burkhart Wol...
CTRSA
2005
Springer
72views Cryptology» more  CTRSA 2005»
15 years 3 months ago
Proofs for Two-Server Password Authentication
Traditional password-based authentication and key-exchange protocols suffer from the simple fact that a single server stores the sensitive user password. In practice, when such a ...
Michael Szydlo, Burton S. Kaliski Jr.
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
CSR
2009
Springer
15 years 29 days ago
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
Olaf Beyersdorff, Zenon Sadowski