Verification by Testing for Recursive Program Schemes

Daniel Le Métayer (1) , Valérie-Anne Nicolas (2) , Olivier Ridoux (3)

1 LICIT - Legal Issues in Communication and Information Technologies
2 LISYC - Laboratoire d'Informatique des Systèmes Complexes
3 LIS - Logical Information Systems

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.

Mots clés: Software engineering; program checking; program structural testing; program analysis; automatic generation of test data sets; program patterns

Domaines: Génie logiciel [cs.SE]

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⟩