Sciweavers

10715 search results - page 84 / 2143
» Proofs from Tests
Sort
View
116
Voted
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
15 years 2 months ago
Deterministic identity testing for multivariate polynomials
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
Richard J. Lipton, Nisheeth K. Vishnoi
209
Voted
POPL
2006
ACM
16 years 1 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy
103
Voted
CSL
2007
Springer
15 years 7 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
94
Voted
CCS
2005
ACM
15 years 6 months ago
A modular correctness proof of IEEE 802.11i and TLS
The IEEE 802.11i wireless networking protocol provides mutual authentication between a network access point and user devices prior to user connectivity. The protocol consists of s...
Changhua He, Mukund Sundararajan, Anupam Datta, An...
ITP
2010
159views Mathematics» more  ITP 2010»
15 years 4 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 ...