The program decision logic approach to predicated execution
ISCA '99 Proceedings of the 26th annual international symposium on Computer architecture
Accurate and efficient predicate analysis with binary decision diagrams
Proceedings of the 33rd annual ACM/IEEE international symposium on Microarchitecture
Verifying safety properties of concurrent Java programs using 3-valued logic
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automated Correctness Condition Generation for Formal Verification ofSynthesized RTL Designs
Formal Methods in System Design - Special issue on formal methods for computer-added design
Proceedings of the joint conference on Languages, compilers and tools for embedded systems: software and compilers for embedded systems
Towards a mechanically checked theory of computation: the ACL2 project
Logic-based artificial intelligence
Arithmetic Boolean Expression Manipulator Using BDDs
Formal Methods in System Design
Modeling methodology for integrated simulation of embedded systems
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Constraint-guided self-adaptation
IWSAS'01 Proceedings of the 2nd international conference on Self-adaptive software: applications
Symbolic archive representation for a fast nondominance test
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Uniform execution environment for dynamic reconfiguration
ECBS'99 Proceedings of the 1999 IEEE conference on Engineering of computer-based systems
Multi-domain surety modeling and analysis for high assurance systems
ECBS'99 Proceedings of the 1999 IEEE conference on Engineering of computer-based systems
Validating low-level instructions for fixnums using BDDs
Proceedings of the 2010 international conference on Lisp
Hi-index | 0.00 |
Ordered Binary Decision Diagrams (OBDDs) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satisfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as graph algorithms on OBDD data structures. Using OBDDs, a wide variety of problems can be solved through symbolic analysis. First, the possible variations in system parameters and operating conditions are encoded with Boolean variables. Then the system is evaluated for all variations by a sequence of OBDD operations. Researchers have thus solved a number of problems in digital system design, finite state system analysis, artificial intelligence, and mathematical logic. This paper describes the OBDD data structure, and surveys a number of applications that have been solved by OBDD-based symbolic analysis.