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 26 for “"SMT Solving"”.
-
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 …
-
Program Verification Using Polynomials Over Modular Arithmetic
… and focus. In Satisfiability Modulo Theories (SMT) solving the focus is on deciding the satisfiability of formulae over predicates (constraints) drawn from a background theory. If a SMT formula encodes the existence of a problematic path through a program, then a model of the formula will …
-
Local Theories and Efficient Partial Quantifier Elimination
… automated reasoning tasks, including quantified SMT solving, exists/forall solving, program synthesis, model checking, and constrained Horn clause (CHC) solving. Complete quantifier elimination, however, is computationally intractable for many theories. The recent algorithm QEL shows a promising …
-
Enhancing Variation-aware Analog Circuits Sizing
… 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 highest yield rate in the …
-
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 …
-
Automated concurrency bug finding using partial-orders
… 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 bounded model checking or symbolic execution, are well known, this thesis gives …
-
Leveraging machine learning for enhancing code performance and programming productivity
… languages by combining machine learning and SMT solving without requiring programmers to provide any type annotation.
-
Exposing and addressing machine learning brittleness through constraint solving
… and prone to overfitting; however, constraint solving can be used to systematically expose, quantify, and address this brittleness.</p><p>This dissertation first establishes that widely-used implementations of popular ML algorithms are nondeterministic (producing different outputs on the same …
-
Efficient Automated Security Analysis of Complex Authorization Policies
… based on Satisfiability Modulo Theories (SMT) solving (for expressiveness) and carefully tuned heuristics (for scalability). Particularly, we present the implementation of the techniques on the automated analysis of ARBAC and ATRBAC policies and discuss extensive experiments that show that …
-
Runtime Verification of Distributed Systems
… distributed runtime verification problem to an SMT problem.• We introduce a progression-based formula rewriting scheme for monitoring metric temporal logic (MTL) specifications which employ SMT-solving techniques with probabilistic guarantees. • We introduce an (offline) SMT-based monitor …
-
Solvers for Type Recovery and Decompilation of Binaries
… how solvers for Satisfiability Modulo Theories (SMT) and Constraint Handling Rules (CHR) can be leveraged to solve the type reconstruction problem. In particular, an approach based on a new SMT theory of rational tree constraints is developed and evaluated. The resulting solver, based on the …
-
Formal Verification and In-Situ Test of Analog and Mixed-Signal Circuits
… is proposed that incorporates nonlinear SMT solving techniques and simulation exploration to efficiently verify the dynamic properties of AMS designs. A powerful Bayesian inference based technique is applied to dynamically tradeoff between the costs of simulation and nonlinear SMT. The …
-
Neural network based method for solving SMT problems
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms
-
Computational Methods for Combinatorial and Number Theoretic Problems
… tools from the symbolic computation and SAT/SMT solving communities to execute a search more efficiently than would be the case using the techniques from either community in isolation. To this end, we developed the tool MathCheck2, which combines the sophisticated domain-specific knowledge of …
-
SAT-based String Solving
String constraint solving is the task of checking whether first-order formulas over strings are satisfiable.Because strings are a core data type in nearly every programming language, reliable and efficient solvers are essential in many areas of formal verification. This thesis studies methods for …
-
Addressing the Verification Challenge of Agile Hardware Methodologies
… 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 challenges in instance composition. …
-
Automated Synthesis of Timed and Distributed Fault-Tolerant Systems
… of the system. Our proposed method is based on SMT-solving, where the desired specification of the system is formulated as SMT constraints. We used the Alloy solver to implement our method, and successfully synthesized some of the well-known self-stabilizing algorithms. We extend our method to …
-
String constraint solving pro automatickém generování testů pro simulinkové modely
… vektorům. Navrhujeme způsob, jak plně využít SMT řešič Z3-Noodler pro automatické generování testovacích vektorů na základě požadavků pro Simulinkové modely, což umožňuje efektivní zpracování datového typu řetězec. Naše metodologie zahrnuje zjednodušenou formalizaci sémantiky modelů Simulinku, …
-
Symbolic reachability analysis for rewrite theories
This dissertation presents a significant step forward in automatic and semi-automatic reasoning for reachability properties of rewriting logic specifications, a major research goal in the current state of the art. In particular, this work develops deductive techniques for reasoning symbolically …
-
Analýza politik pro řízení přístupu
Politiky pro řízení přístupu jsou kritickou součástí moderních softwarových služeb, které určují, jaké akce jsou za jakých podmínek povoleny. S rostoucí složitostí a postupným vývojem pravidel, které udávají, je stále obtížnější zajistit jejich správnost. Tradiční testování je pro tento účel často …
Page 1 of 2