Advertisement

Theories

  • Peter H. Schmitt
  • Richard Bubel
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10001)

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.

Keywords

Symbolic Execution Integral Type Remainder Function Abstract Data Type Core Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Karlsruhe Institute of TechnologyKarlsruheGermany
  2. 2.Technische Universität DarmstadtDarmstadtGermany

Personalised recommendations