Národní úložiště šedé literatury Nalezeno 2 záznamů.  Hledání trvalo 0.01 vteřin. 
Heuristics in String Solving
Řezáč, Michal ; Havlena, Vojtěch (oponent) ; Síč, Juraj (vedoucí práce)
This work aims on identifying heuristics and strategies used in modern string solvers and evaluating their impact on the effectiveness of the solving. In particular, two solvers -- cvc5 and Z3 -- are examined. The thesis describes the techniques used by SMT solvers and the strategies implemented by string solvers. The evaluation of the effectiveness of the heuristics was performed by disabling them directly in the code of the tools mentioned and then evaluating the impact on solving the sets of standard benchmarks. The result of this work is summary of a set of specific heuristics and a description of the structure of the tools cvc5 and Z3. The measurements failed to demonstrate the actual impact of the heuristics identified and described.
Length Constraints in String Solving
Hranička, Jan ; Lengál, Ondřej (oponent) ; Havlena, Vojtěch (vedoucí práce)
String solving is currently a fundamental part of formal verification with numerous scientific and business applications. In this thesis, a new decision procedure is proposed with the intend to extend a state-of-the-art string solver Z3-Noodler. This decision procedure is based on symbolically aligning string variables in word equations by generating constraints on their lengths. When experimenting with this procedure on standardized benchmarks, its integration with Z3-Noodler resulted in the reduction of 32 timeouts and in some instances more than 50x time improvement. These benefits make it possible for this decision procedure to be included in a future release of the mentioned solver.

Chcete být upozorněni, pokud se objeví nové záznamy odpovídající tomuto dotazu?
Přihlásit se k odběru RSS.