Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Finding the Optimal Variable Ordering for Binary Decision Diagrams
IEEE Transactions on Computers
Shared binary decision diagram with attributed edges for efficient Boolean function manipulation
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Functional approaches to generating orderings for efficient symbolic representations
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Reduction of OBDDs in linear time
Information Processing Letters
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Fast functional evaluation of candidate OBDD variable orderings
EURO-DAC '91 Proceedings of the conference on European design automation
On variable ordering of binary decision diagrams for the application of multi-level logic synthesis
EURO-DAC '91 Proceedings of the conference on European design automation
A Unifying Theoretical Background for Some Bdd-based Data Structures
Formal Methods in System Design
Fast exact minimization of BDDs
DAC '98 Proceedings of the 35th annual Design Automation Conference
Adaptive variable reordering for symbolic model checking
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Sampling schemes for computing OBDD variable orderings
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Using lower bounds during dynamic BDD minimization
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Ordered Binary Decision Diagrams and Minimal Trellises
IEEE Transactions on Computers
Dynamic minimization of word-level decision diagrams
Proceedings of the conference on Design, automation and test in Europe
The multiple variable order problem for binary decision diagrams: theory and practical application
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Efficient filtering in publish-subscribe systems using binary decision diagrams
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
The nonapproximability of OBDD minimization
Information and Computation
Ordered binary decision diagrams
Logic Synthesis and Verification
Data structures for Boolean functions
Computational Discrete Mathematics
Heuristic Learning Based on Genetic Programming
Genetic Programming and Evolvable Machines
The complexity of minimizing and learning OBDDs and FBDDs
Discrete Applied Mathematics
Minimization of word-level decision diagrams
Integration, the VLSI Journal
The Complexity of Minimizing FBDDs
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Distributed Hybrid Genetic Programming for Learning Boolean Functions
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Approximations by OBDDs and the Variable Ordering Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Too Much Knowledge Hurts: Acceleration of Genetic Programs for Learning Heuristics
Proceedings of the International Conference, 7th Fuzzy Days on Computational Intelligence, Theory and Applications
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Practical Point-in-Polygon Tests Using CSG Representations of Polygons
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Heuristic Learning Based on Genetic Programming
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Sample Method for Minimization of OBDDs
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Symbolic Methods for the State Space Exploration of GSPN Models
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Towards Automated Proof of Fail-Safe Behaviour
SAFECOMP '98 Proceedings of the 17th International Conference on Computer Safety, Reliability and Security
Efficient Dynamic Minimization of Word-Level DDs Based on Lower Bound Computation
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
Algorithms and heuristics in VLSI design
Experimental algorithmics
From type inference to configuration
The essence of computation
BDDs: design, analysis, complexity, and applications
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Theoretical Computer Science
Combining ordered best-first search with branch and bound for exact BDD minimization
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Combination of Lower Bounds in Exact BDD Minimization
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
KNOW Why your access was denied: regulating feedback for usable security
Proceedings of the 11th ACM conference on Computer and communications security
Efficient Relational Calculation for Software Analysis
IEEE Transactions on Software Engineering
Quasi-Exact BDD Minimization Using Relaxed Best-First Search
ISVLSI '05 Proceedings of the IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design
Application of Wu's method to symbolic model checking
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
On the influence of the variable ordering for algorithmic learning using OBDDs
Information and Computation
Bounds on the OBDD-size of integer multiplication via universal hashing
Journal of Computer and System Sciences
Lower bounds for dynamic BDD reordering
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Symmetry in temporal logic model checking
ACM Computing Surveys (CSUR)
Managing space for finite-state verification
Proceedings of the 28th international conference on Software engineering
Logic and stochastic modeling with SMART
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Distributed dynamic BDD reordering
Proceedings of the 43rd annual Design Automation Conference
Simulation-Based Functional Test Generation for Embedded Processors
IEEE Transactions on Computers
Secure function evaluation with ordered binary decision diagrams
Proceedings of the 13th ACM conference on Computer and communications security
IEEE Intelligent Systems
Interactive, scalable, declarative program analysis: from prototype to implementation
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
The decomposition tree for analyses of boolean functions
Mathematical Structures in Computer Science
Symbolic mining of temporal specifications
Proceedings of the 30th international conference on Software engineering
Relations as an abstraction for BDD-based program analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Hierarchical Set Decision Diagrams and Automatic Saturation
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Formal Verification of a Flash Memory Device Driver --- An Experience Report
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Efficient compilation techniques for large scale feature models
GPCE '08 Proceedings of the 7th international conference on Generative programming and component engineering
On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Model-Based Development of firewall rule sets: Diagnosing model inconsistencies
Information and Software Technology
Weighted A∗ search -- unifying view and application
Artificial Intelligence
Incremental algorithms for approximate compilation
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Learning to order BDD variables in verification
Journal of Artificial Intelligence Research
Constraint and variable ordering heuristics for compiling configuration problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Building Efficient Model Checkers using Hierarchical Set Decision Diagrams and Automatic Saturation
Fundamenta Informaticae - Petri Nets 2008
BDDs-design, analysis, complexity, and applications
Discrete Applied Mathematics
On the influence of the variable ordering for algorithmic learning using OBDDs
Information and Computation
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
A framework for quasi-exact optimization using relaxed best-first search
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
On population size and neutrality: facilitating the evolution of evolvability
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Data representation and efficient solution: a decision diagram approach
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Improving static variable orders via invariants
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
A microcanonical optimization algorithm for BDD minimization problem
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
On threshold BDDs and the optimal variable ordering problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Dynamically resizable binary decision diagrams
Proceedings of the 20th symposium on Great lakes symposium on VLSI
Automated analysis of feature models 20 years later: A literature review
Information Systems
Evolvability via modularity-induced mutational focussing
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Scalable specification mining for verification and diagnosis
Proceedings of the 47th Design Automation Conference
Interactive cost configuration over decision diagrams
Journal of Artificial Intelligence Research
Using binary decision diagrams for combinatorial test design
Proceedings of the 2011 International Symposium on Software Testing and Analysis
Symbolic computation of strongly connected components and fair cycles using saturation
Innovations in Systems and Software Engineering
Implicit permutation enumeration networks and binary decision diagrams reordering
Proceedings of the 48th Design Automation Conference
Evolving binary decision diagrams with emergent variable orderings
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
An automata approach to pattern collections
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Finding compact BDDs using genetic programming
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
Model-Based diagnosis through OBDD compilation: a complexity analysis
Reasoning, Action and Interaction in AI Theories and Systems
Experiments with multiple abstraction heuristics in symbolic verification
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Genetic algorithms for the variable ordering problem of binary decision diagrams
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Computing argumentation in polynomial number of BDD operations: a preliminary report
ArgMAS'10 Proceedings of the 7th international conference on Argumentation in Multi-Agent Systems
On application of multi-rooted binary decision diagrams to probabilistic model checking
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Local structure and determinism in probabilistic databases
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Ten years of saturation: a petri net perspective
Transactions on Petri Nets and Other Models of Concurrency V
Computing a hierarchical static order for decision diagram-based representation from p/t nets
Transactions on Petri Nets and Other Models of Concurrency V
Dynamic segregative genetic algorithm for optimizing the variable ordering of ROBDDs
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Variable ordering for the application of BDDs to the maximum independent set problem
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Building Efficient Model Checkers using Hierarchical Set Decision Diagrams and Automatic Saturation
Fundamenta Informaticae - Petri Nets 2008
On reachability and controllability of switched Boolean control networks
Automatica (Journal of IFAC)
BDD-Based Synthesis of Reversible Logic
International Journal of Applied Metaheuristic Computing
International Journal of Cognitive Informatics and Natural Intelligence
BUNDLE: a reasoner for probabilistic ontologies
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Channel and Time Slot Allocation for Dense RFID Networks
Wireless Personal Communications: An International Journal
| Hi-index | 14.99 |
Ordered binary decision diagrams are a useful representation of Boolean functions, if a good variable ordering is known. Variable orderings are computed by heuristic algorithms and then improved with local search and simulated annealing algorithms. This approach is based on the conjecture that the following problem is NP-complete. Given an OBDD G representing f and a size bound s, does there exist an OBDD G* (respecting an arbitrary variable ordering) representing f with at most s nodes? This conjecture is proved.