290 search results - page 44 / 58 » Theorem Proving Using Lazy Proof Explication |
COCO
2004
Springer
15 years 3 months ago
2004
Springer
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
BIRTHDAY
2006
Springer
15 years 3 months ago
2006
Springer
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...
115
click to vote
JACM
2002
14 years 11 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
TLCA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
109
click to vote
DCC
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper presents a proof of the rate distortion function of a Poisson process with a queuing distortion measure that is in complete analogy with the proofs associated with the ...