Formal hardware verification with BDDs: an introduction
Alan J. Hu
Abstract
Alan J. Hu
Abstract
This paper is a brief introduction to the main paradigms for using BDDs (binary decision diagrams) in formal hardware verification. The paper addresses two audiences: for people doing theoretical BDD research, the paper gives a glimpse of the problems in the main application area; and for people building hardware, the paper gives a peek under the hood of the formal verification technologies that are rapidly gaining industrial importance. Topics described include combinational equivalence checking, symbolic simulation, sequential equivalence checking, model checking and symbolic trajectory evaluation.
OpenAlex reports 51 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper is a brief introduction to the main paradigms for using BDDs (binary decision diagrams) in formal hardware verification. The paper addresses two audiences: for people doing theoretical BDD research, the paper gives a glimpse of the problems in the main application area; and for people building hardware, the paper gives a peek under the hood of the formal verification technologies that are rapidly gaining industrial importance. Topics described include combinational equivalence checking, symbolic simulation, sequential equivalence checking, model checking and symbolic trajectory evaluation.
Key concepts: Formal equivalence checking, Binary decision diagram, Formal verification, Symbolic trajectory evaluation, Model checking, Computer science, Equivalence (formal languages), Symbolic execution