Sciweavers

10715 search results - page 4 / 2143
» From Tests to Proofs
Sort
View
MICS
2008
129views more  MICS 2008»
13 years 7 months ago
ATP-based Cross-Verification of Mizar Proofs: Method, Systems, and First Experiments
Mizar is a proof assistant used for formalization and mechanical verification of mathematics. The main use of Mizar is in the development of the Mizar Mathematical Library (MML), i...
Josef Urban, Geoff Sutcliffe
CSFW
2007
IEEE
14 years 2 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
COCO
2005
Springer
124views Algorithms» more  COCO 2005»
14 years 1 months ago
Tolerant Versus Intolerant Testing for Boolean Properties
A property tester with high probability accepts inputs satisfying a given property and rejects inputs that are far from satisfying it. A tolerant property tester, as defined by P...
Eldar Fischer, Lance Fortnow
FM
2008
Springer
77views Formal Methods» more  FM 2008»
13 years 9 months ago
A Rigorous Approach to Networking: TCP, from Implementation to Protocol to Service
Abstract. Despite more then 30 years of research on protocol specification, the major protocols deployed in the Internet, such as TCP, are described only in informal prose RFCs and...
Tom Ridge, Michael Norrish, Peter Sewell
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 2 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret