Thumbnail
Access Restriction
Subscribed

Author Reynolds, John C.
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 The use of complete and precise assertions, developed by Floyd and Hoare, is a powerful method for avoiding programming errors. For nontrivial programs, however, such assertions become extremely tedious when written in first-order predicate calculus.In the case of array-manipulating programs, this tedium can be alleviated by several notational and conceptual devices: (1) partition diagrams, which relate intervals of subscript values; (2) pointwise extension, which reduces the need for explicit quantification; and (3) a hierarchy of useful equivalence relations among array values.The effectiveness of these ideas is illustrated by programs for binary search and for merging.
Description Affiliation: Syracuse University, Syracuse, New York (Reynolds, John C.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1983-05-01
Publisher Place New York
Journal ACM SIGPLAN Notices (SIGP)
Volume Number 15
Issue Number 1
Page Count 1
Starting Page 23
Ending Page 23


Open content in new tab

   Open content in new tab
Source: ACM Digital Library