The following pages link to CUDD (Q16622):
Displaying 50 items.
- Efficient symbolic search for cost-optimal planning (Q343909) (← links)
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418) (← links)
- Synthesis of Reactive(1) designs (Q439954) (← links)
- Benchmarking a model checker for algorithmic improvements and tuning for performance (Q453484) (← links)
- Symbolic bounded synthesis (Q453535) (← links)
- Counterexamples to the long-standing conjecture on the complexity of BDD binary operations (Q456068) (← links)
- Symbolic trajectory evaluation for word-level verification: theory and implementation (Q526779) (← links)
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning (Q543630) (← links)
- Automated constraint-based addition of nonmasking and stabilizing fault-tolerance (Q555302) (← links)
- Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications (Q600975) (← links)
- Context-aware counter abstraction (Q600978) (← links)
- A lazy approach to symmetry reduction (Q613132) (← links)
- On the consistency, expressiveness, and precision of partial modeling formalisms (Q617712) (← links)
- Formal reliability analysis of redundancy architectures (Q667523) (← links)
- Synthesis of obfuscation policies to ensure privacy and utility (Q682359) (← links)
- Game-theoretic simulation checking tool (Q764005) (← links)
- Handling high dimensionality contexts in formal concept analysis via binary decision diagrams (Q781866) (← links)
- Weak, strong, and strong cyclic planning via symbolic model checking (Q814470) (← links)
- Solving factored MDPs using non-homogeneous partitions (Q814475) (← links)
- Conformant planning via symbolic model checking and heuristic search (Q814631) (← links)
- Formal verification of a Java component using the RESOLVE framework (Q831953) (← links)
- \textsf{BDD4BNN}: a BDD-based quantitative analysis framework for binarized neural networks (Q832164) (← links)
- Adapting behaviors via reactive synthesis (Q832238) (← links)
- Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath (Q832343) (← links)
- Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
- Symbolic techniques in satisfiability solving (Q862403) (← links)
- High-gain output-feedback control for nonlinear systems based on multiple time scaling (Q864488) (← links)
- A direct construction of polynomial-size OBDD proof of pigeon hole problem (Q987797) (← links)
- On threshold BDDs and the optimal variable ordering problem (Q1016038) (← links)
- New developments in the theory of Gröbner bases and applications to formal verification (Q1017680) (← links)
- The symbolic OBDD scheme for generating mechanical assembly sequences (Q1028726) (← links)
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials (Q1030264) (← links)
- A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q1364133) (← links)
- On the use of MTBDDs for performability analysis and verification of stochastic systems. (Q1400289) (← links)
- Random 3-SAT: The plot thickens (Q1424763) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- Efficient manipulation of decision diagrams (Q1606804) (← links)
- On the evolution of the worst-case OBDD size (Q1607073) (← links)
- Efficient approach of translating LTL formulae into Büchi automata (Q1633083) (← links)
- Practical verification of multi-agent systems against \textsc{Slk} specifications (Q1641030) (← links)
- Symbolic perimeter abstraction heuristics for cost-optimal planning (Q1647507) (← links)
- Weighted positive binary decision diagrams for exact probabilistic inference (Q1678452) (← links)
- Extracting co-occurrence relations from ZDDs (Q1736536) (← links)
- Outlier detection using binary decision diagrams (Q1741310) (← links)
- Model checking temporal properties of reaction systems (Q1749193) (← links)
- Application of multiroot decision diagrams for integer functions (Q1759552) (← links)
- Gröbner-free normal forms for Boolean polynomials (Q1760097) (← links)
- NuSMV: A new symbolic model checker (Q1856168) (← links)
- Ordered binary decision diagrams and the Shannon effect (Q1878402) (← links)
- Reasoning with ordered binary decision diagrams (Q1878409) (← links)
