Sciweavers

10715 search results - page 35 / 2143
» From Tests to Proofs
Sort
View
28
Voted
DDECS
2009
IEEE
128views Hardware» more  DDECS 2009»
14 years 2 months ago
A fast untestability proof for SAT-based ATPG
—Automatic Test Pattern Generation (ATPG) based on Boolean satisfiability (SAT) has been shown to be a beneficial complement to traditional ATPG techniques. Boolean solvers wor...
Daniel Tille, Rolf Drechsler
TLCA
2009
Springer
14 years 2 months ago
Relating Classical Realizability and Negative Translation for Existential Witness Extraction
Friedman showed how to turn a classical proof of a Σ0 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classi...
Alexandre Miquel
CC
2010
Springer
112views System Software» more  CC 2010»
13 years 2 months ago
Random Cnf's are Hard for the Polynomial Calculus
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
Eli Ben-Sasson, Russell Impagliazzo
AI
2007
Springer
13 years 8 months ago
The Carneades model of argument and burden of proof
We present a formal, mathematical model of argument structure and evaluation, taking seriously the procedural and dialogical aspects of argumentation. The model applies proof stan...
Thomas F. Gordon, Henry Prakken, Douglas Walton
ACL2
2006
ACM
14 years 1 months ago
Reasoning about ACL2 file input
We introduce the logical story behind file input in ACL2 and discuss the types of theorems that can be proven about filereading operations. We develop a low level library for re...
Jared Davis