Data structures and program correctness: Bridging the gap

Authors:
Lawrence Yelowitz;Arthur G. Duncan
Affiliations:
Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, U.S.A.;Department of Mathematical Sciences, Indiana-Purdue University at Indianapolis, Indianapolis, IN 46205, U.S.A.
Venue:
Computer Languages
Year:
1978

Citing 3
Cited 0

Data Structures: Theory and Practice

Data Structures: Theory and Practice
Specification techniques for data abstractions

Proceedings of the international conference on Reliable software
Verifying programs which operate on data structures

Proceedings of the international conference on Reliable software

Quantified Score

Hi-index	0.00

Visualization

Abstract

An assertion language for data structures is presented, leading to the following results: formal semantics of operations on data structures are given in terms of the weakest precondition formula for assignment statements; input/output specifications for data-structure manipulating algorithms can be stated with precision; there is a clear relationship between the output specification and intermediate assertions; and knowledge about standard types of data structures can be schematized. These ideas are illustrated on an algorithm to reverse the arcs on a one-way linked list, and on a threaded tree example.