An example of hierarchical design and proof

Authors:
Jay M. Spitzen;Karl N. Levitt;Lawrence Robinson
Affiliations:
SRI International, Menlo Park, CA;SRI International, Menlo Park, CA;SRI International, Menlo Park, CA
Venue:
Communications of the ACM
Year:
1978

Citing 14
Cited 8

Proving Properties of Complex Data Structures

Journal of the ACM (JACM)
Proof techniques for hierarchically structured programs

Communications of the ACM
Abstract data types and the development of data structures

Communications of the ACM
The treatment of data types in EL1

Communications of the ACM
A technique for software module specification with examples

Communications of the ACM
On the criteria to be used in decomposing systems into modules

Communications of the ACM
Protection in programming languages

Communications of the ACM
Inductive methods for proving properties of programs

Communications of the ACM
Programming with abstract data types

Proceedings of the ACM SIGPLAN symposium on Very high level languages
Programming by semantic refinement

Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems
On attaining reliable software for a secure operating system

Proceedings of the international conference on Reliable software
Provable programming

Proceedings of the international conference on Reliable software
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual
Structured programming

Structured programming

Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS

IEEE Transactions on Software Engineering
Persistent lists with catenation via recursive slow-down

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Purely functional, real-time deques with catenation

Journal of the ACM (JACM)
Proof techniques for hierarchically structured programs

Communications of the ACM
Selective memoization

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A system for program refinement

ICSE '79 Proceedings of the 4th international conference on Software engineering
Educator's view of structured concepts

ACM '80 Proceedings of the ACM 1980 annual conference
Hierarchical design and efficient implementation in SETL: a case study

ACM SIGPLAN Notices

Quantified Score

Hi-index	48.23

Visualization

Abstract

Hierarchical programming is being increasingly recognized as helpful in the construction of large programs. Users of hierarchical techniques claim or predict substantial increases in productivity and in the reliability of the programs produced. In this paper we describe a formal method for hierarchical program specification, implementation, and proof. We apply this method to a significant list processing problem and also discuss a number of extensions to current programming languages that ease hierarchical program design and proof.