Constraint synthesis for environment modeling in functional verification

Modeling design environment with constraints instead of a traditional testbench is advantageous in a hybrid verification framework that encompasses simulation and formal verification. This movement is gaining popularity n industry and sparks research in the constraint-based environment modeling and stimulus generation problem. We present an approach, called constraint synthesis, to this problem. Constraint synthesis falls in the general category of parametric Boolean equation solving but is novel in utilizing don't care information unique to hardware constraints and heuristic variable removal to simplify the solution. Experimental results have demonstrated the effectiveness of the proposed approach.

[1]  Wolfram Büttner,et al.  Embedding Boolean Expressions into Logic Programming , 1987, J. Symb. Comput..

[2]  R. C. Pixley,et al.  INTEGRATING MODEL CHECKING INTO THE SEMICONDUCTOR DESIGN FLOW , 1999 .

[3]  Masahiro Fujita,et al.  Application of Boolean unification to combinational logic synthesis , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[4]  Tobias Nipkow,et al.  Boolean Unification - The Story So Far , 1989, J. Symb. Comput..

[5]  Thomas R. Shiple,et al.  Building Circuits from Relations , 2000, CAV.

[6]  Carl Pixley,et al.  Design Constraints in Symbolic Model Checking , 1998, CAV.