Mattias Ulbrich

TL;DR: This book is the definitive guide to KeY that lets you explore the full potential of deductive software verification in practice and contains the complete theory behind KeY for active researchers who want to understand it in depth or use it in their own work.

TL;DR: In this article, the equivalence of two related imperative integer programs is reduced to Horn constraints over uninterpreted predicates, and state-of-the-art SMT solvers are used to solve the constraints.

TL;DR: The authors, the organizers and participants, report the experiences from the 1st Verified Software Competition, held in August 2010 in Edinburgh at the VSTTE 2010 conference.

TL;DR: It is shown that deductive technology that has been developed for full functional verification can be used as a basis and framework for other purposes than pure functional verification.

TL;DR: This paper reports on the experiences with the program verification competition held during the FoVeOOS conference in October 2011 and the three different challenges that were posed and the solutions developed by the teams.