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

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 meth...

Full description

Saved in:
Bibliographic Details
Published in:Science of computer programming Vol. 107-108; pp. 19 - 40
Main Authors: Gladisch, Christoph, Tyszberowicz, Shmuel
Format: Journal Article
Language:English
Published: Elsevier B.V 01.09.2015
Subjects:
ISSN:0167-6423, 1872-7964
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first