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 598 for “"SMT"”.
-
SMT solving, interpolation, and quantifiers
… in the area of satisfiability modulo theories (SMT). SMT solving has a wide range of applications, e.g., in software verification, test generation, or program synthesis. Besides deciding the satisfiability of quantifier-free or quantified formulas, tasks for SMT solvers include generating models …
-
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 …
-
Hill-Climbing SMT Processor Resource Distribution
The key to high performance in SMT processors lies in optimizing the shared resources distribution among simultaneously executing threads. Existing resource distribution techniques optimize performance only indirectly. They infer potential performance bottlenecks by observing indicators, like …
-
SMT-based Verification of Parameterized Systems
SMT-based verification analyzes reachability for transition systems represented by SMT formulae. Depending on the theories and the kinds of systems considered, various approaches have been proposed. Together, they form the Verification Modulo Theory (VMT) framework. This thesis delves into …
-
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 …
-
AlphaSMT: A Reinforcement Learning Guided SMT Solver
Satisfiability Modulo Theories (SMT) solvers are programs that decide whether a first-order logic formula is satisfiable. Over the last two decades, these solvers have become central to many methods and tools in fields as diverse as software engineering, verification, security, and Artificial …
-
Contention-Aware Scheduling for SMT Multicore Processors
… follows with simultaneous multithreading (SMT) multicores supporting up to two threads per core (Intel Xeon E5645), and goes to the most highly threaded per-core processor that has ever been built (IBM POWER8). The dissertation analyzes the main contention points of each experimental …
-
Mitigating the problems of SMT using EBMT
Statistical Machine Translation (SMT) typically has difficulties with less-resourced languages even with homogeneous data. In this thesis we address the application of Example-Based Machine Translation (EBMT) methods to overcome some of these difficulties. We adopt three alternative approaches to …
-
SMT-BASED VERIFICATION OF BUILDING MANAGEMENT SYSTEMS
… 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 research started with a …
-
Efficient SMT-based verification of software programs
… modulo theories-based model checking</i> (SMT-based MC) of software where the model is too large or complicated to analyse; real-world software once represented as a mathematical model faces the danger of the state-explosion problem where the size of the model grows exponentially, thus …
-
Kontrola osazených DPS s SMT komparační metodou
V prvej časti práca pojednáva o AOI systémoch, typoch systémov, ich využití a dôležitosti v priemyselnej výrobe. Druhá časť je venovaná realizácii jednoduchého komparačného systému. Bol odskúšaný vplyv okolitého svetla na záznam fotografie DPS a taktiež bolo použité umelé osvetlenie. Boli naznačené …
-
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 …
-
An Effective SMT Engine for Formal Verification
… exploitation of Satisfiability Modulo Theories (SMT) solvers. In this thesis, we present MathSAT, a modern, efficient SMT solver that provides several important functionalities, and can be used as a workhorse engine in formal verification. We develop novel algorithms for two functionalities which …
-
An Effective SMT Engine for Formal Verification
… exploitation of Satisfiability Modulo Theories (SMT) solvers. In this thesis, we present MathSAT, a modern, efficient SMT solver that provides several important functionalities, and can be used as a workhorse engine in formal verification. We develop novel algorithms for two functionalities which …
-
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 …
Page 1 of 30