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 19 of 19 for “"Satisfiability Modulo Theory"”.

  1. Automatic Design Space Exploration of Fault-tolerant Embedded Systems Architectures

    … an exact method that leverages the power of Satisfiability Modulo Theory to encode the problem with a symbolic technique. It is based on a novel assessment of reliability which is part of the evaluation of alternative designs. Afterwards, we empirically evaluate the performance of a …

    trento Repository record for Automatic Design Space Exploration of Fault-tolerant Embedded Systems Architectures (opens in a new tab)

  2. Contribuições para o processo de verificação de satisfatibilidade módulo teoria em Event-B

    … in order to keep the produced models consistent. Satisfiability Modulo Theory solvers are automated theorem provers used to verify the satisfiability of logic formulas considering a background theory (or combination of theories). SMT solvers not only handle large firstorder formulas, but can also …

    brazil-ufrn Repository record for Contribuições para o processo de verificação de satisfatibilidade módulo teoria em Event-B (opens in a new tab)

  3. Planning and Scheduling in Temporally Uncertain Domains

    … of existing works. Second, we show how Satisfiability Modulo Theory (SMT) solvers can be exploited to quickly solve different kinds of query in the realm of scheduling under uncertainty. Finally, we address the problem of temporal planning in domains featuring real-time constraints and …

    trento Repository record for Planning and Scheduling in Temporally Uncertain Domains (opens in a new tab) Restricted access

  4. Automated concurrency bug finding using partial-orders

    … decision procedures, such as <em>Boolean satisfiability</em> (<em>SAT</em>) and <em>Satisfiability Modulo Theory</em> (<em>SMT</em>) solvers.</p> <p>While methods to effectively use SAT/SMT solvers for automatically finding bugs in sequential software through symbolic techniques, such as …

    oxford Repository record for Automated concurrency bug finding using partial-orders (opens in a new tab)

  5. A Computational Approach to Custom Data Representation for Hardware Accelerators

    … the use of a computational method based on Satisfiability-Modulo Theory (SMT). By capturing a calculation as a set of constraints, an SMT instance can be formulated which provides meaningful bounds even in the presence of ill-conditioned operators. At the same time, the analytical nature of …

    mcmaster Repository record for A Computational Approach to Custom Data Representation for Hardware Accelerators (opens in a new tab)

  6. Decoding the Language of Genomes: Bridging Sequences and Function through Deep Learning

    … (WGT) combines permutation heuristics and satisfiability‑modulo‑theory solvers to recognize and visualize Wheeler graphs, laying the theoretical foundation for pangenome indexing. We then describe LiftOn, a hybrid liftover tool that fuses protein‑to‑genome and DNA‑to‑genome alignments to …

    jhu Repository record for Decoding the Language of Genomes: Bridging Sequences and Function through Deep Learning (opens in a new tab)

  7. Combining advanced formal hardware verification techniques

    … IBM. Also, a fully-automated procedure for the Satisfiability Modulo Theory (SMT) of bit vectors is implemented by combining a solver for SUFLA formulas with the ACL2 theorem prover's general-purpose rewriting proof technique. A new methodology for combining theorem proving and model checking is …

    texas Repository record for Combining advanced formal hardware verification techniques (opens in a new tab)

  8. SMT-BASED VERIFICATION OF BUILDING MANAGEMENT SYSTEMS

    … specification. To achieve this, we utilize the Satisfiability Modulo Theory (SMT) solver, which is a formal technique for an automated program analysis that is increasingly used by vulnerability-discovering platforms, especially in integer security problem checking.<br/><br/>In particular, our …

    kings Repository record for SMT-BASED VERIFICATION OF BUILDING MANAGEMENT SYSTEMS (opens in a new tab) Download PDF for SMT-BASED VERIFICATION OF BUILDING MANAGEMENT SYSTEMS (opens in a new tab)

  9. Robotic Path Planning for High-Level Tasks in Discrete Environments

    … The allocation problem is encoded as a Boolean Satisfiability problem (SAT) and the path planning problem is encoded as a Travelling Salesman Problem (TSP). In addition, this framework can handle complex constraints such as battery life limitations, robot carrying capacities, and robot-task …

    waterloo Repository record for Robotic Path Planning for High-Level Tasks in Discrete Environments (opens in a new tab)

  10. Layout automation for custom integrated circuits

    … field-effect transistor (FinFET) designs. Using satisfiability modulo theory (SMT) formulations, the proposed custom placer has extensive constraint-solving capabilities and the flexibility to add new constraint support for future needs. Finally, we propose a robust custom router capable of …

    texas Repository record for Layout automation for custom integrated circuits (opens in a new tab)

  11. Enhancing Variation-aware Analog Circuits Sizing

    … nonlinear constraints. A new algorithm using Satisfiability Modulo Theory (SMT) solving techniques exhaustively explores the analog design space and computes a continuous set of feasible sizing solutions. Next, a yield optimization stage aims to select the candidate design solution with the …

    concordia Download PDF for Enhancing Variation-aware Analog Circuits Sizing (opens in a new tab)

  12. The modelling and synthesis of chemical reaction networks

    … aimed at finding an optimal CRN are provided. Satisfiability Modulo Theory (SMT-ODE) solvers are employed to solve parametric ODEs constructed from a combination of the Linear Noise Approximation dynamics and sketching language choice variables. In our tool, named CRNSketch, a generalization of …

    oxford Repository record for The modelling and synthesis of chemical reaction networks (opens in a new tab)

  13. Abstractions and formal verification of max-plus linear systems

    … We then propose alternative methods utilising Satisfiability Modulo Theory (SMT). The main idea underpinning the SMT-based methods is to transform the dynamics of the model and possibly the specifications under consideration into a formula in quantifier-free Real Difference Logic (QF-RDL) or …

    oxford Repository record for Abstractions and formal verification of max-plus linear systems (opens in a new tab)

  14. Addressing the Verification Challenge of Agile Hardware Methodologies

    … a static analysis technique based on satisfiability modulo theory (SMT) solving. Symbolic elaboration targets a synthesizable subset of HDL syntax and translates generator properties into integer constraints that can be solved by SMT solvers. Third, I overcome the verification …

    cornell Repository record for Addressing the Verification Challenge of Agile Hardware Methodologies (opens in a new tab)

  15. Formal approaches to security-aware robotic motion planning using hyperproperties

    … specifically using automata-based and satisfiability modulo theory (SMT)-based model checking methods under HyperTWTL specifications. This is because most existing model-checking verification techniques based on both automata and SMT are limited to the analysis of individual trace …

    missouri Repository record for Formal approaches to security-aware robotic motion planning using hyperproperties (opens in a new tab)

  16. A Framework for Estimating Vulnerability of Digital Circuits against Single Event Multiple Transients

    Recent deep-submicron-technology-based integrated circuits (ICs) are substantially more susceptible to transient faults. Thus, the soft errors that occurred due to transient faults are more important than they have ever been. As a result, it is critical to identify any functional inconsistencies …

    concordia Download PDF for A Framework for Estimating Vulnerability of Digital Circuits against Single Event Multiple Transients (opens in a new tab)

  17. Verification and Configuration of Software-based Networks

    … formulas are passed to the off-the-shelf SMT (Satisfiability Modulo Theory) solver Z3 in order to verify some reachability-based properties. In particular, the proposed solution has been implemented in a tool released under the AGPLv3 license, named VeriGraph, which takes the functional …

    poli-torino Repository record for Verification and Configuration of Software-based Networks (opens in a new tab)

  18. Design Validation of RTL Circuits using Binary Particle Swarm Optimization and Symbolic Execution

    Over the last two decades, chip design has been conducted at the register transfer (RT) Level using Hardware Descriptive Languages (HDL), such as VHDL and Verilog. The modeling at the behavioral level not only allows for better representation and understanding of the design, but also allows for …

    vt Repository record for Design Validation of RTL Circuits using Binary Particle Swarm Optimization and Symbolic Execution (opens in a new tab)