Abstract
In this chapter we discuss the incremental algorithms that explore the structural similarity between two circuits to speed up the verification process. Three types of algorithms, namely substitution-based, learning-based, and transformation-based algorithms, are described and compared.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Huang, SY., Cheng, KT. (1998). Incremental Verification for Combinational Circuits. In: Formal Equivalence Checking and Design Debugging. Frontiers in Electronic Testing, vol 12. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5693-0_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5693-0_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7606-4
Online ISBN: 978-1-4615-5693-0
eBook Packages: Springer Book Archive