• ROBDD

  • Referenced in 4 articles [sw21204]
  • functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based...
  • Supremica

  • Referenced in 15 articles [sw18546]
  • spaces. The first approach exploits modularity in order to divide the original problem into many ... uses an efficient data structure, a binary decision diagram, to symbolically represent the reachable states...
  • azove

  • Referenced in 12 articles [sw04634]
  • threshold BDDs and the optimal variable ordering problem Many combinatorial optimization problems can be formulated ... these tasks can be accomplished using binary decision diagrams (BDDs), a very popular and effective ... heavily depends on the chosen variable ordering. Finding the optimal variable ordering...
  • CrocoPat

  • Referenced in 2 articles [sw06808]
  • order predicate calculus. The implementation is based on the data structure binary decision diagram...
  • BDDIntKt

  • Referenced in 1 article [sw23446]
  • propositional intuitionistic logic Int using binary decision diagrams (BDDs). We now present some further optimisations ... explicit mechanism for BDD variable ordering...
  • NuMDG

  • Referenced in 2 articles [sw08148]
  • subset of many-sorted first-order logic. This subset generalizes the logic of equality with ... then-else (GITE) commonly operator in Binary Decision Diagram packages. Consequently, we review the main...
  • libVATA

  • Referenced in 1 article [sw33005]
  • semi-symbolic encoding uses multi-terminal binary decision diagrams (MTBDDs) for storing the transition table ... ARTMC), or decision procedures of several logics, such as the monadic second-order logic...
  • MLCUDDIDL

  • Referenced in 0 articles [sw20129]
  • other modules; (initialization, variable ordering, ...) ; the module Bdd allows to manipulate ordinary BDDs (with complemented ... allows to manipulate ADDs (Algebraic Decision Diagrams), the leaves of which are reals; the modules ... allows to manipulate MTBDDs (Multi-Terminal Binary Decision Diagram), the leaves of which ... cycle before any CUDD garbage collection (in order to allow the later to be more...
  • ConfigChecker

  • Referenced in 1 article [sw28842]
  • control policies with Boolean functions using binary decision diagrams (BDDs). We then use computation tree ... allows for executing comprehensive analysis queries in order to verify security and risk requirements across...
  • ACL2

  • Referenced in 279 articles [sw00060]
  • ACL2 is both a programming language in which...
  • CGAL

  • Referenced in 360 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • Coq

  • Referenced in 1807 articles [sw00161]
  • Coq is a formal proof management system. It...
  • FGb

  • Referenced in 242 articles [sw00286]
  • FGb/Gb libraryGb is a program (191 420 lines...
  • GAP

  • Referenced in 2876 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • gmp

  • Referenced in 269 articles [sw00363]
  • GMP is a free library for arbitrary precision...
  • HOL-Boogie

  • Referenced in 14 articles [sw00409]
  • Boogie is a program verification condition generator for...
  • Isabelle

  • Referenced in 611 articles [sw00454]
  • Isabelle is a generic proof assistant. It allows...
  • LEDA

  • Referenced in 261 articles [sw00509]
  • In the core computer science areas -- data structures...
  • Macaulay2

  • Referenced in 1692 articles [sw00537]
  • Macaulay2 is a software system devoted to supporting...
  • Magma

  • Referenced in 2917 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...