Efficient combinational verification using overlapping local BDDs and a hash table

DOI10.1023/A:1016096020556MaRDI QIDQ698440zbMATH OpenFDO

Authors Rajarshi Mukherjee, Jawahar Jain, Koichiro Takayama, Jacob A. Abraham, Donald S. Fussell

Publication date 18 September 2002

Published in Formal Methods in System Design (Search for Journal in Brave)

zbMATH Keywords

formal verificationBDD'sinternal correspondence-based verification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Application of BDDs in Boolean matching techniques for formal logic combinational verification
• Formal Methods in Computer-Aided Design
• A BDD-based verification method for large synthesized circuits
• scientific article; zbMATH DE number 1796129
• Formal Methods for Hardware Verification

Cited in

(4)

• scientific article; zbMATH DE number 1796129 (Why is no real title available?)
• Application of BDDs in Boolean matching techniques for formal logic combinational verification
• Formal Methods in Computer-Aided Design
• scientific article; zbMATH DE number 1979543 (Why is no real title available?)

Describes a project that uses

Uses Software

• HANNIBAL

This page was built for publication: Efficient combinational verification using overlapping local BDDs and a hash table

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698440)