Symbolic Test Case Generation for Primitive Recursive Functions

by Achim D. Brucker and Burkhart Wolff

Cover for brucker.ea:symbolic:2004.We present a method for the automatic generation of test cases for HOL formulae containing primitive recursive predicates. These test cases may 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 (CNF). Second, the test cases are analyzed for ground instances satisfying the premises of the clauses. Particular emphasis is put on the control of test hypothesis' and test hierarchies to avoid intractability.

We applied our method to several examples, including AVL-trees and the red-black implementation in the standard library from SML/NJ.

Keywords: symbolic test case generations, black box testing, theorem proving, Isabelle/HOL
Categories: ,
Documents: (full text as PDF file)

QR Code for brucker.ea:symbolic:2004.Please cite this article as follows:
Achim D. Brucker and Burkhart Wolff. Symbolic Test Case Generation for Primitive Recursive Functions. ETH Zurich, Technical Report 449, 2004.
Keywords: symbolic test case generations, black box testing, theorem proving, Isabelle/HOL
(full text as PDF file) (BibTeX) (Endnote) (RIS) (Word) (Share article on LinkedIn. Share article on CiteULike. )

BibTeX
@TechReport{ brucker.ea:symbolic:2004,
abstract = {We present a method for the automatic generation of test cases for HOL formulae containing primitive recursive predicates. These test cases may 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 (CNF). Second, the test cases are analyzed for ground instances satisfying the premises of the clauses. Particular emphasis is put on the control of test hypothesis' and test hierarchies to avoid intractability.\\\\We applied our method to several examples, including AVL-trees and the red-black implementation in the standard library from SML/NJ.},
author = {Achim D. Brucker and Burkhart Wolff},
institution = {ETH Zurich},
keywords = {symbolic test case generations, black box testing, theorem proving, Isabelle/HOL},
language = {USenglish},
month = {jun},
num_pages = {21},
number = {449},
pdf = {https://www.brucker.ch/bibliography/download/2004/brucker.ea-symbolic-2004.pdf},
title = {Symbolic Test Case Generation for Primitive Recursive Functions},
url = {https://www.brucker.ch/bibliography/abstract/brucker.ea-symbolic-2004},
year = {2004},
}