Národní úložiště šedé literatury Nalezeno 1 záznamů.  Hledání trvalo 0.00 vteřin. 
Deciding Logic with Automata
Hečko, Michal ; Holík, Lukáš (oponent) ; Lengál, Ondřej (vedoucí práce)
The work presented in this thesis focuses on deciding quantified linear integer arithmetic using finite automata. We present a novel implementation of the classical automata-based decision procedure supporting the SMT-LIB input format. Our comprehensive presentation of the developed tool focuses on various aspects and design decisions that play a prominent role in the performance of the implementation. We identify the lack of theory-based reasoning as the primary reason for the overall poor performance of the decision procedure and give a range of cheap heuristics that significantly improve its speed. We also give a~novel top-down reformulation of the procedure that allows to perform theory-based reasoning during the construction of automata. We also compare our tool to the state-of-the-art SMT solvers, showing that our prototype implementation is comparative and even superior to the state of the art.

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