Formal Verification with KeY: A Tutorial

Buchkapitel

Autor(en):Bernhard Beckert, Reiner Hähnle, Martin Hentschel und Peter H. Schmitt
In:Deductive Software Verification - The KeY Book: From Theory to Practice
Verleger:Springer
Reihe:LNCS 10001
Kapitel:16
Jahr:2016
Seiten:541-570
URL:http://dx.doi.org/10.1007/978-3-319-49812-6_16
DOI:10.1007/978-3-319-49812-6_16

Abstract

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.

BibTeX

@incollection{BeckertHaehnleHentschel2016,
  author       = {Bernhard Beckert and Reiner H\"ahnle and Martin
                  Hentschel and Peter H. Schmitt},
  title        = {Formal Verification with {\KeY}: {A} Tutorial},
  booktitle    = {Deductive Software Verification - The KeY Book: From Theory to
                  Practice},
  publisher    = {Springer},
  series       = {LNCS 10001},
  pages        = {541--570},
  chapter      = {16},
  url          = {http://dx.doi.org/10.1007/978-3-319-49812-6_16},
  doi          = {10.1007/978-3-319-49812-6_16},
  year         = {2016},
  month        = dec,
  abstract     = {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.}
}