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 70 for “"SMT solver"”.
-
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 …
-
Predicting SMT solver performance for software verification
… which relies on a single tightly-integrated solver. In common with other systems, however, the degree to which proof obligations (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 …
-
A Constraint and Sampling-Based Approach to Integrated Task and Motion Planning
… by providing the actions' known parameters. An SMT solver, then, discovers values for the unkown parameters that satisfies constraints requiring the task plan to achieve the goal. The SMT solver utilizes an annotated Probabilistic Roadmap (PRM) to query for motion planning information. A …
-
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 …
-
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 …
-
Rozšířené regulární výrazy pro Z3-Noodler
… řetězcových rovnic a omezení vhodných pro SMT solver. Navržený model byl implementován jako nativní C++ modul pro SMT solver Z3-Noodler. Vyhodnocení na rozsáhlé sadě reálných instancí potvrdilo správnost překladu. V přímém srovnání se solverem Black Ostrich dosáhl Z3-Noodler výrazně nižší …
-
Partitioning Strategies to Enhance Symbolic Execution
… the number of Satisfiability Modulo Theories (SMT) solver calls for reaching a target is still large, resulting in longer execution times for programs containing many paths. In this paper, we present two partitioning strategies in order to mitigate this problem, consequently reducing …
-
Data-Driven Methods for System Identification and Lyapunov Stability
… networks and a satisfiability modulo theories (SMT) solver. The first neural network is responsible for learning the unknown dynamics. The second neural network aims to identify a valid Lyapunov function and a provably stabilizing nonlinear controller. The SMT solver then verifies that the …
-
Generická syntéza invariantů v programu založená na šablonách
… je návrh a implementácia generického strategy solveru pre nástroj 2LS. 2LS je analyzátor na statickú verifikáciu programov napísaných v jazyku C. Verifikovaný program je za využita abstraktnej interpretácie analyzovaný SMT solverom. Prevod z ab- straktného stavu programu do logickej formule, s …
-
Nástroj pro vyhledávání testovacích cest
… GCC plugin pre získanie grafu toku riadenia a SMT solver pre zistenie ohodnotenia cesty. Komunikácia medzi modulmi prebieha pomocou JSON formátu, ktorý sa využíva aj pre ukladanie nájdených ciest medzi jednotlivými behmi nástroja.
-
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 …
-
Efficient Solving of the Satisfiability Modulo Bit-Vectors Problem and Some Extensions to SMT
… of fixed-width bit-vectors, and how such a solver can be used in a real-world application. We will also introduce some extensions of the basic decision procedure allowing for optimisation, and compact representation of constraints in a SMT solver, showing how these can be succinctly and …
-
Scalable algorithms for software based self test using formal methods
… on a Bit-Vector Satisfiability Module Theories (SMT) solver. From the counter-example to the property we can extract a sequence of instructions that activates the gate level fault and propagates the fault effect to one of the observable points in the design. Other than the user supplying …
-
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; …
-
ReBAC2015: Interoperability of Relationship- and Role-Based Access Control
… of which has an algorithmic structure akin to an SMT solver) along with optimization techniques.
-
Supported Programming for Beginning Developers
… a system for test case generation which uses an SMT solver to generate inputs to reach specified lines in a function, and asks the user what the expected outputs would be for those inputs. The resulting test cases check the correctness of the output, rather than merely ensuring the code does not …
-
A Constraint-Based Approach to Reactive Task and Motion Planning
… we employ Satisfiability Modulo Theories (SMT) solvers using a new extension of proof rules for Temporal Property Verification. For efficient policy search, we apply domain-specific heuristics to generalize verification failures. Furthermore, the SMT solver enables quantitative …
-
Syntéza strategií pro rodiny MDP s využitím SMT nástrojů pro robustní plánování
… pro hledání robustních strategií využívající SMT solver — do stávajícího rámce pro syntézu stromů strategií. Zabýváme se dvěma problémy. Zaprvé, (1) používáme SMPMC pro nalezení robustních strategií jako alternativu k původnímu přístupu. Zadruhé, (2) využíváme schopnosti SMPMC reprezentovat …
-
Zlepšení přesnosti formální analýzy programů v nástroji 2LS
… programů napsaných v jazyce C, který využívá SMT solver a abstraktní interpretaci k automatickému odvození invariant. V případě kdy 2LS nedokáže rozhodnout zda je program správný, navrhované řešení analyzuje invarianty vypočítané v různých abstraktních doménách, a identifikuje takové části …
Page 1 of 4