Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure - Proof Engines for the Analysis of Hybrid Discrete-Continuous Systems

Christian Herde deals with the development of decision procedures as needed, e.g., for automatic verification of hardware and software systems via bounded model checking. He provides methods for efficiently solving formulae comprising complex Boolean combinations of linear, polynomial, and transcendental arithmetic constraints, involving thousands of Boolean-, integer-, and real-valued variables.

Dr. Christian Herde completed his doctoral thesis under the supervision of Prof. Dr. Martin Fränzle at the Department of Computing Science at the University of Oldenburg, Germany.