Symbolic Test Case Generation for Primitive Recursive Functions

Achim D. Brucker und Burkhart Wolff

Cover for brucker.ea:symbolic:2005.We present a method for the automatic generation of test cases for HOL formulae containing primitive recursive predicates. These test cases can be used for the animation of specifications as well as for black-box testing of external programs. Our method is two-staged: first, the original formula is partitioned into test cases by transformation into a Horn-clause normal form (HCNF). Second, the test cases are analyzed for instances with constant terms satisfying the premises of the clauses. Particular emphasis is put on the control of test hypotheses and test hierarchies to avoid intractability. We applied our method to several examples, including AVL-trees and the red-black tree implementation in the standard library from SML/NJ.

Schlüsselwörter: symbolic test case generations, black box testing, theorem proving, Isabelle/HOL
Kategorien: ,
Dokumente: (Artikel als PDF Datei)

QR Code for brucker.ea:symbolic:2005.Bitte zitieren sie diesen Artikel wie folgt:
Achim D. Brucker und Burkhart Wolff. Symbolic Test Case Generation for Primitive Recursive Functions. In Formal Approaches to Testing of Software. Lecture Notes in Computer Science (3395), pages 16-32, Springer-Verlag, 2004.
Schlüsselwörter: symbolic test case generations, black box testing, theorem proving, Isabelle/HOL
(Artikel als PDF Datei) (BibTeX) (Endnote) (RIS) (Word) (doi:10.1007/b106767) (Share article on LinkedIn. Share article on CiteULike.)

BibTeX
@InCollection{ brucker.ea:symbolic:2005,
abstract = {We present a method for the automatic generation of test cases for HOL formulae containing primitive recursive predicates. These test cases can be used for the animation of specifications as well as for black-box testing of external programs. Our method is two-staged: first, the original formula is partitioned into test cases by transformation into a Horn-clause normal form (HCNF). Second, the test cases are analyzed for instances with constant terms satisfying the premises of the clauses. Particular emphasis is put on the control of test hypotheses and test hierarchies to avoid intractability. We applied our method to several examples, including AVL-trees and the red-black tree implementation in the standard library from SML/NJ.},
address = {Heidelberg},
author = {Achim D. Brucker and Burkhart Wolff},
booktitle = {Formal Approaches to Testing of Software},
doi = {10.1007/b106767},
editor = {Jens Grabowski and Brian Nielsen},
isbn = {3-540-25109-X},
keywords = {symbolic test case generations, black box testing, theorem proving, Isabelle/HOL},
language = {USenglish},
location = {Linz},
number = {3395},
pages = {16--32},
pdf = {https://www.brucker.ch/bibliography/download/2005/brucker.ea-symbolic-2005.pdf},
project = {CSFMDOS},
publisher = {Springer-Verlag},
series = {Lecture Notes in Computer Science},
title = {Symbolic Test Case Generation for Primitive Recursive Functions},
url = {https://www.brucker.ch/bibliography/abstract/brucker.ea-symbolic-2005},
year = {2004},
}