CUDD - MaRDI portal

swMATH4446MaRDI QIDQ16622FDOQ16622

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

GR(1)*: GR(1) specifications extended with existential guarantees
Title not available (Why is that?)
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
Symbolic techniques in satisfiability solving
On the evolution of the worst-case OBDD size
Performance heuristics for GR(1) synthesis and related algorithms
Exact stochastic constraint optimisation with applications in network analysis
Title not available (Why is that?)
Title not available (Why is that?)
Extracting co-occurrence relations from ZDDs
Outlier detection using binary decision diagrams
DQBDD: an efficient BDD-based DQBF solver
Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory
Weakest invariant generation for automated addition of fault-tolerance
Ordered binary decision diagrams and the Shannon effect
Reasoning with ordered binary decision diagrams
A model-learner pattern for bayesian reasoning
A direct construction of polynomial-size OBDD proof of pigeon hole problem
Rank-based symbolic bisimulation: (and model checking)
SCOTS: a tool for the synthesis of symbolic controllers
Gröbner-free normal forms for Boolean polynomials
Efficient approach of translating LTL formulae into Büchi automata
BDD-based 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
Gröbner-free normal forms for Boolean polynomials
Verification and enforcement of access control policies
Application of multiroot decision diagrams for integer functions
Formal verification based on Boolean expression diagrams
Factorization of Boolean polynomials: parallel algorithms and experimental evaluation
Random 3-SAT: The plot thickens
Theory and Applications of Satisfiability Testing
Symbolic perimeter abstraction heuristics for cost-optimal planning
Automated Technology for Verification and Analysis
Optimizing probabilities in probabilistic logic programs
The symbolic OBDD scheme for generating mechanical assembly sequences
Lazy synthesis
Proof complexity of symbolic QBF reasoning
Graph Games and Reactive Synthesis
Weighted positive binary decision diagrams for exact probabilistic inference
Improving gate-level simulation of quantum circuits
Title not available (Why is that?)
A layered algorithm for quantifier elimination from linear modular constraints
A reducibility concept for problems defined in terms of ordered binary decision diagrams
Boolean Gröbner bases. Theory, algorithms and applications
Symbolic Model Checking for Dynamic Epistemic Logic
Efficient inclusion checking on explicit and semi-symbolic tree automata
Title not available (Why is that?)
A symbolic algorithm for lazy synthesis of eager strategies
Strategy construction for parity games with imperfect information
Title not available (Why is that?)
The symbolic algorithms for maximum flow in networks
A reducibility concept for problems defined in terms of ordered binary decision diagrams
Title not available (Why is that?)
Relation Algebras, Matrices, and Multi-valued Decision Diagrams
Estimation of network reliability using optimal ROBDD approach.
Hybrid BDD and All-SAT Method for Model Checking
Precise interprocedural analysis in the presence of pointers to the stack
Combining symbolic representations for solving timed games
Title not available (Why is that?)
Title not available (Why is that?)
Hierarchical Set Decision Diagrams and Automatic Saturation
Logic Functions and Equations
Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic
On application of multi-rooted binary decision diagrams to probabilistic model checking
Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams
Tight upper bounds for the expected loss of lexicographic heuristics in binary multi-attribute choice
Graph-based simulation of quantum computation in the density matrix representation
Mixed Transition Systems Revisited
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Practical synthesis of reactive systems from LTL specifications via parity games
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
State-set branching: leveraging BDDs for heuristic search
A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Computer Aided Verification
Theory and Applications of Satisfiability Testing
Cumulative Dominance and Heuristic Performance in Binary Multiattribute Choice
Strong planning under partial observability
Conformant planning via symbolic model checking and heuristic search
Enhancing set constraint solvers with lexicographic bounds
Automated constraint-based addition of nonmasking and stabilizing fault-tolerance
VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
Attacking Bivium Using SAT Solvers
Sigref – A Symbolic Bisimulation Tool Box
Weighted \(A^*\) search - unifying view and application
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
Title not available (Why is that?)
Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
Weak, strong, and strong cyclic planning via symbolic model checking
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

This page was built for software: CUDD