351 search results - page 37 / 71 » On the Learnability of Boolean Formulae |
VLSID
2002
IEEE
14 years 8 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
ESOP
2001
Springer
14 years 6 days ago
2001
Springer
Abstract. We propose a new representation for the domain of Definite Boolean functions. The key idea is to view the set of models of a Boolean function as an incidence relation be...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
d Abstract] Dana Angluin James Aspnes Jiang Chen Yinghua Wu We propose a new model for exact learning of acyclic circuits using experiments in which chosen values may be assigned ...
CAV
2004
Springer
13 years 11 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization ...