Test-Sequence Generation with Hol-TestGen with an Application to Firewall Testing

  • Achim D. Brucker
  • Burkhart Wolff
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4454)

Abstract

hol-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/hol. Its 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.

Although originally designed for black-box unit-tests, hol-TestGen’s underlying logic and deduction engine is powerful enough to be used in test-sequence generation, too.

We develop the theory for test-sequence generation with hol-TestGen and describe its use in a substantial case-study in the field of computer security, namely the black-box test of configured firewalls.

Keywords

symbolic test case generations test sequence generation black box testing theorem proving Isabelle/HOL computer security 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
    Andrews, P.B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic Press, Orlando (May 1986)MATHGoogle Scholar
  3. 3.
    Brucker, A.D., Wolff, B.: HOL-TestGen 1.0.0 user guide. Technical Report 482, ETH Zürich (April 2005)Google Scholar
  4. 4.
    Brucker, A.D., Wolff, B.: Interactive testing using HOL-TestGen. In: Grieskamp, W., Weise, C. (eds.) FATES 2005. LNCS, vol. 3997, pp. 87–102. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Brucker, A.D., Wolff, B.: Symbolic test case generation for primitive recursive functions. In: Grabowski, J., Nielsen, B. (eds.) FATES 2004. LNCS, vol. 3395, pp. 16–32. Springer, Heidelberg (2005)Google Scholar
  6. 6.
    Church, A.: A formulation of the simple theory of types. Journal of Symbolic Logic 5, 56–68 (1940)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Dick, J., Faivre, A.: Automating the generation and sequencing of test cases from model-based specications. In: Larsen, P.G., Woodcock, J.C.P. (eds.) FME 1993. LNCS, vol. 670, pp. 268–284. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  8. 8.
    Frantzen, L., Tretmans, J., Willemse, T.A.C.: A symbolic framework for model-based testing. In: Havelund, K., Núñez, M., Roşu, G., Wolff, B. (eds.) Formal Approaches to Software Testing and Runtime Verification. LNCS, vol. 4262, Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. 9.
    Gaudel, M.-C.: Testing can be formal, too. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915, pp. 82–96. Springer, Heidelberg (1995)Google Scholar
  10. 10.
    Nipkow, T., Paulson, L.C., Wenzel, M. (eds.): Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)MATHGoogle Scholar
  11. 11.
    Wenzel, M.M.: Isabelle/Isar — a versatile environment for human-readable formal proof documents. PhD thesis, TU München, München (February 2002)Google Scholar
  12. 12.
    Zhu, H., Hall, P.A., May, J.H.R.: Software unit test coverage and adequacy. ACM Computing Surveys 29(4), 366–427 (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Achim D. Brucker
    • 1
  • Burkhart Wolff
    • 1
  1. 1.Information Security, ETH Zurich, ETH Zentrum, CH-8092 ZürichSwitzerland

Personalised recommendations