CUDD

swMATH4446MaRDI QIDQ16622FDOQ16622

Author name not available (Why is that?)

Official website: http://vlsi.colorado.edu/~fabio/CUDD/

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

• GR(1)*: GR(1) specifications extended with existential guarantees
• Unbeast
• Title not available (Why is that?)
• SableJBDD
• 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
• dCAQE
• 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
• BoSy
• Outlier detection using binary decision diagrams
• DQBDD: an efficient BDD-based DQBF solver
• Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory
• Sylvan
• 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
• 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
• QESTO
• 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
• Owl
• CryptaPath
• Q3B
• Symbolic Model Checking for Dynamic Epistemic Logic
• Efficient inclusion checking on explicit and semi-symbolic tree automata
• Title not available (Why is that?)
• Strategy construction for parity games with imperfect information
• Lurette
• Title not available (Why is that?)
• The symbolic algorithms for maximum flow in networks
• Practical synthesis of reactive systems from LTL specifications via parity games
• Computer Aided Verification
• Sigref – A Symbolic Bisimulation Tool Box
• Alpaga
• CirCUs
• Galileo
• MCGP
• PolyBoRi
• RelView
• SBSAT
• SIGREF
• slimgb
• TopSpin
• TRANSYT
• Lutess
• Title not available (Why is that?)
• XBOOLE
• SATLIB
• VerICS
• CASPA
• PEPS
• STAN
• NuSMV
• SMART_
• azove
• zChaff
• BuDDy
• MONA
• visualSTATE
• SymmSpin
• SPOT
• Cadence SMV
• Graphplan
• Title not available (Why is that?)
• SPNP
• Sycraft
• BDDNOW
• JTLV
• FORCE
• MCMAS

This page was built for software: CUDD