Transforming Boolean relations by symbolic encoding

  • Gianpiero Cabodi
  • Stefano Quer
  • Paolo Camurati
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 987)


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.


  1. 1.
    K.S. Brace, R.L. Rudell, R. Bryant: Efficient Implementation of a BDD Package. Proc. IEEE/ACM DAC'90, June 1990, pp. 40–45Google Scholar
  2. 2.
    R.E. Bryant: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, Vol. C-35, No. 8, August 1986, pp. 667–691Google Scholar
  3. 3.
    G. Cabodi, P. Camurati, S. Quer: Symbolic Exploration of Large Circuits with Enhanced Forward/Backward Traversals. Proc. IEEE EURO-DAC'94, Grenoble (France), September 1994, pp. 22–27 best paper award Google Scholar
  4. 4.
    G. Cabodi, P. Camurati, S. Quer: Computing subsets of equivalence classes for large FSMs. Proc. IEEE EURO-DAC'95, September 1995Google Scholar
  5. 5.
    O. Coudert, J.C. Madre, C. Berthet: Verifying temporal properties of sequential machines without building their state diagrams. AMS/DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 3, 1991, pp. 75–84Google Scholar
  6. 6.
    G. De Micheli: Synthesis and optimization of digital circuits. McGraw-Hill, 1994Google Scholar
  7. 7.
    G.D. Hachtel, M. Hermida, A. Pardo, M. Poncino, F. Somenzi: Re-Encoding Sequential Circuits to Reduce Power Dissipation. Proc. IEEE ICCAD'94, November 1994, pp. 70–73Google Scholar
  8. 8.
    B. Lin, H.J. Touati, A. Richard Newton: Don't Care Minimization of Multi-Level Sequential Logic Networks. Proc. IEEE ICCAD'90, November 1990, pp. 414–417Google Scholar
  9. 9.
    C. Pixley: A computational theory and implementation of sequential hardware equivalence. AMS/DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 3, 1991, pp. 293–320Google Scholar
  10. 10.
    S. Quer, G. Cabodi, P. Camurati, L. Lavagno, E.M. Sentovich, R.K. Brayton: Incremental FSM Re-encoding for Simplifying Verification by Symbolic Traversal. IEEE International Workshop on Logic Synthesis, May 1995Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Gianpiero Cabodi
    • 1
  • Stefano Quer
    • 1
  • Paolo Camurati
    • 2
  1. 1.Dipartimento di Automatica e InformaticaPolitecnico di TorinoTurinItaly
  2. 2.Dipartimento di Matematica e InformaticaUniversità di UdineUdineItaly

Personalised recommendations