Improved Boolean function hashing based on multiple-vertex dominators
2005 (English)In: ASP-DAC 2005: Proceedings Of The Asia And South Pacific Design Automation Conference, New York: IEEE , 2005, 573-578 p.Conference paper (Refereed)
The growing complexity of today's system designs requires fast and robust verification methods. Existing BDD, SAT or ATPG-based techniques do not provide sufficient solutions for many verification instances. Boolean function hashing is a probabilistic verification approach which can complement existing formal methods in a number of applications such as equivalence checking, biased random simulation, power analysis and power optimization. The proposed hashing technique is based on the arithmetic transform, which maps a Boolean function onto a probabilistic hash value for a given input assignment. The presented algorithm uses multiple-vertex dominators in circuit graphs to progressively simplify intermediate hashing steps. The experimental results on benchmark circuits demonstrate the robustness of our approach.
Place, publisher, year, edition, pages
New York: IEEE , 2005. 573-578 p.
Computer aided design, Systems analysis
IdentifiersURN: urn:nbn:se:kth:diva-29771DOI: 10.1109/ASPDAC.2005.1466229ISI: 000245021700114ScopusID: 2-s2.0-84861451380ISBN: 978-078038736-2ISBN: 0-7803-8736-8OAI: oai:DiVA.org:kth-29771DiVA: diva2:397571
10th Asia and South Pacific Design Automation Conference Shanghai, China, JAN 18-21, 2005
QC 201102152011-02-152011-02-152012-09-26Bibliographically approved