Bc. Oliver Bukor

Bachelor's thesis

Fast Approximations of Quantifier Elimination for Q3B

Fast Approximations of Quantifier Elimination for Q3B
Abstract:
Táto práca je na tému zjednodušovania kvantifikovaných výrokov pre problém splnitelnosti formulí v oblasti kvantifikovaných bit-vektorov. Existuje veľa spôsobov na riešenie tohto problému, ale v tejto práci budem implementovať algoritmus na zjednodušovanie, QEL, popísaný v citovanej literatúre, ktorý funguje na báze Grafov Ekvivalencie. Táto práca tiež popisuje problémy na ktoré som narazil počas implementovania …more
Abstract:
This thesis is on the topic of simplifying quantified formulae for Satisfiability Modulo Theories in the realm of quantified bit-vectors. There are many approaches to this problem, but in this thesis, I will be implementing a simplification algorithm called QEL, described in the cited literature, which is based on the use of Equivalence Graphs. This thesis also describes some of the problems I ran …more
 

Keywords

E-Graph SMT formula quantifier expression term function
 
Language used: English
Date on which the thesis was submitted / produced: 23. 5. 2024
Identifier: https://is.muni.cz/th/bicnd/

Thesis defence

  • Date of defence: 24. 6. 2024
  • Supervisor: RNDr. Martin Jonáš, Ph.D.
  • Reader: RNDr. Nikola Beneš, Ph.D.

Citation record

Cite this text

Full text of thesis

Contents of on-line thesis archive
Published in Theses:
  • světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatiky
Složka Reference to the local database directory of the institution