Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 51 for “"BDDs"”.

  1. Using BDDs for non-classical propositional theorem proving

    … and validity using Binary Decision Diagrams (BDDs) to construct finite (pseudo-)models. The method was originally considered by Pan et al and Marrero. We extend the method to deal with a wide variety of non-classical propositional logics including the 15 basic normal modal logics, multimodal …

    anu Repository record for Using BDDs for non-classical propositional theorem proving (opens in a new tab)

  2. Geração de circuitos a partir de BDDs : junção de funções booleanas incompletamente especificadas

    … como um par de Binary Decision Diagrams (BDDs). O algoritmo consiste em explorar o On-set e Off-set da relação booleana de entrada representada como BDDs e juntá-los em um terceiro BDD, que terá um número menor de nodos. Em média, nosso algoritmo foi capaz de gerar coberturas com 23,53% do …

    brazil-ufrgs Repository record for Geração de circuitos a partir de BDDs : junção de funções booleanas incompletamente especificadas (opens in a new tab)

  3. Jory: A Tool for Feature Modelling Based on Product Families Algebra and BDDs

    … of multi-sets and the operations on them using BDDs.</p> <p>Several case studies are presented and used in the validation of the tool. p.p1 {margin: 0.0px 0.0px 0.0px 0.0px; font: 11.5px Times}</p>

    mcmaster Repository record for Jory: A Tool for Feature Modelling Based on Product Families Algebra and BDDs (opens in a new tab)

  4. Geração de circuitos a partir de BDDs : simplificações possíveis a partir da decomposição de shannon

    … a partir de diagramas de decisão binários (BDDs). Existe um método trivial para síntese de circuitos digitais a partir de BDDs onde cada nodo do BDD é mapeado diretamente para um multiplexador em uma correspondência um para um, ou seja: um nodo, um multiplexador. Este método é possível …

    brazil-ufrgs Repository record for Geração de circuitos a partir de BDDs : simplificações possíveis a partir da decomposição de shannon (opens in a new tab)

  5. Surface chemical and particle modification of diamond electrodes

    <p>Boron-doped diamond electrodes (BDDs) offer a range of advantageous properties for electrochemical sensing. They are normally used with a chemical surface termination comprised of oxygen species, but hydrogen terminations are also stable. A hydrogen surface termination offers different …

    oxford Repository record for Surface chemical and particle modification of diamond electrodes (opens in a new tab)

  6. Performance analysis of symbolic reachability algorithms in model checking

    … symbolically with Binary Decision Diagrams (BDDs). First we use BDDs to represent sets of states that are randomly chosen from a state space. Then we study how the number of states affects the size of BDDs. Based on our research, we provide a formula to calculate the size of BDDs that …

    rice Repository record for Performance analysis of symbolic reachability algorithms in model checking (opens in a new tab)

  7. Succinct function representations for simulation and verification

    … of computer science. Binary Decision Diagrams (BDDs) provide a compact representation of such functions and have become a cornerstone of symbolic methods in verification, program analysis, and, more recently, simulation of quantum circuits on classical hardware. However, many BDD-based …

    texas Repository record for Succinct function representations for simulation and verification (opens in a new tab)

  8. BDD-Based Boolean Synthesis

    … systems. Binary Decision Diagrams (BDDs) have historically been popular data structures for representing Boolean functions, and BDDs are especially useful for the application of reactive synthesis, where they are particularly well-suited for fixpoint computations over sets of states. …

    rice Repository record for BDD-Based Boolean Synthesis (opens in a new tab)

  9. FIREBLADE: ENHANCING FIREWALL VALIDATION WITH BINARY LOGIC ANALYSIS AND DECISION ENGINES

    … by firewalls using Binary Decision Diagrams (BDDs) to store and query prior firewall actions (permit or deny) on individual packets, facilitating firewall rule validation. The research evaluates the potential of using captured packet traces from enterprise border network routers to create …

    nps Repository record for FIREBLADE: ENHANCING FIREWALL VALIDATION WITH BINARY LOGIC ANALYSIS AND DECISION ENGINES (opens in a new tab)

  10. Symbolic techniques for VLSI test and diagnosis

    … to the development of binary decision diagrams (BDDs), symbolic methods have become a practical means of handling the large sets encountered in these applications. In this thesis, several algorithms are presented which make use of BDDs to address problems in digital circuit testing and diagnosis.

    uiuc Repository record for Symbolic techniques for VLSI test and diagnosis (opens in a new tab)

  11. Efficient Reasoning Techniques for Large Scale Feature Models

    … SAT solvers and Binary Decision Diagrams (BDDs). Each technique has been applied successfully for over four decades now to tackle many practical combinatorial problems in various domains. Currently, several approaches have proposed the compilation of feature models to specific logic …

    waterloo Repository record for Efficient Reasoning Techniques for Large Scale Feature Models (opens in a new tab)

  12. Worst-case and median encoding sizes of binary decision diagrams

    Binary decision diagrams (BDDs) have been a huge success story in hardware and software verification. In various extended forms, they are increasingly applied to a wide range of combinatorial problems. However, BDDs are a heuristic to encode Boolean functions of a fixed number of Boolean variables, …

    iastate Repository record for Worst-case and median encoding sizes of binary decision diagrams (opens in a new tab)

  13. Design and Evaluation of a Specialized Computer Architecture for Manipulating Binary Decision Diagrams

    Binary Decision Diagrams (BDDs) are an extremely important data structure used in many logic design, synthesis and verification applications. Symbolic problem representations make BDDs a feasible data structure for use on many problems that have discrete representations. Efficient implementations …

    portland-state Repository record for Design and Evaluation of a Specialized Computer Architecture for Manipulating Binary Decision Diagrams (opens in a new tab)

  14. Selected Topics in Network Optimization: Aligning Binary Decision Diagrams for a Facility Location Problem and a Search Method for Dynamic Shortest Path Interdiction

    … size of a pair of binary decision diagrams (BDDs) under a certain structural property, a variant of the facility location problem, and a dynamic version of the Shortest-Path Interdiction (DSPI) problem. However, these problems all have the following core idea in common: They all stem from …

    clemson Repository record for Selected Topics in Network Optimization: Aligning Binary Decision Diagrams for a Facility Location Problem and a Search Method for Dynamic Shortest Path Interdiction (opens in a new tab)

  15. Binäre Expression-Diagramme

    … der populären binären Entscheidungs-Diagramme (BDDs) vor, die im Bereich der Logiksynthese und Verifikation des Rechnerentwurfs ihre Anwendung finden.

    freiburg-diss Repository record for Binäre Expression-Diagramme (opens in a new tab)

  16. Practical verification of network planes

    … is able to overcome some specific limitations of BDDs in the context of storing packet sets. We describe a set of benchmark traces for evaluating packet set data structures, and perform an experimental comparison of our proposed data structure with BDDs. The experiments show that we are able to …

    uiuc Repository record for Practical verification of network planes (opens in a new tab)

  17. Symbolic methods for testing digital circuits

    … methods, realized by Boolean Decision Diagrams (BDDs), in the field of testing both combinational and synchronous sequential digital circuits at gate level. <br>Both major topics, fault simulation and automated test pattern generation (ATPG), have been examined, among others, like build-in …

    freiburg-diss Repository record for Symbolic methods for testing digital circuits (opens in a new tab)

  18. Symbolic Approaches for Boolean Synthesis

    … especially those using Binary Decision Diagrams (BDDs), an acyclic directed graph that maps the solutions for a boolean formula to its paths. Scalability challenges also rose as exponential memory blowups occurred in handling large-scale problems using BDDs, but it also becomes one of the most …

    rice Repository record for Symbolic Approaches for Boolean Synthesis (opens in a new tab)

  19. Improved Symbolic Model Checking of Real-Time Systems

    … technique based on binary decision diagrams (BDDs) has been shown to be successful in handling the state space explosion. However, the application of BDD-based model checking requires knowledge of BDDs and is difficult for hierarchical systems. Moreover, the performance of BDD-based model …

    nus Repository record for Improved Symbolic Model Checking of Real-Time Systems (opens in a new tab) Download file for Improved Symbolic Model Checking of Real-Time Systems (opens in a new tab)

  20. Approximate Binary Decision Diagrams for High-Performance Computing

    … thesis, we study how Binary decision diagrams (BDDs) can be used to synthesize approximate high-performance implementations from high-level specifications such as program kernels written in a C-like language. We demonstrate the potential of our approach by designing nanoscale crossbars from such …

    ucf Repository record for Approximate Binary Decision Diagrams for High-Performance Computing (opens in a new tab)

Page 1 of 3