Equational Binary Decision Diagrams

Groote, Jan Friso; Pol, Jaco van de

doi:10.1007/3-540-44404-1_11

Cited by 24 publications

(27 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The translation of the connectives is straightforward. Such a boolean formula can be converted to a BDD using standard techniques (see for instance [11] for an elegant approach).…”

Section: Configuration Consistencymentioning

confidence: 99%

Generic Feature-Based Software Composition

Storm

2007

Software Composition

View full text Add to dashboard Cite

Abstract. Bridging problem domain and solution in product line engineering is a time-consuming and error-prone process. Since both domains are structured differently (features vs. artifacts), there is no natural way to map one to the other. Using an explicit and formal mapping creates opportunities for consistency checking and automation. This way both the configuration and the composition of product instances can be more robust, support more product variants and be performed more often.

show abstract

“…The translation of the connectives is straightforward. Such a boolean formula can be converted to a BDD using standard techniques (see for instance [11] for an elegant approach).…”

Section: Configuration Consistencymentioning

confidence: 99%

Generic Feature-Based Software Composition

Storm

2007

Software Composition

View full text Add to dashboard Cite

show abstract

“…To further increase the ROBDDs compactness, and consequently enhance the efficiency of the corresponding OPS, several BDD extensions have been proposed [6]- [9]. Among them, EQuational BDDs (EQ-BDDs) [7] natively support the XNOR operation and therefore are well suited to directly synthesize XOR-rich logic circuits. Unfortunately, EQBDDs as proposed in [7] are not canonical and therefore lose some of the desirable properties of BDDs for logic synthesis.…”

Section: Introductionmentioning

confidence: 99%

“…Among them, EQuational BDDs (EQ-BDDs) [7] natively support the XNOR operation and therefore are well suited to directly synthesize XOR-rich logic circuits. Unfortunately, EQBDDs as proposed in [7] are not canonical and therefore lose some of the desirable properties of BDDs for logic synthesis.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Biconditional BDD: A Novel Canonical BDD for Logic Synthesis Targeting XOR-rich Circuits

Amarù¹,

Gaillardon²,

Micheli³

2013

Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE), 2013

View full text Add to dashboard Cite

Abstract-We present a novel class of decision diagrams, called Biconditional Binary Decision Diagrams (BBDDs), that enable efficient logic synthesis for XOR-rich circuits. BBDDs are binary decision diagrams where the Shannon's expansion is replaced by the biconditional expansion. Since the biconditional expansion is based on the XOR/XNOR operations, XOR-rich logic circuits are efficiently represented and manipulated with canonical Reduced and Ordered BBDDs (ROBBDDs). Experimental results show that ROBBDDs have 37% fewer nodes on average compared to traditional ROBDDs. To exploit this opportunity in logic synthesis for XOR-rich circuits, we developed a BBDD-based One-Pass Synthesis (OPS) methodology. The BBDD-based OPS is capable to harness the potential of novel XOR-efficient devices, such as ambipolar transistors. Experimental results show that our logic synthesis methodology reduces the number of ambipolar transistors by 49.7% on average with respect to stateof-art commercial logic synthesis tool. Considering CMOS technology, the BBBD-based OPS reduces the device count by 31.5% on average compared to commercial synthesis tool.

show abstract

“…Another approach is given in [7]. This approach is based on BDD computation, with some extra rules for dealing with transitivity.…”

Section: Introductionmentioning

confidence: 99%

A Proof System and a Decision Procedure for Equality Logic

Tveretina

Zantema

2004

LATIN 2004: Theoretical Informatics

View full text Add to dashboard Cite

Abstract. We give an approach for deciding satisfiability of equality logic formulas (E-SAT) in conjunctive normal form. Central in our approach is a single proof rule called equality resolution (ER). For this single rule we prove soundness and completeness. Based on this rule we propose a complete procedure for E-SAT and prove its correctness. Applying our procedure on a variation of the pigeon hole formula yields a polynomial complexity contrary to earlier approaches to E-SAT. Parts of the theory we developed for proving completeness of the proof rule and the algorithm are of interest in itself: we give techniques for removing clauses preserving unsatisfiability, and we give a general theorem globalizing a local commutation criterion for different proof systems.

show abstract

Equational Binary Decision Diagrams

Cited by 24 publications

References 18 publications

Generic Feature-Based Software Composition

Generic Feature-Based Software Composition

Biconditional BDD: A Novel Canonical BDD for Logic Synthesis Targeting XOR-rich Circuits

A Proof System and a Decision Procedure for Equality Logic

Contact Info

Product

Resources

About