Efficient combinational verification using overlapping local BDDs and a hash table

DOI10.1023/A:1016096020556zbMATH Open1018.68049MaRDI QIDQ698440FDOQ698440

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)

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

zbMATH Keywords

formal verificationBDD'sinternal correspondence-based verification

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• Formal Methods in Computer-Aided Design
• Application of BDDs in Boolean matching techniques for formal logic combinational verification
• Title not available (Why is that?)

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)