Design and Analysis of Algorithms

Design by Proof Rules 177

Key Terms

1. Algebraic manipulations manipulations

in terms of symbols, as distinct from literal

quantities like numbers and strings.

2. Assertion see Key Terms in Chapter 3.

3. Complete pre-condition pre-condition is

a condition or predicate that must always

be true just prior to the execution of some

section of code or before an operation in

a formal specifi cation. A complete pre-

condition specifi es the domain of the

function to be equal to preimage of the

post-condition plus the data environment.

(see preimage below).

4. Correctness proof proof that a particular

algorithm or segment is correct.

5. Data environments ...