Sciweavers

305 search results - page 4 / 61
» From Sets to Bits in Coq
Sort
View
ICMCS
2010
IEEE
165views Multimedia» more  ICMCS 2010»
13 years 8 months ago
On deriving longer fingerprints from features based on projections
We propose three methods to derive longer fingerprints from features using projection based hashing methods. For this class of hashing methods, a feature matrix is projected onto ...
Regunathan Radhakrishnan, Claus Bauer, Wenyu Jiang
ITP
2010
159views Mathematics» more  ITP 2010»
13 years 11 months ago
Programming Language Techniques for Cryptographic Proofs
CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the code-based paradigm, in which the statement ...
Gilles Barthe, Benjamin Grégoire, Santiago ...
TCS
2008
13 years 7 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
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...
Jean-François Dufourd
ITP
2010
172views Mathematics» more  ITP 2010»
13 years 5 months ago
Automated Machine-Checked Hybrid System Safety Proofs
mentation of the Abstraction Method In Coq Eelis van der Weegen Institute for Computing and Information Sciences Raboud University Nijmegen This technical report documents our deve...
Herman Geuvers, Adam Koprowski, Dan Synek, Eelis v...
ICFP
2012
ACM
11 years 9 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens