Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure


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.

Rezensionen ( 0 )
Every Friday we give gifts for the best reviews.
The winner is announced on the pages of ReadRate in social networks.
Zitate (0)
Sie können als Erste ein Zitat veröffentlichen.