DeepAI AI Chat
Log In Sign Up

Complete Test Sets And Their Approximations

by   Eugene Goldberg, et al.

We use testing to check if a combinational circuit N always evaluates to 0 (written as N ≡ 0). We call a set of tests proving N ≡ 0 a complete test set (CTS). The conventional point of view is that to prove N ≡ 0 one has to generate a trivial CTS. It consists of all 2^|X| input assignments where X is the set of input variables of N. We use the notion of a Stable Set of Assignments (SSA) to show that one can build a non-trivial CTS consisting of less than 2^|X| tests. Given an unsatisfiable CNF formula H(W), an SSA of H is a set of assignments to W that proves unsatisfiability of H. A trivial SSA is the set of all 2^|W| assignments to W. Importantly, real-life formulas can have non-trivial SSAs that are much smaller than 2^|W|. In general, construction of even non-trivial CTSs is inefficient. We describe a much more efficient approach where tests are extracted from an SSA built for a `projection' of N on a subset of variables of N. These tests can be viewed as an approximation of a CTS for N. We give experimental results and describe potential applications of this approach.


page 1

page 2

page 3

page 4


Generation of complete test sets

We use testing to check if a combinational circuit N always evaluates to...

Self-Learned Formula Synthesis in Set Theory

A reinforcement learning algorithm accomplishes the task of synthesizing...

Improved Error Bounds Based on Worst Likely Assignments

Error bounds based on worst likely assignments use permutation tests to ...

A Short Note on Undirected Fitch Graphs

The symmetric version of Fitch's xenology relation coincides with class ...

Triples of Orthogonal Latin and Youden Rectangles For Small Orders

We have performed a complete enumeration of non-isotopic triples of mutu...

Positive 1-in-3-SAT admits a non-trivial kernel

This paper illustrates the power of Gaussian Elimination by adapting it ...

Constructing Hard Examples for Graph Isomorphism

We describe a method for generating graphs that provide difficult exampl...