1987•Science of Computer ProgrammingOpen access

A theoretical basis for stepwise refinement and the programming calculus

Joseph M. Morris

Open full text 310 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 310 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Computer science, Programming language, Dijkstra's algorithm, Refinement calculus, Refinement, Statement (logic), Sequence (biology), Monotonic function

Back to paper search Browse research topics Original source

A theoretical basis for stepwise refinement and the programming calculus — Research Paper | ScholarLens