Abstract
This chapter targets the teaching of formal methods to Bachelor students who come into contact with formal methods for the first time. We introduce a program logic and a tool based on KeY that has been designed specifically for teaching purposes. We designed a calculus to realize a forward symbolic execution style of reasoning in the same spirit as the JavaDL calculus, but we stay close to the formalism used in a Hoare-style calculus, such that students are not inhibited from using standard text books.
With this tool students can now easily check intermediate steps in their solution, e.g., if they work with a correct loop invariant. Instructors can easily establish the correctness of electronically submitted assignments.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
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
Bubel, R., Hähnle, R. (2016). KeY-Hoare. 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_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-49812-6_17
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)