Deductive Software Verification – The KeY Book

Volume 10001 of the series Lecture Notes in Computer Science pp 541-570


Formal Verification with KeY: A Tutorial

  • Bernhard BeckertAffiliated withKarlsruhe Institute of Technology Email author 
  • , Reiner HähnleAffiliated withTechnische Universität Darmstadt
  • , Martin HentschelAffiliated withTechnische Universität Darmstadt
  • , Peter H. SchmittAffiliated withKarlsruhe Institute of Technology

* Final gross prices may vary according to local VAT.

Get Access


This chapter gives a systematic tutorial introduction on how to perform formal program verification with the KeY system. It illustrates a number of complications and pitfalls, notably programs with loops, and shows how to deal with them. After working through this tutorial, you should be able to formally verify with KeY the correctness of simple Java programs, such as standard sorting algorithms, gcd, etc.