Abstract
This thesis introduces the Bonsai technique which can efficiently improve the identification of large nonsolution spaces in the search space. The technique can make exponential improvements in the reduction of the search space using a linear method to identify distracting variables that do not contribute to the overall search. The Bonsai technique can be used in any problem that tries to find a solution in a large space of possible solutions. These problems include, but are not limited to, deterministic test generation (combinational and sequential), timing analysis in combinational circuits involving any false path considerations, design verification in any cases where constants replace some of the variables, and synthesis in the areas of logic minimization. The thesis will mainly focus on the combinational test pattern generation problem and will present results in this area using the proposed technique.
Nguyen, Phuong-Anh Nguyet (1995). Bonsai: a philosophy for efficient exhaustion of large sparse spaces. Master's thesis, Texas A&M University. Available electronically from
https : / /hdl .handle .net /1969 .1 /ETD -TAMU -1995 -THESIS -N58.