Unifying Two Formula Rewriting Techniques for Circuit Verification and Risk Assessment

Download:
pdf | ps

by Macha Nikolskaa, Macha Nikolskaa, Poul Frederick Williams, Poul Frederick Williams, David James Sherman, David James Sherman

http://dept-info.labri.u-bordeaux.fr/~macha/publications/NikWilShe-CHARME.ps.gz

Add To MetaCart

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@MISC{Nikolskaa_unifyingtwo,
    author = {Macha Nikolskaa and Macha Nikolskaa and Poul Frederick Williams and Poul Frederick Williams and David James Sherman and David James Sherman},
    title = {Unifying Two Formula Rewriting Techniques for Circuit Verification and Risk Assessment},
    year = {}
}

Abstract:

Abstract: We study two dissimilar techniques, one online and one offline, for improving boolean formula assessment in two formal verification domains, circuit verification and risk assessment. We establish, despite their differences, that the key advantages of these two techniques come from formula rewriting, regardless of whether it is online or offline. We formalize a unified framework for describing these two techniques, and shown how this provides a better understanding of the interaction between different improvements to boolean formulas. Experimental support for these claims is also shown. Topic Area: correctness preserving transformations; BDD- and FSMbased approaches

Citations

2317	Graph-Based Algorithms for Boolean Function Manipulation – Bryant - 1986
291	Sangiovanni-Vincentelli „Logic Minimization Algorithms for VLSI Synthesis – Brayton, Hachtel, et al. - 1997
97	Verification of arithmetic circuits with binary moment diagrams – BRYANT, CHEN - 1995
85	Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification – Bryant - 1995
40	Boolean expression diagrams – Andersen, Hulgaard - 1997
40	On a Method for Obtaining Lower Bounds for the Complexity of Individual Monotone Functions – Andreev - 1985
27	A partial evaluator, and its use as a programming tool – Beckman, Haraldsson, et al. - 1976
17	On the number of prime implicants – Chandra, Markowsky - 1978
13	On the implementation of a package for efficient representation and manipulation of functional decision diagrams – Becker, Drechsler, et al. - 1993
13	An ordering heuristics for building binary decision diagrams from fault-trees – Bouissou - 1996
5	Computation of prime implicants of a fault tree within Aralia – Aralia - 1995

View or Download | Add to My Collection | Correct Errors