Abstract
Hardware description languages (HDLs) dramatically change the way circuit designers work. These languages can be used to describe circuits at a very high level of abstraction, which allows the designers to specify the behavior of a circuit before realizing it. The validation of these specifications is currently done by executing them, which is very costly [2]. This cost motivates the research [3, 5, 7, 10] done on the automatic verification of temporal properties of finite state machines.
Keywords
- Characteristic Function
- Boolean Function
- Sequential Circuit
- Computation Tree Logic
- Hardware Description Language
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. P. Billion, “Perfect Normal Forms for Discrete Functions”, BULL Research Report N 87019, March 1987
J. P. Billion, 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.
S. Bose, A. Fisher, “Automatic Verification of Synchronous Circuits Using Symbolic Logic Simulation and Temporal Logic”, in Proc. of the IFIP international workshop, Applied Formal Methods for Correct VLSI Design, leuven, November 1989.
R. E. Bryant, “Graph-based Algorithms for Boolean Functions Manipulation”, IEEE Transactions on Computer, Vol C35,1986.
S. Burch, E. M. Clarke, K. L. McMillian, “Symbolic Model Checking: 1020 states and Beyond”, in Proc. of LICS, 1990.
H. Cho, G. Hachtel, S. W. Jeong, B. Plessier, E. Schwartz, F. Somenzi, “ATPG Aspect of FSM Verification”, in Proc. of ICCAD, Santa-Clara, USA., June 1990
E. M. Clarke, O. Grumbreg, “Research on Automatic Verification of Finite-State Concurrent Systems”, Annual Revue Computing Science, vol. 2, pp 269–290, 1987.
O. Coudert, C. Berthet, J. C. Madre, “Verification of Synchronous Sequential Machines Based on Symbolic Execution”, in Proc. of the Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, France, June 1989.
O. Coudert, C. Berthet, J. C. Madre, “Verification of Sequential Machines using Boolean Functional Vectors”, in Proc. of the IFIP Internatational Workshop, Applied Formal Methods for correct VLSI Design, Leuven, November 1989.
O. Coudert. J. C. Madre, C. Berthet, “Verifying Temporal Properties of Sequential Machines without Building their State Diagrams”, in Proc. of the Workshop on Computer Aided Verification, Rutgers, U.S.A., June 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Coudert, O., Madre, J.C. (2003). A Unified Framework for the Formal Verification of Sequential Circuits. In: Kuehlmann, A. (eds) The Best of ICCAD. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0292-0_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0292-0_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5007-1
Online ISBN: 978-1-4615-0292-0
eBook Packages: Springer Book Archive