Thumbnail
Access Restriction
Subscribed

Author Wadkins, J. R. Jefferson
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Abstract Three fundamental principles of static reasoning used to write imperative program code with built-in proof of its correctness are presented and explained in operational terms. It is argued that, although the traditional use of formal logic in the Hoare-Dijkstra-Gries methodology is probably the most efficient way to write code with built-in proofs of correctness, the ideas underlying that methodology are much simpler than commonly perceived through the veil of formal logic and axiomatic semantics. Examples are given illustrating principles and techniques for deriving code from specifications, using the informal reasoning of the mathematician without either the terminology or notation of formal logic.
Description Affiliation: Educational Testing Service (Wadkins, J. R. Jefferson)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1978-02-01
Publisher Place New York
Journal ACM SIGCSE Bulletin (SGCS)
Volume Number 27
Issue Number 1
Page Count 5
Starting Page 307
Ending Page 311


Open content in new tab

   Open content in new tab
Source: ACM Digital Library