CUDD
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Unbeast: Symbolic Bounded Synthesis
- Automatic data-abstraction in model checking multi-agent systems
- GR(1)*: GR(1) specifications extended with existential guarantees
- Graph-based simulation of quantum computation in the density matrix representation
- A reducibility concept for problems defined in terms of ordered binary decision diagrams
- scientific article; zbMATH DE number 2084712 (Why is no real title available?)
- Mixed Transition Systems Revisited
- scientific article; zbMATH DE number 1538049 (Why is no real title available?)
- Formal verification of a Java component using the RESOLVE framework
- \textsf{BDD4BNN}: a BDD-based quantitative analysis framework for binarized neural networks
- Adapting behaviors via reactive synthesis
- Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath
- scientific article; zbMATH DE number 2102715 (Why is no real title available?)
- scientific article; zbMATH DE number 5547823 (Why is no real title available?)
- Practical synthesis of reactive systems from LTL specifications via parity games
- Symbolic techniques in satisfiability solving
- scientific article; zbMATH DE number 1953899 (Why is no real title available?)
- On the evolution of the worst-case OBDD size
- Performance heuristics for GR(1) synthesis and related algorithms
- State-set branching: leveraging BDDs for heuristic search
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm
- Exact stochastic constraint optimisation with applications in network analysis
- Extracting co-occurrence relations from ZDDs
- Outlier detection using binary decision diagrams
- scientific article; zbMATH DE number 5909229 (Why is no real title available?)
- DQBDD: an efficient BDD-based DQBF solver
- scientific article; zbMATH DE number 2084701 (Why is no real title available?)
- Computer Aided Verification
- scientific article; zbMATH DE number 1926658 (Why is no real title available?)
- Theory and Applications of Satisfiability Testing
- Cumulative Dominance and Heuristic Performance in Binary Multiattribute Choice
- Conformant planning via symbolic model checking and heuristic search
- Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory
- Ordered binary decision diagrams and the Shannon effect
- Reasoning with ordered binary decision diagrams
- Automated constraint-based addition of nonmasking and stabilizing fault-tolerance
- Strong planning under partial observability
- Weakest invariant generation for automated addition of fault-tolerance
- Enhancing set constraint solvers with lexicographic bounds
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
- A direct construction of polynomial-size OBDD proof of pigeon hole problem
- A model-learner pattern for bayesian reasoning
- Relation Algebras, Matrices, and Multi-valued Decision Diagrams
- Attacking Bivium Using SAT Solvers
- Rank-based symbolic bisimulation: (and model checking)
- Weighted \(A^*\) search - unifying view and application
- Sigref – A Symbolic Bisimulation Tool Box
- Gröbner-free normal forms for Boolean polynomials
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
- SCOTS: a tool for the synthesis of symbolic controllers
- Efficient approach of translating LTL formulae into Büchi automata
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
- BDD-based symbolic model checking
- scientific article; zbMATH DE number 2080304 (Why is no real title available?)
- Weak, strong, and strong cyclic planning via symbolic model checking
- Automated planning as an early verification tool for distributed control
- The complexity of automated addition of fault-tolerance without explicit legitimate states
- Verification and enforcement of access control policies
- Application of multiroot decision diagrams for integer functions
- Gröbner-free normal forms for Boolean polynomials
- Parallel model checking for temporal epistemic logic
- Model checking temporal properties of reaction systems
- Context-aware counter abstraction
- Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications
- Formal verification based on Boolean expression diagrams
- High-gain output-feedback control for nonlinear systems based on multiple time scaling
- Estimation of network reliability using optimal ROBDD approach.
- Factorization of Boolean polynomials: parallel algorithms and experimental evaluation
- Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators
- Benchmarking a model checker for algorithmic improvements and tuning for performance
- Symbolic bounded synthesis
- BDD-based decision procedures for the modal logic K ★
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Random 3-SAT: The plot thickens
- scientific article; zbMATH DE number 2079387 (Why is no real title available?)
- Symbolic perimeter abstraction heuristics for cost-optimal planning
- Hybrid BDD and All-SAT Method for Model Checking
- Precise interprocedural analysis in the presence of pointers to the stack
- Theory and Applications of Satisfiability Testing
- Synthesis of Reactive(1) designs
- Almost ASAP semantics: from timed models to timed implementations
- Automata Learning through Counterexample Guided Abstraction Refinement
- Combining symbolic representations for solving timed games
- A lazy approach to symmetry reduction
- On the consistency, expressiveness, and precision of partial modeling formalisms
- Alpaga
- CirCUs
- Galileo
- MCGP
- PolyBoRi
- RelView
- SBSAT
- SIGREF
- slimgb
- TopSpin
- TRANSYT
- Lutess
- XBOOLE
This page was built for software: CUDD
