Programming without refinement

Document Type

Conference Proceeding

Publication Date

10-24-2018

Abstract

To derive a program for a given specification R means to find an artifact P that satisfies two conditions: P is executable in some programming language; and P is correct with respect to R. Refinement-based program derivation achieves this goal in a stepwise manner by enhancing executability while preserving correctness until we achieve complete executability. In this paper, we argue that it is possible to invert these properties, and to derive a program by enhancing correctness while preserving executability (proceeding from one executable program to another) until we achieve absolute correctness. Of course, this latter process is possible only if we know how to enhance correctness.

Identifier

85060060122 (Scopus)

Publication Title

Electronic Proceedings in Theoretical Computer Science Eptcs

External Full Text Location

https://doi.org/10.4204/EPTCS.282.4

ISSN

20752180

First Page

39

Last Page

52

Volume

282

This document is currently not available here.

Share

COinS