Constraint-Based Automatic Test Data Generation
IEEE Transactions on Software Engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Solving the generalized mask constraint for test generation of binary floating point add operation
Theoretical Computer Science - Real numbers and computers
Constraint Slving for Test Case Generation
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
The Minimum Equivalent DNF Problem and Shortest Implicants
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Recognition of interval Boolean functions
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
For any two n-bit numbers a ≤ b define the Boolean function f[a,b] : {0, 1}n → {0, 1} to be the function for which f[a,b] (x) = 1 if and only if x is the binary representation of a number in the interval [a, b]. We consider the disjunctive normal form representation of such functions, and show how to compute such a representation with a minimum number of disjuncts in linear time. We also show how to compute a minimum "disjoint" representation; i.e., a representation in which the domains of the disjuncts are mutually disjoint. The minimum disjunctive normal form can be applied to devise efficient constraint satisfaction systems for automatic generation of test patterns.