13383 search results - page 106 / 2677 » Abstractions from proofs |
238
click to vote
CC
2009
Springer
16 years 5 months ago
2009
Springer
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...
162
click to vote
ESOP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
123
click to vote
ASIACRYPT
2000
Springer
15 years 9 months ago
2000
Springer
We give the first proof of security for the full Unix password hashing algorithm (rather than of a simplified variant). Our results show that it is very good at extracting almost...
122
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...
148
click to vote
DM
2008
15 years 5 months ago
2008
We first give a bijective proof of Gould's identity in the model of binary words. Then we deduce Rothe's identity from Gould's identity again by a bijection, which a...