Chapter

Deductive Software Verification – The KeY Book

Volume 10001 of the series Lecture Notes in Computer Science pp 149-166

Date:

Theories

  • Peter H. SchmittAffiliated withKarlsruhe Institute of Technology Email author 
  • , Richard BubelAffiliated withTechnische Universität Darmstadt

* Final gross prices may vary according to local VAT.

Get Access

Abstract

For a program verification tool to be useful it needs to be able to reason about at least the most important data types, both abstract data types, as well as those built into the programming language. This chapter presents how the theories of some data structures are realized in KeY's logic: finite sequences, Java strings, and Java integer data types.