Logging to Facilitate Combinatorial System Testing

  • Peter M. Kruse
  • I. S. Wishnu B. Prasetya
  • Jurriaan Hage
  • Alexander Elyasov
Conference paper

DOI: 10.1007/978-3-319-07785-7_3

Volume 8432 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Kruse P.M., Prasetya I.S.W.B., Hage J., Elyasov A. (2014) Logging to Facilitate Combinatorial System Testing. In: Vos T., Lakhotia K., Bauersfeld S. (eds) Future Internet Testing. FITTEST 2013. Lecture Notes in Computer Science, vol 8432. Springer, Cham

Abstract

Testing a web application is typically very complicated. Imposing simple coverage criteria such as function or line coverage is often not sufficient to uncover bugs due to incorrect components integration. Combinatorial testing can enforce a stronger criterion, while still allowing the prioritization of test cases in order to keep the overall effort feasible. Combinatorial testing requires the whole testing domain to be classified and formalized, e.g., in terms of classification trees. At the system testing level, these trees can be quite large. This short paper presents our preliminary work to automatically construct classification trees from loggings of the system, and to subsequently calculate the coverage of our test runs against various combinatorial criteria. We use the tool CTE which allows such criteria to be custom specified. Furthermore, it comes with a graphical interface to simplify the specification of new test sequences.

Keywords

Combinatorial testing Classification trees Logging 

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Peter M. Kruse
    • 1
  • I. S. Wishnu B. Prasetya
    • 2
  • Jurriaan Hage
    • 2
  • Alexander Elyasov
    • 2
  1. 1.Berner and Mattner Systemtechnik GmbHBerlinGermany
  2. 2.Department of Information and Computing SciencesUtrecht UniversityUtrechtThe Netherlands