The Karlsruhe Java Verification Suite

Hash maps are a common and important data structure in efficient algorithm implementations. Despite their wide-spread use, real-world implementations are not regularly verified. In this paper, we present the first case study of the IdentityHashMap class in the Java JDK. We specified its behavior using the Java Modeling Language (JML) and proved correctness for the main insertion and lookup methods with KeY, a semi-interactive theorem prover for JML-annotated Java programs. Furthermore, we report how unit testing and bounded model checking can be leveraged to find a suitable specification more quickly. We also investigated where the bottlenecks in the verification of hash maps lie for KeY by comparing required automatic proof effort for different hash map implementations and draw conclusions for the choice of hash map implementations regarding their verifiability.

show abstract

The Karlsruhe Java Verification Suite

Cited by 3 publications

References 21 publications

Scalable and Precise Refinement Types for Imperative Languages

Scalable and Precise Refinement Types for Imperative Languages

Contract-LIB: A Proposal for a Common Interchange Format for Software System Specification

Formal Specification and Verification of JDK’s Identity Hash Map Implementation

Contact Info

Product

Resources

About