Zur Kurzanzeige

dc.contributor.authorMücke, Tilo
dc.contributor.authorHuhn, Michaela
dc.contributor.editorCremers, Armin B.
dc.contributor.editorManthey, Rainer
dc.contributor.editorMartini, Peter
dc.contributor.editorSteinhage, Volker
dc.date.accessioned2019-10-11T07:58:31Z
dc.date.available2019-10-11T07:58:31Z
dc.date.issued2005
dc.identifier.isbn3-88579-397-0
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/28258
dc.description.abstractIn the last decade, enormous progress has been made in generating test cases for coverage criteria automatically via model checking. However, many approaches suffer from generating large test suites with long test execution times. In recent work, we developed a method to generate test suites from state-based design models with the shortest test execution time satisfying a given set of coverage criteria. We were able to show that valuable improvements can be achieved. But space complexity of generating the fastest test suite turned out to be too high; thus our approach was limited to small models. Alternatively, a model checker can be called several times, each run generating a single test case. Thereby, the space complexity problem is solved. To build a test suite with minimised execution time, optimisations have to be applied afterwards. Here we present and compare several such algorithms to optimise test suites with respect to execution time.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofInformatik 2005 – Informatik Live! Band 2
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-68
dc.titleOptimising Test Execution Times in Test Suite Generationen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages480-485
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationBonn
mci.conference.date19. bis 22. September 2005


Dateien zu dieser Ressource

Thumbnail

Zur Kurzanzeige