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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this chapter
Cite this chapter
Beckert, B., Hähnle, R., Hentschel, M., Schmitt, P.H. (2016). Formal Verification with KeY: A Tutorial. In: Ahrendt, W., Beckert, B., Bubel, R., Hähnle, R., Schmitt, P., Ulbrich, M. (eds) Deductive Software Verification – The KeY Book. Lecture Notes in Computer Science(), vol 10001. Springer, Cham. https://doi.org/10.1007/978-3-319-49812-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-49812-6_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49811-9
Online ISBN: 978-3-319-49812-6
eBook Packages: Computer ScienceComputer Science (R0)