Sciweavers

77 search results - page 1 / 16
» Testing Basic Boolean Formulae
Sort
View
SIAMDM
2002
42views more  SIAMDM 2002»
13 years 4 months ago
Testing Basic Boolean Formulae
Michal Parnas, Dana Ron, Alex Samorodnitsky
APPROX
2007
Springer
153views Algorithms» more  APPROX 2007»
13 years 11 months ago
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
Dana Glasner, Rocco A. Servedio
RANDOM
2001
Springer
13 years 9 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky
ICCAD
2002
IEEE
142views Hardware» more  ICCAD 2002»
14 years 1 months ago
SAT and ATPG: Boolean engines for formal hardware verification
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
Armin Biere, Wolfgang Kunz
SAS
2010
Springer
159views Formal Methods» more  SAS 2010»
13 years 3 months ago
Automatic Abstraction for Intervals Using Boolean Formulae
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
Jörg Brauer, Andy King