IEEE Transactions on Computers · 2006 · 53 citations · 50 references
ComputingComputer EngineeringComputer ScienceAlgorithmsFormal MethodsHardware Description LanguagesControl-flow AnalysisData-flow AnalysisDataflow ModelingDeductive VerificationDesign RepresentationLogic SynthesisCanonical RepresentationDataflow VerificationSignals
A Taylor expansion diagram (TED) is a compact, word-level, canonical representation for data flow computations that can be expressed as multivariate polynomials. TEDs are based on a decomposition scheme using Taylor series expansion that allows one to model word-level signals as algebraic symbols. This power of abstraction, combined with the canonicity and compactness of TED, makes it applicable to equivalence verification of dataflow designs. The paper describes the theory of TEDs and proves their canonicity. It shows how to construct a TED from an HDL design specification and discusses the application of TEDs in proving the equivalence of such designs. Experiments were performed with a variety of designs to observe the potential and limitations of TEDs for dataflow design verification. Application of TEDs to algorithmic and behavioral verification is demonstrated
50
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
Advanced engineering mathematics
Choice Reviews Online · 1998 · 4.1K citations
Natural Sciences, Computational Engineering, Mathematics +17
Matthew W. Moskewicz, Conor Madigan, Ying Zhao et al. · 2001 · 2.9K citations
Efficient implementation of a BDD package
Karl S. Brace, Richard Rudell, Randal E. Bryant · 1990 · 1.1K citations · Full text