CUDD

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?)
• 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
• Optimizing Probabilities in Probabilistic Logic Programs
• 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
• Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata
• 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
• 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
• Gröbner-free normal forms for Boolean polynomials
• Efficient approach of translating LTL formulae into Büchi automata
• 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
• Formal verification based on Boolean expression diagrams
• Factorization of Boolean polynomials: parallel algorithms and experimental evaluation
• Title not available (Why is that?)
• 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
• The symbolic OBDD scheme for generating mechanical assembly sequences
• Proof complexity of symbolic QBF reasoning
• BDD-Based Symbolic Model Checking
• 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
• Symbolic Model Checking for Dynamic Epistemic Logic
• Lazy Synthesis
• Title not available (Why is that?)
• Rank-Based Symbolic Bisimulation
• Weakest Invariant Generation for Automated Addition of Fault-Tolerance
• A symbolic algorithm for lazy synthesis of eager strategies
• Strategy construction for parity games with imperfect information
• SCOTS
• 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?)
• On Application of Multi-Rooted Binary Decision Diagrams to Probabilistic Model Checking
• Title not available (Why is that?)
• Relation Algebras, Matrices, and Multi-valued Decision Diagrams
• Hybrid BDD and All-SAT Method for Model Checking
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hierarchical Set Decision Diagrams and Automatic Saturation
• Precise Interprocedural Analysis in the Presence of Pointers to the Stack
• Logic Functions and Equations
• Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic
• Combining Symbolic Representations for Solving Timed Games
• 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
• Title not available (Why is that?)
• 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
• Symbolic Model Checking for Temporal-Epistemic Logic
• 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
• Automatic Data-Abstraction in Model Checking Multi-Agent Systems
• 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
• Model checking temporal properties of reaction systems
• Context-aware counter abstraction

This page was built for software: CUDD