Abstract
An approach for interpreted sequential verification at different levels of abstraction by symbolic simulation is proposed. The equivalence checker has been used in previous work to compare two designs at rt-level.We describe in this paper the automatic verification of gate-level results of a commercial synthesis tool against a behavioral specification at rt-level. The symbolic simulator has to cope with different numbers of control steps since the descriptions are not cycle equivalent. The state explosion problem of previous approaches relying on state traversal is avoided. The simulator uses a library of different equivalence detection techniques which are surveyed with main emphasis on the new techniques required at gate-level. Cooperation of those techniques and good debugging support are possible by notifying detected relationships at equivalence classes rather than to manipulate symbolic terms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. D. Aagaard, R. B. Jones, and C-J. H. Seger. Combining theorem proving and trajectory evaluation in an industrial environment. In DAC’98, 1998.
M. D. Aagaard, R. B. Jones, and C-J. H. Seger. Formal verification using parametric representations of boolean constraints. In DAC’99, 1999.
P. Ashar, A. Gupta, and S. Malik. Using complete-1-distinguishability for FSM equivalence checking. In ICCAD’96, 1996.
C. W. Barrett, D. L. Dill, and J. R. Levitt. Validity checking for combinations of theories with equality. In FMCAD’96, volume 1166 of LNCS. Springer Verlag, 1996.
C. W. Barrett, D. L. Dill, and J. R. Levitt. A decision procedure for bit-vector arithmetic. In DAC’98, 1998.
V. Bertacco, M. Damiani, and S. Quer. Cycle-based symbolic simulation of gatelevel synchronous circuits. In DAC’99, 1999.
R. E. Bryant. Symbolic verification of MOS circuits. In 1985 Chapel Hill Conference on VLSI, pages 419–438. Computer Science Press, 1985.
R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. on Computers, C-35(8):677–691, 1986.
J. R. Burch, E. M. Clarke, K. L. McMillan, and D. L. Dill. Sequential circuit verification using symbolic model checking. In DAC’90, 1990.
M. K. Ganai, A. Aziz, and A. Kuehlmann. Enhancing simulation with BDDs and ATPG. In DAC’99, 1999.
S. Hazelhurst and C.-J. H. Seger. Symbolic trajectory evaluation. In Formal Hardware Verification, volume 1287 of LNCS. Springer Verlag, 1997.
J. L. Hennessy and D. A. Patterson. Computer architecture: a quantitative approach. Morgan Kaufman, CA, second edition, 1996.
H. Hinrichsen, H. Eveking, and G. Ritter. Formal synthesis for pipeline design. In DMTCS+CATS’99, Auckland, 1999.
S. Höreth. Implementation of a multiple-domain decision diagram package. In CHARME’97, 1997.
S. Höreth. Hybrid graph manipulation package demo, Darmstadt, 1998. http://www.rs.e-technik.tu-darmstadt.de/~sth/demo.html.
C. N. Ip and D. L. Dill. State reduction using reversible rules. In DAC’96, 1996.
R. B. Jones, D. L. Dill, and J. R. Burch. Efficient validity checking for processor verification. In ICCAD’95, 1995.
C. Kern and M. R. Greenstreet. Formal hardware verification in hardware design: A survey. ACM Trans. on Design Automation of Electronic Systems, 4(2), 1999.
J. O'Leary, X. Zhao, R. Gerth, and C.-J. H. Seger. Formally verifying IEEE compilance of floating-point hardware. Intel Technology Journal, Q1, 1999.
M. Pandey and R. E. Bryant. Exploiting symmetry when verifying transistorlevel circuits by symbolic trajectory evaluation. IEEE Trans. on Computer-Aided Design, 18(7):918–935, 1999.
G. Ritter, H. Eveking, and H. Hinrichsen. Formal verification of designs with complex control by symbolic simulation. In CHARME’99, volume 1703 of LNCS. Springer Verlag, 1999.
G. Ritter, H. Hinrichsen, and H. Eveking. Formal verification of descriptions with distinct order of memory operations. In ASIAN’99, volume 1742 of LNCS. Springer Verlag, 1999.
C.-J. H. Seger and R. E. Bryant. Formal verification by symbolic evaluation of partially-ordered trajectories. Formal Methods in System Design, 6(2):147–190, 1995.
T. Uehara. Proofs and synthesis are cooperative approaches for correct circuit designs. In From HDL Descriptions to Guaranteed Correct Circuit Designs. North-Holland, 1987.
L.-C. Wang, M. S. Abadir, and N. Krishnamurthy. Automatic generation of assertions for formal verification of PowerPCTM microprocessor arrays using symbolic trajectory evaluation. In DAC’98, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ritter, G. (2000). Sequential Equivalence Checking by Symbolic Simulation. In: Hunt, W.A., Johnson, S.D. (eds) Formal Methods in Computer-Aided Design. FMCAD 2000. Lecture Notes in Computer Science, vol 1954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40922-X_26
Download citation
DOI: https://doi.org/10.1007/3-540-40922-X_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41219-9
Online ISBN: 978-3-540-40922-9
eBook Packages: Springer Book Archive