61 search results - page 6 / 13 » Source-Level Proof Reconstruction for Interactive Theorem Pr... |
118
click to vote
CADE
2005
Springer
16 years 20 days ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
94
Voted
ICFP
2008
ACM
16 years 9 days ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
99
Voted
STOC
1995
ACM
15 years 3 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
107
click to vote
CADE
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
146
click to vote
ESOP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...