Logging to Facilitate Combinatorial System Testing

P.M. Kruse, I.S.W.B. Prasetya, J Hage, Alexander Elyasov

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review


    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.
    Original languageEnglish
    Title of host publicationFuture Internet Testing
    Subtitle of host publicationFirst International Workshop, FITTEST 2013, Istanbul, Turkey, November 12, 2013, Revised Selected Papers
    EditorsTanja E.J. Vos, Kiran Lakhotia, Sebastian Bauersfeld
    ISBN (Electronic)N 978-3-319-07785-7
    ISBN (Print)978-3-319-07784-0
    Publication statusPublished - 2014

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    • Combinatorial testing
    • Classification trees
    • Logging


    Dive into the research topics of 'Logging to Facilitate Combinatorial System Testing'. Together they form a unique fingerprint.

    Cite this