Brucker, Achim D.
Rights / licenseIn Copyright - Non-Commercial Use Permitted
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 Show more
External linksFull text via SFX
Journal / seriesETH technical report
PublisherETH, Department of Computer Science
SubjectSymbolic test case generations; Isabelle/HOL; Theorem proving; Black box testing
Organisational unit02150 - Departement Informatik / Department of Computer Science
NotesTechnical Reports D-INFK.
MoreShow all metadata