290 search results - page 31 / 58 » Theorem Proving Using Lazy Proof Explication |
147
click to vote
CAV
1998
Springer
15 years 4 months ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...
SIAMMA
2010
14 years 6 months ago
2010
This work deals with trace theorems for a class of ramified bidimensional domains with a self-similar fractal boundary . The fractal boundary is supplied with a probability measur...
123
click to vote
HASKELL
2005
ACM
15 years 5 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
ENTCS
2006
14 years 11 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...