Exercise 1 Illustrate the methods for Data Validation.
Exercise 2 Illustrate the methods of Hardware Testing
Exercise 3
1. How can quality and efficiency for programs be assessed?
2. Explain briefly the black-box approach to the specification of a system and its functional definition.
3. Give a (new) simple example of pre-, post-condition and function specification.
4. When can a program be said correct with respect to a pre- and post- condition specification?
5. When can a program be said partially correct?
6. What is the weakest-precondition of a program?
7. Define total program correctness by weakest pre-condition.
Exercise 4 Read and summarise Brian Cantwell Smith's view on the limits of computer correctness.
Exercise 5 Describe the meanings of the term program illustrated by Fetzer in ‘Program Verification: The Very idea' and illustrate their associated notion of verifiability. Provide a basic explanation.