CUDD
From MaRDI portal
Cited in
(only showing first 100 items - show all)- On threshold BDDs and the optimal variable ordering problem
- New developments in the theory of Gröbner bases and applications to formal verification
- The symbolic OBDD scheme for generating mechanical assembly sequences
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- Alpaga
- CirCUs
- Galileo
- MCGP
- PolyBoRi
- ADD-Lib
- CryptaPath
- dd
- JDD
- BDD
- Sylvan
- Q3B
- RelView
- SBSAT
- SIGREF
- slimgb
- A reducibility concept for problems defined in terms of ordered binary decision diagrams
- TopSpin
- TRANSYT
- Lutess
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- XBOOLE
- Random 3-SAT: The plot thickens
- BDDs -- design, analysis, complexity, and applications.
- VerICS
- SATLIB
- CASPA
- PEPS
- STAN
- Efficient manipulation of decision diagrams
- On the evolution of the worst-case OBDD size
- SMART_
- Möbius
- NuSMV
- Efficient approach of translating LTL formulae into Büchi automata
- Practical verification of multi-agent systems against \textsc{Slk} specifications
- Symbolic perimeter abstraction heuristics for cost-optimal planning
- Weighted positive binary decision diagrams for exact probabilistic inference
- azove
- zChaff
- Extracting co-occurrence relations from ZDDs
- Outlier detection using binary decision diagrams
- Model checking temporal properties of reaction systems
- Application of multiroot decision diagrams for integer functions
- Gröbner-free normal forms for Boolean polynomials
- BuDDy
- MONA
- NuSMV: A new symbolic model checker
- Ordered binary decision diagrams and the Shannon effect
- Reasoning with ordered binary decision diagrams
- An efficient algorithm for computing bisimulation equivalence
- On the use of binary decision diagrams for solving problems on simple games
- visualSTATE
- Formal verification based on Boolean expression diagrams
- SymmSpin
- Strategy construction for parity games with imperfect information
- Graphplan
- Cadence SMV
- GR(1)*: GR(1) specifications extended with existential guarantees
- SPNP
- Sycraft
- Factorization of Boolean polynomials: parallel algorithms and experimental evaluation
- JTLV
- BDDNOW
- FORCE
- Proof complexity of symbolic QBF reasoning
- DQBDD: an efficient BDD-based DQBF solver
- MCMAS
- Verics
- MCK
- YASM
- SPOT
- SATORI
- gmm++
- VATA
- LETHAL
- HANNIBAL
- LinAIG
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
- Verification and enforcement of access control policies
- SWORD
- LTL2BA
- Practical synthesis of reactive systems from LTL specifications via parity games
- Performance heuristics for GR(1) synthesis and related algorithms
- A symbolic algorithm for lazy synthesis of eager strategies
- Automated planning as an early verification tool for distributed control
- The complexity of automated addition of fault-tolerance without explicit legitimate states
- A layered algorithm for quantifier elimination from linear modular constraints
- Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams
- Rex
- State-set branching: leveraging BDDs for heuristic search
- Sequential Monte Carlo in reachability heuristics for probabilistic planning
- Tight upper bounds for the expected loss of lexicographic heuristics in binary multi-attribute choice
- The symbolic algorithms for maximum flow in networks
- A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm
- DFTCalc
This page was built for software: CUDD
