Quote: confirm that a program implements an intended function by correctness conditions for sequence, alternation, and iteration

Quotation Skeleton

A Correctness Theorem [Linger et al, Structured Programming, 1979] defines how to make … [coded] program functions in terms of correctness conditions to be verified … [Does g followed by h do intended function, f?], case analysis for alternation [When p is true, does g do f ...?], and function composition and case … [Is termination guaranteed, and ... whenever p is false does doing nothing do f?].   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Group: program proving   (10 topics, 310 quotes)
Topic: Cleanroom software development (38 items)