Verification by Testing for Recursive Program Schemes

Abstract : 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.
Type de document :
Article dans une revue
Lecture notes in computer science, springer, 2000, 1817 (Logic-Based Program Synthesis and Transformation, 9th International Workshop, LOPSTR'99, Selected Pa), pp.255-272. 〈10.1007/10720327_15〉
Liste complète des métadonnées

Littérature citée [2 références]  Voir  Masquer  Télécharger

http://hal.univ-brest.fr/hal-00783194
Contributeur : Valérie-Anne Nicolas <>
Soumis le : jeudi 31 janvier 2013 - 16:15:32
Dernière modification le : mercredi 16 mai 2018 - 11:23:14
Document(s) archivé(s) le : mercredi 1 mai 2013 - 03:57:41

Fichier

LMNR00.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Daniel Le Métayer, Valérie-Anne Nicolas, Olivier Ridoux. Verification by Testing for Recursive Program Schemes. Lecture notes in computer science, springer, 2000, 1817 (Logic-Based Program Synthesis and Transformation, 9th International Workshop, LOPSTR'99, Selected Pa), pp.255-272. 〈10.1007/10720327_15〉. 〈hal-00783194〉

Partager

Métriques

Consultations de la notice

511

Téléchargements de fichiers

1102