Dynamic variable reordering for BDD minimization

Felt, Eric; York, Gary; Brayton, Robert K.; Sangiovanni‐Vincentelli, Alberto

doi:10.1109/eurdac.1993.410627

Cited by 31 publications

(12 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Both finding the best order and deciding whether an order is optimal are NP-hard [4]. A lot of BDD research (e.g., [18], [8], [17]) has been dedicated to heuristics for finding a good variable order. In this section, we show how to adapt the sifting heuristic of Rudell [18], as implemented in CUDD, to LDDs.…”

Section: Dynamic Variable Orderingmentioning

confidence: 99%

See 1 more Smart Citation

Decision diagrams for linear arithmetic

Chaki

Gurfinkel

Strichman

2009

2009 Formal Methods in Computer-Aided Design

View full text Add to dashboard Cite

Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checking techniques (e.g., predicate abstraction). We present a new data structure, Linear Decision Diagrams (LDDs), to represent formulas in LA and its fragments, which has certain properties that make it efficient for such tasks. LDDs can be seen as an extension of Difference Decision Diagrams (DDDs) to full LA. Beyond this extension, we make three key contributions. First, we extend sifting-based dynamic variable ordering (DVO) from BDDs to LDDs. Second, we develop, implement, and evaluate several algorithms for existential quantification. Third, we implement LDDs inside CUDD, a state-of-the-art BDD package, and evaluate them on a large benchmark consisting of 850 functions derived from the source code of 25 open source programs. Overall, our experiments indicate that LDDs are an effective data structure for program analysis tasks.

show abstract

Section: Dynamic Variable Orderingmentioning

confidence: 99%

“…WBMVQE iterates through two phases. First, it eliminates all variables that do not need resolution (lines [4][5][6][7][8]. This is repeated until no more variables can be dropped.…”

mentioning

confidence: 99%

Decision diagrams for linear arithmetic

Chaki

Gurfinkel

Strichman

2009

2009 Formal Methods in Computer-Aided Design

View full text Add to dashboard Cite

show abstract

“…The use of dynamic techniques to reorder the variables during the computations of the BDDs may in some cases help, but the price is often paid in an enormous increase of run time [22,33]. We determine the global variable ordering 8 by performing data flow analysis and by assigning priorities to the variables of the VHDL data space (cf.…”

Section: Symbolic Representation Of Vhdl Data Typesmentioning

confidence: 99%

Translating VHDL into functional symbolic finite-state models

Döhmen

Herrmann

Pargmann

1995

Form Method Syst Des

View full text Add to dashboard Cite

Abstract. In this paper we present a method to translate VHDL into symbolic finite-state models. Our method can handle those aspects of VHDL which have a finite representation obtaining the semantics defined in the IEEE statndard. We describe an intermediate representation based on finite automata and its translation into a BDD-based reperesentation. Our model interfaces VHDL with a BDD-based functional symbolic model checker.

show abstract

“…It is usually a good heuristic to group "dependent" variables closely together [53,47]. In general, however, the problem of finding an optimal variable ordering is NP-hard [17], and existing BDD libraries offer automatic reordering strategies based on steepest-ascent heuristics [51,10]. There are also functions (such as multiplication) for which no variable ordering can avoid exponential growth.…”

Section: Symbolic Model Checkingmentioning

confidence: 99%

Model Checking: A Tutorial Overview

Merz¹

2001

Modeling and Verification of Parallel Processes

View full text Add to dashboard Cite

Abstract.We survey principles of model checking techniques for the automatic analysis of reactive systems. The use of model checking is exemplified by an analysis of the Needham-Schroeder public key protocol. We then formally define transition systems, temporal logic, ω-automata, and their relationship. Basic model checking algorithms for linear-and branching-time temporal logics are defined, followed by an introduction to symbolic model checking and partial-order reduction techniques. The paper ends with a list of references to some more advanced topics.

show abstract

Dynamic variable reordering for BDD minimization

Cited by 31 publications

References 9 publications

Decision diagrams for linear arithmetic

Decision diagrams for linear arithmetic

Translating VHDL into functional symbolic finite-state models

Model Checking: A Tutorial Overview

Contact Info

Product

Resources

About