Verification by Testing for Recursive Program Schemes
Résumé
In this paper, we explore the testing verification relationship with the objective of mechanizing the generation of test data. We consider program classes defined as recursive program schemes and we show that complete and finite test data sets can be associated with such classes, that is to say that these test data sets allow us to distinguish every two different functions in these schemes. This technique is applied to the verification of simple properties of programs.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...