Accession Number:

ADA021574

Title:

An Example of Hierarchical Design and Proof.

Descriptive Note:

Technical rept.,

Corporate Author:

STANFORD RESEARCH INST MENLO PARK CALIF

Personal Author(s):

• Spitzen,Jay M.
• Levitt,Karl N.
• Robinson,Lawrence

Report Date:

1976-03-01

Pagination or Media Count:

28.0

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 the authors describe a formal method for hierarchical program specification, implementation, and proof. The authors 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.

Descriptors:

• *COMPUTER PROGRAMMING
• PROGRAMMING LANGUAGES
• MATHEMATICAL LOGIC

Subject Categories:

• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE