1410 search results - page 65 / 282 » Proving theorems by reuse |
LPAR
2010
Springer
13 years 8 months ago
2010
Springer
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
ENTCS
2010
13 years 7 months ago
2010
A previously introduced combination of the bialgebraic approach to structural operational semantics with aic modal logic is re-examined and improved in some aspects. Firstly, a mo...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...
RANDOM
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
ACL2
2006
ACM
14 years 1 months ago
2006
ACM
We have extended the ACL2 theorem prover to automatically prove properties of VHDL circuits with IBM's Internal SixthSense verification system. We have used this extension to...