Model-Based Test Selection for Infinite-State Reactive Systems

Jeannet, Bertrand; Jéron, Thierry; Rusu, Vlad

doi:10.1007/978-3-540-74792-5_3

Cited by 6 publications

(7 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It can be proved that

scriptI bold-italici oco scriptM

if and only if

sans-serif STrace s (scriptI) MathClass-bin\cap sans-serif Min F Trace s (scriptM) MathClass-rel= MathClass-rel\emptyset

, where

sans-serif Min F Trace s (scriptM) ≜ sans-serif STrace s (scriptM) MathClass-punc. Σ^{MathClass-punc!} MathClass-bin∖ sans-serif STrace s (scriptM)

is the set of minimal (with respect to the prefix ordering) non‐conformant suspension traces. Notice that the set of all non‐conformant traces is then

sans-serif Min F Trace s (scriptM) MathClass-punc. Σ^{MathClass-bin*}

.…”

Section: Conformance Testing Theory For Ioltssmentioning

confidence: 99%

“…The following characterizations of soundness, exhaustiveness and strictness, derived from , are very convenient to prove that generated test suites satisfy those properties. They are obtained by replacing ioco by its alternative characterization, fails by its definition, replacing universal quantification on

scriptT scriptC

by a union and suppressing the universal quantification on

scriptM

, using an argument on sets to replace implication by inclusion.…”

Section: Conformance Testing Theory For Ioltssmentioning

confidence: 99%

“…The ioco conformance theory introduced in 1996 by Tretmans is now a well‐established framework for the formal modelling of conformance testing for input/output labelled transition systems (IOLTSs). Test generation algorithms and tools have been designed for this model and for more general models whose semantics can be expressed in the form of infinite state IOLTSs . Test generation techniques have also been devised for timed automata models whose semantics are infinite state systems .…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Test generation from recursive tile systems

Chédor

Jéron

Morvan³

2014

Software Testing Verif & Rel

Self Cite

View full text Add to dashboard Cite

This paper explores the generation of conformance test cases for recursive tile systems (RTSs) in the framework of the classical ioco testing theory. The RTS model allows the description of reactive systems with recursion and is very similar to other models like pushdown automata, hyperedge replacement grammars or recursive state machines. Test generation for this kind of infinite state labelled transition systems is seldom explored in the literature. The first part presents an off-line test generation algorithm for weighted RTSs, a determinizable sub-class of RTSs, and the second one an on-line test generation algorithm for the full RTS model. Both algorithms use test purposes to guide test selection through targeted behaviours. Additionally, essential properties relating verdicts produced by generated test cases with both the soundness, with respect to the specification, and the precision, with respect to a test purpose, are proved.TEST GENERATION FROM RTS 533 account its reactions to stimuli of the test cases. In both cases, formal properties of test suites need be considered, for example, soundness reflects that no conformant implementation may be rejected, while exhaustiveness expresses that every non-conformant implementation is detected by at least one test in the suite.When considering infinite state systems, undecidability is often an issue. Very simple models like two counters machines lead to the undecidability of the most basic properties (e.g. reachability of a given configuration and occurrence of a given output). Furthermore, provided the description of a reactive system in a given model, the observable behaviour of such a system may not be expressible in this model. In order to establish properties like soundness and exhaustiveness of a generated test suite, it is convenient to have both a formal description of the system and to be able to prove properties relative to the generated tests. There are several models between finite state and Turing powerful systems; this paper considers a variant of pushdown automata (PDAs), which provide a nice middle-ground between expressivity and decidability. They form a model for reactive recursive programmes, like the running example that represents an abstraction of the one in Figure 1. This example is presented in some Java-like syntax and involves exceptions (a shortcut that is used whenever the keyword throw is used). More precisely, the programme asks for some integer, then calls the recursive function comp, which asks for a boolean, and, depending on its value, proceeds by making a recursive call or stopping. Whenever exceptions are raised, the programme branches directly to the catch block of the main function. Along the paper, we will only focus on the control flow of this programme and abstract data values away.There exist several ways to define recursive behaviours: PDAs, recursive state machines by Alur et al. [9] or regulars graphs, defined by functional (or deterministic) hyperedge replacement grammars (HR-grammars) [10,11]. Each of these models ha...

show abstract

“…It can be proved that

scriptI bold-italici oco scriptM

if and only if

sans-serif STrace s (scriptI) MathClass-bin\cap sans-serif Min F Trace s (scriptM) MathClass-rel= MathClass-rel\emptyset

, where

sans-serif Min F Trace s (scriptM) ≜ sans-serif STrace s (scriptM) MathClass-punc. Σ^{MathClass-punc!} MathClass-bin∖ sans-serif STrace s (scriptM)

is the set of minimal (with respect to the prefix ordering) non‐conformant suspension traces. Notice that the set of all non‐conformant traces is then

sans-serif Min F Trace s (scriptM) MathClass-punc. Σ^{MathClass-bin*}

.…”

Section: Conformance Testing Theory For Ioltssmentioning

confidence: 99%

scriptT scriptC

by a union and suppressing the universal quantification on

scriptM

, using an argument on sets to replace implication by inclusion.…”

Section: Conformance Testing Theory For Ioltssmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Test generation from recursive tile systems

Chédor

Jéron

Morvan³

2014

Software Testing Verif & Rel

Self Cite

View full text Add to dashboard Cite

show abstract

“…The following characterisations of soundness, exhaustiveness and strictness, derived from [15], are very convenient to prove that generated test suites satisfy those properties. They are obtained by replacing ioco by its alternative characterization, fails by its definition, replacing universal quantification on T C by a union, and suppressing the universal quantification on I, using an argument on sets to replace implication by inclusion.…”

Section: Inriamentioning

confidence: 99%

“…The ioco conformance theory introduced in [20] is a well established framework for the formal modelling of conformance testing for Input/Output Labelled Transition Systems (IOLTSs). Test generation algorithms and tools have been designed for this model [14,19] and for more general models whose semantics can be expressed in the form of infinite state IOLTSs [15,12]. Test generation techniques have also been devised for timed automata models whose semantics are infinite state systems [17,16,4].…”

Section: Introductionmentioning

confidence: 99%

Test Generation from Recursive Tiles Systems

Chédor¹,

Jéron

Morvan

2012

Tests and Proofs

Self Cite

View full text Add to dashboard Cite

In this paper we explore the generation of conformance test cases for Recursive Tile Systems (RTSs) in the framework of the classical ioco testing theory. The RTS model allows the description of reactive systems with recursion, and is very similar to other models like Pushdown Automata, Hyperedge Replacement Grammars or Recursive State Machines. Test generation for this kind of models is seldom explored in the literature. We first present an off-line test generation algorithm for Weighted RTSs, a determinizable sub-class of RTSs, and second, an on-line test generation algorithm for the full RTS model. Both algorithms use test purposes to guide test selection through targeted behaviours. Additionally, essential properties relating verdicts produced by generated test cases on an implementation with both the conformance with respect to its specification, and the precision with respect to a test purpose, are proved.

show abstract

A new method for testing timed systems

Bonifacio¹,

Moura²

2011

Software Testing Verif & Rel

View full text Add to dashboard Cite

SUMMARY Devising formal techniques and methods that can automatically generate test suites for timed systems has remained a challenge. In this paper Timed Input/Output Automata (TIOA) are used as a formal specification model for timed systems. This work proposes and proves the correctness of a new and more general discretization method that can be used to obtain grid automata corresponding to specification TIOA, using almost any granularity of interest. Such flexibility to find a suitable granularity opens the possibility for a more compact construction of grid automata. It is also shown how test purposes can be used together with the specification TIOA in order to generate grid automata that capture the behavior of both the specification and the test purpose. From such grid automata one can algorithmically extract test suites that can be used to verify whether given implementations adhere to the specification and reflect the properties modeled using the test purposes. Copyright © 2011 John Wiley & Sons, Ltd.

show abstract

Model-Based Test Selection for Infinite-State Reactive Systems

Cited by 6 publications

References 32 publications

Test generation from recursive tile systems

Test generation from recursive tile systems

Test Generation from Recursive Tiles Systems

A new method for testing timed systems

Contact Info

Product

Resources

About