Verification by Testing for Recursive Program Schemes

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Lecture notes in computer science 2000-01, Vol.1817 (Logic-Based Program Synthesis and Transformation, 9th International Workshop, LOPSTR'99, Selected Pa), p.255-272
Hauptverfasser: Le Métayer, Daniel, Nicolas, Valérie-Anne, Ridoux, Olivier
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Computer Science
Computer science
control theory
systems
Exact sciences and technology
Program Learning
Program Scheme
Programming theory
Recursive Call
Separable Function
Software Engineering
Test Data
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/10720327_15