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 80 for “"SMT Solvers"”.

  1. Leveraging SMT Solvers for Reachability Analysis

    … by leveraging underutilized features of modern SMT solvers. We make two primary contributions. First, we develop an incremental SMT solving technique for symbolic reachability that maintains persistent solver state across queries. By preserving learned clauses and internal deductions throughout …

    penn Repository record for Leveraging SMT Solvers for Reachability Analysis (opens in a new tab)

  2. StringFuzz: A Fuzzer for String SMT Solvers

    … a software tool for automatically testing string SMT solvers. String SMT solvers are specialised software tools for solving the Satisfiability Modulo Theories (SMT) problem with string contraints, which is a type of constraint satisfaction problem applicable in industry. Like all tools, string SMT …

    waterloo Repository record for StringFuzz: A Fuzzer for String SMT Solvers (opens in a new tab)

  3. Improvements to Many-Sorted Finite Model Finding using SMT Solvers

    … (SAT) or satisfiability modulo theories (SMT) solvers when finitizing a problem. We propose improvements to encodings of many-sorted finite model finding problems for SMT solvers. We propose new encodings for finite integers and transitive closure. The key contributions of this thesis are …

    waterloo Repository record for Improvements to Many-Sorted Finite Model Finding using SMT Solvers (opens in a new tab)

  4. Formal Semantics and Scalable Verification for the Border Gateway Protocol using Proof Assistants and SMT Solvers

    … configurations implement such policies using an SMT solver. We evaluated the expressiveness of Bagpipe’s policy specification language on 10 configuration scenarios from the Juniper TechLibrary, and evaluated the efficiency of Bagpipe on three ISPs with a total of over 240,000 lines of Cisco and …

    washington Repository record for Formal Semantics and Scalable Verification for the Border Gateway Protocol using Proof Assistants and SMT Solvers (opens in a new tab)

  5. SAT modulo monotonic theories

    Satisfiability Modulo Theories (SMT) solvers are a class of efficient constraint solvers which form integral parts of many algorithms. Over the years, dozens of different Satisfiability Modulo Theories solvers have been developed, supporting dozens of different logics. However, there are still many …

    ubc Repository record for SAT modulo monotonic theories (opens in a new tab) Download PDF for SAT modulo monotonic theories (opens in a new tab)

  6. Novas técnicas de instanciação e produção de demonstrações para a resolução SMT

    … methods applications it is common to rely on SMT solvers to automatically discharge conditions that need to be checked and provide certificates of their results. In this thesis we aim both to improve their efficiency of and to increase their reliability. Our first contribution is a uniform …

    brazil-ufrn Repository record for Novas técnicas de instanciação e produção de demonstrações para a resolução SMT (opens in a new tab)

  7. Predicting SMT solver performance for software verification

    … (or “goals”) are proved depends as much on the SMT solver as the properties of the goal itself. In this work, we present a method to use syntactic analysis to characterise goals and predict the most appropriate solver via machine-learning techniques. Combining solvers in this way - a …

    maynooth Download PDF for Predicting SMT solver performance for software verification (opens in a new tab)

  8. Nelson Oppen combination as a rewrite theory

    Solving Satisfiability Modulo Theories (SMT) problems in a key piece in automating tedious mathematical proofs. It involves deciding satisfiability of formulas of a decidable theory, which can often be reduced to solving systems of equalities and disequalities, in a variety of theories such as …

    uiuc Repository record for Nelson Oppen combination as a rewrite theory (opens in a new tab)

  9. Towards Microfluidic Design Automation

    … and tool to design microfluidic chips based on SMT solvers. The design of these chips is expressed using the language of partial differential equations (PDEs) and non-linear multi-variate polynomials over the reals. We convert such designs into SMT2 format through appropriate approximations, and …

    waterloo Repository record for Towards Microfluidic Design Automation (opens in a new tab)

  10. Interpolation modulo theories

    … interpolants from the proofs produced by SMT solvers. The overall result is to expand the scope of interpolation to the wealth of theories that are supported by SMT solvers. SMT solvers can prove satisfiability for an ever growing number of theories (and for their combinations; theories …

    freiburg-diss Repository record for Interpolation modulo theories (opens in a new tab)

  11. Astra: Evaluating Translations from Alloy to SMT-LIB

    … of translation options for converting Alloy to SMT-LIB via Alloy's Kodkod interface. Our translations, which are implemented in a library that we call Astra, are based on converting the set and relational operations of Alloy into their equivalent in typed first-order logic (TFOL). We investigate …

    waterloo Repository record for Astra: Evaluating Translations from Alloy to SMT-LIB (opens in a new tab)

  12. Automatically Identifying Soundness and Completeness Errors in Program Analysis Tools

    Program analysis tools (such as static analyzers, SMT solvers, and program verifiers) are extremely important for ensuring the correctness of a large variety of software systems. Very often, these tools are assumed to be sound (i.e., do not miss errors) and complete (i.e., have a low rate of false …

    ethz Repository record for Automatically Identifying Soundness and Completeness Errors in Program Analysis Tools (opens in a new tab)

  13. Symbolic Methods for Transducers and Testing

    … of modern satisfiability modulo theories (SMT) solvers has enabled an increasing variety of symbolic applications that require efficient reasoning in rich logics, such as bit vectors and arrays. SMT solvers remove barriers for employing solver technology in the development of symbolic …

    aalto Repository record for Symbolic Methods for Transducers and Testing (opens in a new tab)

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

    … 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 generate models and proofs, …

    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)

  15. Optimization Modulo Theories with Linear Rational Costs

    … encoded into Satisfiability Modulo Theories (SMT). In the last decade efficient SMT solvers have been developed for several theories of practical interest (e.g., linear arithmetic, arrays, bit-vectors). Surprisingly, little work has been done to extend SMT to deal with optimization problems; …

    trento Repository record for Optimization Modulo Theories with Linear Rational Costs (opens in a new tab)

  16. Programming Language Foundations for Packet Processing

    … automatic decision procedures that rely on SAT/SMT solvers for a compact trusted computing base.

    cornell Repository record for Programming Language Foundations for Packet Processing (opens in a new tab)

Page 1 of 4