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.
KeywordsSymbolic Execution Integral Type Remainder Function Abstract Data Type Core Theory
Unable to display preview. Download preview PDF.