Sciweavers

989 search results - page 6 / 198
» Pebbling and Proofs of Work
Sort
View
CADE
2002
Springer
14 years 9 months ago
Formal Verification of a Java Compiler in Isabelle
This paper reports on the formal proof of correctness of a compiler from a substantial subset of Java source language to Java bytecode in the proof environment Isabelle. This work ...
Martin Strecker
CORR
2011
Springer
143views Education» more  CORR 2011»
13 years 25 days ago
Towards Understanding and Harnessing the Potential of Clause Learning
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
Paul Beame, Henry A. Kautz, Ashish Sabharwal
FM
2003
Springer
109views Formal Methods» more  FM 2003»
14 years 2 months ago
Certifying and Synthesizing Membership Equational Proofs
As the systems we have to specify and verify become larger and more complex, there is a mounting need to combine different tools and decision procedures to accomplish large proof ...
Grigore Rosu, Steven Eker, Patrick Lincoln, Jos&ea...
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 9 months ago
From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures
Abstract We investigate here a new version of the Calculus of Inductive Constructions (CIC) on which the proof assistant Coq is based: the Calculus of Congruent Inductive Construct...
Frédéric Blanqui, Jean-Pierre Jouann...
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 9 months ago
Why neighbor-joining works
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
Radu Mihaescu, Dan Levy, Lior Pachter