Lecture overview -- Keyboard shortcut: 'u'  Previous page: Testability -- Keyboard shortcut: 'p'  Next page: From Program Test to Program Proof -- Keyboard shortcut: 'n'  Lecture notes - all slides and notes together  slide -- Keyboard shortcut: 't'  Textbook -- Keyboard shortcut: 'v'  Help page about these notes  Alphabetic index  Course home  Page 5 : 35
Object-oriented Programming in C#
Test of Object-oriented Programs
Test Utopia

In the ideal world, all possible paths through a programs should be tested

A total test is a combinatorial complete test of all possible paths through a program

  • Total test

    • All possible combinatoric combinations of commands and expressions should be executed relative to the control structures in a program

    • Even in small programs, the number of paths in a total test is very large

    • In many programs, there is no upper limit on the number of paths in a total test

In the real world, we need to select a subset of the paths in a total test which most likely will reveal possible program errors