On Theorem Prover-based Testing

by Achim D. Brucker and Burkhart Wolff

Cover for brucker.ea:theorem-prover:2012.HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. As such, HOL-TestGen allows for an integrated workflow supporting interactive theorem proving, test case generation, and test data generation.

The HOL-TestGen method is two-staged: first, the original formula is partitioned into test cases by transformation into a normal form called test theorem. Second, the test cases are analyzed for ground instances (the test data) satisfying the constraints of the test cases. Particular emphasis is put on the control of explicit test-hypotheses which can be proven over concrete programs.

Due to the generality of the underlying framework, our system can be used for black-box unit, sequence, reactive sequence and white-box test scenarios. Although based on particularly clean theoretical foundations, the system can be applied for substantial case-studies.

Keywords: test case generation, domain partitioning, test sequence, theorem proving, HOL-TestGen
Categories: ,
Documents: (full text as PDF file)

QR Code for brucker.ea:theorem-prover:2012.Please cite this article as follows:
Achim D. Brucker and Burkhart Wolff. On Theorem Prover-based Testing. In Formal Aspects of Computing, 25 (5), pages 683-721, 2013.
Keywords: test case generation, domain partitioning, test sequence, theorem proving, HOL-TestGen
(full text as PDF file) (BibTeX) (Endnote) (RIS) (Word) (doi:10.1007/s00165-012-0222-y) (Share article on LinkedIn. Share article on CiteULike. )

BibTeX
@Article{ brucker.ea:theorem-prover:2012,
abstract = {HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. As such, HOL-TestGen allows for an integrated workflow supporting interactive theorem proving, test case generation, and test data generation.\\\\The HOL-TestGen method is two-staged: first, the original formula is partitioned into test cases by transformation into a normal form called test theorem. Second, the test cases are analyzed for ground instances (the test data) satisfying the constraints of the test cases. Particular emphasis is put on the control of explicit test-hypotheses which can be proven over concrete programs.\\\\Due to the generality of the underlying framework, our system can be used for black-box unit, sequence, reactive sequence and white-box test scenarios. Although based on particularly clean theoretical foundations, the system can be applied for substantial case-studies.},
address = {Heidelberg},
author = {Achim D. Brucker and Burkhart Wolff},
doi = {10.1007/s00165-012-0222-y},
issn = {0934-5043},
journal = {Formal Aspects of Computing},
keywords = {test case generation, domain partitioning, test sequence, theorem proving, HOL-TestGen},
language = {USenglish},
number = {5},
pages = {683--721},
pdf = {http://www.brucker.ch/bibliography/download/2012/brucker.ea-theorem-prover-2012.pdf},
publisher = {Springer-Verlag},
title = {On Theorem Prover-based Testing},
url = {http://www.brucker.ch/bibliography/abstract/brucker.ea-theorem-prover-2012},
volume = {25},
year = {2013},
}