|
|
|
|
| Bachelorprojekt - Softwareteknologi | Project No. 0220: Naive Quick Checking |
| Aktuelle | Tidligere |
Quick Checking is a systematic method for testing the behaviour of programs. It works by randomly creating inputs, running some function on it, and inspecting the results. The random creation of inputs is governed by probability distributions that can be built systematically based on the argument type of the function. The inspection of the result may be with respect to some reference implementation or some specification of the intended behaviour of the function.
The entire development should be packaged in a suitable manner. For inspiration you may take a look at the system for program verification on www.formalmethods.dk/fm4fun/#verification-conditions. In particular, it would be possible to apply quick checking to automate the checking of invariants along the shortest path fragments covered in "Formal Methods - An Appetizer".
| Prerequisites: | 02141 Computer Science Modelling, 02157 Functional Programming |
Supervisor(s) Flemming Nielson
| Sidst opdateret: Nov 27, 2017 af Hans Henrik Løvengreen |