Verification by Testing for Recursive Program Schemes - Université de Bretagne Occidentale Access content directly
Journal Articles Lecture Notes in Computer Science Year : 2000

Verification by Testing for Recursive Program Schemes


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.
Fichier principal
Vignette du fichier
LMNR00.pdf (208.73 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00783194 , version 1 (31-01-2013)



Daniel Le Métayer, Valérie-Anne Nicolas, Olivier Ridoux. Verification by Testing for Recursive Program Schemes. Lecture Notes in Computer Science, 2000, 1817 (Logic-Based Program Synthesis and Transformation, 9th International Workshop, LOPSTR'99, Selected Pa), pp.255-272. ⟨10.1007/10720327_15⟩. ⟨hal-00783194⟩
316 View
705 Download



Gmail Mastodon Facebook X LinkedIn More