Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Direct methods for sparse matrices
Direct methods for sparse matrices
ACM Transactions on Mathematical Software (TOMS)
Introduction to algorithms
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Sequential circuit verification using symbolic model checking
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Representing circuits more efficiently in symbolic model checking
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Algorithms for approximate FSM traversal
DAC '93 Proceedings of the 30th international Design Automation Conference
Spectral transforms for large boolean functions with applications to technology mapping
DAC '93 Proceedings of the 30th international Design Automation Conference
Probabilistic analysis of large finite state machines
DAC '94 Proceedings of the 31st annual Design Automation Conference
Graph Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Verification of Synchronous Sequential Machines Based on Symbolic Execution
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Computing the maximum power cycles of a sequential circuit
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Kernel-based power optimization of RTL components: exact and approximate extraction algorithms
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Automatic Synthesis of Large Telescopic Units Based on Near-Minimum Timed Supersetting
IEEE Transactions on Computers
Symbolic synthesis of clock-gating logic for power optimization of synchronous controllers
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Using the exact state space of a Markov model to compute approximate stationary measures
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The nonapproximability of OBDD minimization
Information and Computation
A Symbolic Algorithms for Maximum Flow in 0-1 Networks
Formal Methods in System Design
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Faster and Symbolic CTMC Model Checking
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Advances in Model Representations
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reachability Analysis of Probabilistic Systems by Successive Refinements
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Deriving Symbolic Representations from Stochastic Process Algebras
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Using Edge-Valued Decision Diagrams for Symbolic Generation of Shortest Paths
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
An ASIC design methodology with predictably low leakage, using leakage-immune standard cells
Proceedings of the 2003 international symposium on Low power electronics and design
High-Performance QuIDD-Based Simulation of Quantum Circuits
Proceedings of the conference on Design, automation and test in Europe - Volume 2
Improving Gate-Level Simulation of Quantum Circuits
Quantum Information Processing
Accurate Reliability Evaluation and Enhancement via Probabilistic Transfer Matrices
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
ISLPED '05 Proceedings of the 2005 international symposium on Low power electronics and design
Reducing cache misses by application-specific re-configurable indexing
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Algorithms for compacting error traces
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
From complementation to certification
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
A predictably low-leakage ASIC design style
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Checking equivalence of quantum circuits and states
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Combining predicate and numeric abstraction for software model checking
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
An XQDD-Based Verification Method for Quantum Circuits
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
PRISM: probabilistic model checking for performance and reliability analysis
ACM SIGMETRICS Performance Evaluation Review
Hierarchical Set Decision Diagrams and Regular Models
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Graded-CTL: Satisfiability and Symbolic Model Checking
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Symbolic Reasoning with Weighted and Normalized Decision Diagrams
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining control and data abstraction in the verification of hybrid systems
MEMOCODE'09 Proceedings of the 7th IEEE/ACM international conference on Formal Methods and Models for Codesign
Bounded reachability checking of asynchronous systems using decision diagrams
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Data representation and efficient solution: a decision diagram approach
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Magnifying-lens abstraction for Markov decision processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Symbolic partition refinement with automatic balancing of time and space
Performance Evaluation
Combining control and data abstraction in the verification of hybrid systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special section on the ACM IEEE international conference on formal methods and models for codesign (MEMOCODE) 2009
Graph-based simulation of quantum computation in the density matrix representation
Quantum Information & Computation
Representation of coalitional games with algebraic decision diagrams
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Formal analysis of online algorithms
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Symmetry reduction for probabilistic model checking
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Genetic linkage analysis algorithms and their implementation
Transactions on Computational Systems Biology III
A framework for estimating peak power in gate-level circuits
PATMOS'06 Proceedings of the 16th international conference on Integrated Circuit and System Design: power and Timing Modeling, Optimization and Simulation
Computing a hierarchical static order for decision diagram-based representation from p/t nets
Transactions on Petri Nets and Other Models of Concurrency V
Monitoring the execution of partial-order plans via regression
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Bayesian inference using data flow analysis
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
Towards a knowledge compilation map for heterogeneous representation languages
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Symbolic merge-and-shrink for cost-optimal planning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Some notes on the abstraction operation for multi-terminal binary decision diagrams
Formal Methods in System Design
| Hi-index | 0.00 |
In this paper we present theory and experimental results on Algebraic Decision Diagrams. These diagrams extend BDDs by allowing values from an arbitraryfinite domain to be associated with the terminal nodes of the diagram.We present a treatment founded in Boolean algebras and discussalgorithms and results in several areas of application: Matrixmultiplication, shortest path algorithms, and direct methods for numerical linear algebra. Although we report anessentially negative result for Gaussian elimination per se, wepropose a modified form of ADDs which appears tocircumvent the difficulties in some cases. We discuss the relevanceof our findings and point to directions for future work.