Limits of using signatures for permutation independent Boolean comparison

Formal Methods in System Design

Volumn 21, Issue 2, 2002, Pages 167-191

  Mohnke, Janett ^a   Molitor, Paul ^b   Malik, Sharad ^c  

^a DResearch Digital Media Systems GmbH   (Germany)

^b MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^c Princeton University   (United States)

Author keywords

High level design tools; Permutation independent Boolean comparison; Reduced ordered binary decision diagram; Synthesis and verification

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMBINATORIAL CIRCUITS; DATA STRUCTURES; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; HEURISTIC PROGRAMMING; LOGIC DESIGN; LOGIC GATES; RESPONSE TIME (COMPUTER SYSTEMS); SET THEORY;

AUTOMATIC LOGIC VERIFICATION; HIGH LEVEL DESIGN TOOLS; LOGIC SYNTHESIS; PERMUTATION INDEPENDENT BOOLEAN COMPARISON; REDUCED ORDERED BINARY DECISION DIAGRAM; SIGNATURES;

BOOLEAN FUNCTIONS;

EID: 0036722869     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1016091418702     Document Type: Article

References (15)

1. Efficient implementation of a BDD package
2. Graph-based algorithms for Boolean function manipulation
3. Efficient Boolean function matching
4. Verifying equivalence of functions with unknown input correspondence
5. Spectral transforms for large Boolean functions with applications to technology mapping
6. Boolean matching using binary decision diagrams with applications to logic synthesis and verification
7. A signature-based approach to formal logic verification
8. Permutation and phase independent Boolean comparison
9. Detection of symmetry of Boolean functions represented by ROBDDs
10. On diagnosis and correction of design errors
11. On determining symmetries in inputs of logic circuits
12. Efficient Boolean matching based on unique variable ordering
13. Restructering binary decision diagrams based on functional equivalence