Specifying linked data structures in JML for combining formal verification and testing

Citations of this article
Mendeley users who have this article in their library.


Abstract We show how to write concise and readable specifications of linked data structures that are applicable for both formal deductive verification and testing. A singly linked list and a binary search tree are provided as examples. The main characteristic of the specifications is the use of observer methods, in particular to express reachability of elements in a data structure. The specifications are written in the Java Modeling Language (JML) and do not require extensions of that language. This paper addresses a mixed audience of users and developers in the fields of formal verification, testing, and specification language design. We provide an in-depth description of the proposed specifications and analyze the implications both for verification and testing. Based on this analysis we have developed verification techniques that are implemented in the deductive verification tool KeY and enable fully automatic verification of the linked list example. This techniques are also described in this paper.




Gladisch, C., & Tyszberowicz, S. (2015). Specifying linked data structures in JML for combining formal verification and testing. Science of Computer Programming, 107108, 19–40. https://doi.org/10.1016/j.scico.2015.02.005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free