Sciweavers

77 search results - page 9 / 16
» Testing Basic Boolean Formulae
Sort
View
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
14 years 4 months ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser
AAAI
2010
13 years 7 months ago
Computing Cost-Optimal Definitely Discriminating Tests
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Anika Schumann, Jinbo Huang, Martin Sachenbacher
JSAT
2006
83views more  JSAT 2006»
13 years 7 months ago
Report of the Third QBF Solvers Evaluation
This paper reports about the 2005 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the third in a series of non-competitive events established with the ai...
Massimo Narizzano, Luca Pulina, Armando Tacchella
ECCC
2011
185views ECommerce» more  ECCC 2011»
13 years 2 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
LICS
2008
IEEE
14 years 1 months ago
Nonlocal Flow of Control and Kleene Algebra with Tests
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
Dexter Kozen