Master Theses / Diplomarbeiten

This page lists master theses conducted at FMV.

2015

Katalin Fazekas. EUF-Proofs for SMT4J. Master Thesis, Computer Science, Johannes Kepler University, Linz, 2015.

2014

Christian Reisenberger. PBoolector: A Parallel SMT Solver for QF_BV by Combining Bit-Blasting with Look-Ahead. Master Thesis, Computer Science, Johannes Kepler University, Linz, 2014.

Harald Seltner. Extracting Hardware Circuits from CNF Formulas. Master Thesis, Computer Science, Johannes Kepler University, Linz, 2014.

2013

Robert Aistleitner. An Evaluation of Bit-Parallelization applied to Failed Literal Probing. Masterarbeit, Informatik, Johannes Kepler University, Linz, 2013.

2012

Aina Niemetz. Extracting and Checking Q-Resolution Proofs from a State-Of-The-Art QBF-Solver. Masterarbeit, Informatik, Johannes Kepler University, Linz, 2012.

Mathias Preiner. Extracting and Validating Skolem/Herbrand Function-Based QBF Certificates. Masterarbeit, Informatik, Johannes Kepler University, Linz, 2012.

2009

J├╝rgen Holzleitner. Using feedback to improve black box fuzz testing of SAT solvers. Masterarbeit, Informatik, Johannes Kepler University, Linz, 2009.

Jakob Zwirchmayr, SmacC: A Satisfiability Modulo Theories Memory-Model and Assertion Checker for C. Masterarbeit, Informatik, Johannes Kepler University, Linz, 2009.

Stefan Riha. Memory leak detection and diagnosis in .Net and Java applications using run-time memory dumps. Masterarbeit, Informatik, Johannes Kepler University, Linz, 2009.

2008

Andreas Vida. Random Test Case Generation and Delta Debugging for BitVector Logic with Arrays. Masterarbeit, Informatik, Johannes Kepler University, Linz, 2009.

2007

Florian Lonsing. An Expansion-based QBF Solver For Negation Normal Form. Magisterarbeit, Informatik, Johannes Kepler University, Linz, 2007.

2006

Robert Brummayer. C32SAT: A satisfiability checker for C expressions. Magisterarbeit, Informatik, Johannes Kepler University, Linz, 2006.