10715 search results - page 40 / 2143 » From Tests to Proofs |
TYPES
2004
Springer
14 years 1 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
ITC
2003
IEEE
14 years 1 months ago
2003
IEEE
–This paper provides proof of concept for the newly-approved 1149.6 standard by investigating the first silicon implementation of the test receiver. EXTEST and EXTEST_PULSE tests...
ICLP
2010
Springer
13 years 12 months ago
2010
Springer
The proof-theoretic approach to logic programming has benefited from the
CAV
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...