Verification of synchronous sequential machines based on symbolic execution

  • Olivier Coudert
  • Christian Berthet
  • Jean Christophe Madre
Hardware Verification
Part of the Lecture Notes in Computer Science book series (LNCS, volume 407)


This paper presents an original method to compare two synchronous sequential machines. The method consists in a breadth first traversal of the product machine during which symbolic expressions of its observable behaviour are computed. The method uses formal manipulations on boolean functions to avoid the state enumeration and diagram construction. For this purpose, new algorithms on boolean functions represented by Typed Decision Graphs has been defined.


  1. [1]
    F. Anceau, "Design Methodology for Large Custom Processors". Proc. of the 1986 ESSIR Conference, Delft.Google Scholar
  2. [2]
    J. R. Armstrong, Chip-Level Modeling with VHDL, Prentice Hall, 1989.Google Scholar
  3. [3]
    J. P. Billon, "Perfect Normal Forms for Discrete Functions", BULL Research Report N o 87019, June 1987.Google Scholar
  4. [4]
    J. P. Billon, J. C. Madre, "Original Concepts of PRIAM, an Industrial Tool for Efficient Formal Verification of Combinational Circuits", in The Fusion of Hardware Design and Verification, G. J. Milne Editor, North Holland, 1988.Google Scholar
  5. [5]
    O. Coudert, J. C. Madre, "Logics over Finite Domain of Interpretation: Proof and Resolution Procedures", BULL Research Report to appear, 1989.Google Scholar
  6. [6]
    S. Devadas, H. K. Ma, R. Newton, "On the Verification of Sequential Machines at Differing Levels of Abstraction", IEEE Transactions on CAD, Vol. 7, No. 6, 1988.Google Scholar
  7. [7]
    D. Dietmeyer, Logic Design of Digital Systems, Allyn & Bacon, 2nd edition, 1978.Google Scholar
  8. [8]
    J. E. Hopcroft, J. D. Ullman, Introduction to Automata Theory, Langages and Computation, Addison-Wesley, Reading, Mass., 1979.Google Scholar
  9. [9]
    S. H. Hwang, A. R. Newton, "An efficient Design Correctness Checker of Finite State Machines", ICCAD 1987.Google Scholar
  10. [10]
    D. Jaillet, P. Mertens, LDS Reference Manual, BULL S.A., May 1987.Google Scholar
  11. [11]
    J. C. Madre, J. P. Billon, "Proving Circuit Correctness using Formal Comparison Between Expected and Extracted Behaviour", Proc. of the 25th Design Automation Conference, 1988.Google Scholar
  12. [12]
    J. C. Madre, O. Coudert, "Formal Verification of Digital Circuits Using a Propositional Theorem Prover", IFIP Working Conference on the CAD Systems Using AI Techniques, June 1989.Google Scholar
  13. [13]
    J. Y. Murzin, "FAON A functional Abstractor of Netlist", Actes du Séminaire de Programmation Logique, Lannion, France, 1986.Google Scholar
  14. [14]
    K. J. Supowit, S. J. Friedman, "A new Method for Verifying Sequential Circuits", Proc. of the 23rd Design Automation Conference, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Olivier Coudert
    • 1
  • Christian Berthet
    • 1
  • Jean Christophe Madre
    • 1
  1. 1.BULL Research CenterLouveciennesFrance

Personalised recommendations