Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [2 references]  Display  Hide  Download

https://hal.univ-brest.fr/hal-00783194
Contributor : Valérie-Anne Nicolas <>
Submitted on : Thursday, January 31, 2013 - 4:15:32 PM
Last modification on : Tuesday, March 10, 2020 - 10:10:03 AM
Document(s) archivé(s) le : Wednesday, May 1, 2013 - 3:57:41 AM

File

LMNR00.pdf
Files produced by the author(s)

Identifiers

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⟩

Share

Metrics

Record views

633

Files downloads

1314