CISC 121 Lecture Notes - Lecture 13: Fuzz Testing, Equivalence Partitioning

• School: Queen's University
• Department: Computing
• Course: CISC 121
• Professor: Wendy L Powley

Document Summary

Program correctness: proving that implementations of algorithms meet the specifications set out for them. Program testing: often opted for instead of proving program correctness, as that is time-consuming, requires lots of math, and thus can be expensive. It is probable that for small programs, suitees of tests could be devised that cover all possible input values and all combos of input values. If such a program responded properly to all cases, you"d have a brute- force proof of the correctness of the program (not elegant). However, many programs lack finite possibilities, thus you must test! Some even haave quality assurance departments dedicated to testing, while others rely on model development where programmers do most testing as part of code generation. Program specification: concise description of what a program is supposed to accomplish. In rough terms, an algorithm describes a way in which a program specification may be achieved.