Chaining Test Cases for Reactive System Testing

Abstract

Abstract. Testing of synchronous reactive systems is challenging because long input sequences are often needed to drive them into a state to test a desired feature. This is particularly problematic in on-target testing, where a system is tested in its real-life application environment and the amount of time required for resetting is high. This paper presents an approach to discovering a test case chain-a single software execution that covers a group of test goals and minimises overall test execution time. Our technique targets the scenario in which test goals for the requirements are given as safety properties. We give conditions for the existence and minimality of a single test case chain and minimise the number of test case chains if a single test case chain is infeasible. We report experimental results with a prototype tool for C code generated from Simulink models and compare it to state-of-the-art test suite generators.

Model-based testing of automotive software

“…The suffix is the whole second test case, if it continues the first test case. This cost definition enforces the triangle inequality of the metric version of ATSP, as in [17][19] [20], making the use of the LKH solver very efficient.…”

Reachability in hierarchical machines

“…Efficient solutions to this problem can be used for checking more complex properties [1] (e.g., deadlock-free, safety, liveness, etc. ), generating test cases for given test purposes [2][3][4][5] and optimizing the execution of a test suite by connecting test cases in a given test suite [6], [7]. In this paper we consider this problem for the systems that are designed hierarchically.…”

Generating test case chains for reactive systems

“…4. We try to compute a concrete test case chain for the covering path (lines [3][4][5][6][7][8]. If this fails, we iterate the refinement process.…”

“…This article is an extended version of the ICTSS 2013 conference paper [7]. In addition to the core ideas published in [7], this extended article proposes an alternative to abstraction refinement using path constraints and an ASP solver (Sect.…”

“…In addition to the core ideas published in [7], this extended article proposes an alternative to abstraction refinement using path constraints and an ASP solver (Sect. 4.2) and gives details of the generation of multiple chains (Sect.…”