729 search results - page 3 / 146 » A Transitive Closure Based Algorithm for Test Generation |
ICST
2010
IEEE
13 years 6 months ago
2010
IEEE
—Markov chains with Labelled Transitions can be used to generate test cases in a model-based approach. These test cases are generated by random walks on the model according to pr...
DBPL
1995
Springer
13 years 11 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
ASE
2010
13 years 7 months ago
2010
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
FATES
2004
Springer
14 years 28 days ago
2004
Springer
We present an extension of Tretmans’ theory and algorithm for test generation for input-output transition systems to real-time systems. Our treatment is based on an operational i...
DIS
2008
Springer
13 years 9 months ago
2008
Springer
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...