论文信息 - Transforming boolean relations by symbolic encoding

Transforming boolean relations by symbolic encoding

Transforming Boolean relations and functions is an important horizontal technique that finds several applications in logic synthesis and formal verification. This paper develops a framework for analyzing input/output transformations of Boolean relations and functions. It also contributes efficient composition techniques based on partitioning the transformation. Experimental results on equivalence-preserving FSM state-space re-encoding demonstrate the feasibility of the approach.

Gianpiero Cabodi | Stefano Quer | Paolo Camurati

[1] Robert K. Brayton,et al. Incremental FSM Re-encoding for Simplifying Verification by Symbolic Traversal , 1995 .

[2] Gianpiero Cabodi,et al. Symbolic exploration of large circuits with enhanced forward/backward traversals , 1994, EURO-DAC '94.

[3] Giovanni De Micheli,et al. Synthesis and Optimization of Digital Circuits , 1994 .

[4] Gianpiero Cabodi,et al. Computing subsets of equivalence classes for large FSMs , 1995, Proceedings of EURO-DAC. European Design Automation Conference.

[5] A. Richard Newton,et al. Don't care minimization of multi-level sequential logic networks , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[6] Olivier Coudert,et al. Verifying Temporal Properties of Sequential Machines without Building Their State Diagrams , 1990, CAV.

[7] Randal E. Bryant,et al. Efficient implementation of a BDD package , 1991, DAC '90.

[8] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[9] G. Hachtel,et al. Re-encoding sequential circuits to reduce power dissipation , 1994, ICCAD '94.