Verification of Java Programs with Generics

  • Authors:

  • Kurt Stenzel;Holger Grandy;Wolfgang Reif

  • Affiliations:

  • Lehrstuhl für Softwaretechnik und Programmiersprachen Institut für Informatik, Universität Augsburg, Augsburg, Germany 86135;Lehrstuhl für Softwaretechnik und Programmiersprachen Institut für Informatik, Universität Augsburg, Augsburg, Germany 86135;Lehrstuhl für Softwaretechnik und Programmiersprachen Institut für Informatik, Universität Augsburg, Augsburg, Germany 86135

  • Venue:
  • AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

Several proof systems allow the formal verification of Java programs, and a specification language was specifically designed for Java. However, none of these systems support generics that were introduced in Java 5. Generics are very important and useful when the collection framework (lists, sets, hash tables etc.) is used. Though they are mainly dealt with at compile time, they have some effect on the run-time behavior of a Java program. Most notably, heap pollutioncan cause exceptions. A verification system for Java must incorporate these effects. In this paper we describe what effects can occur at run time, and how they are handled in the KIV system [18] [2]. To the authors knowledge, this makes KIV the first verification system to support Java's generics.