Sciweavers

1422 search results - page 9 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
FORTE
1998
14 years 11 months ago
Exploiting Symmetry in Protocol Testing
Test generation and execution are often hampered by the large state spaces of the systems involved. In automata (or transition system) based test algorithms, taking advantage of s...
Judi Romijn, Jan Springintveld
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 4 months ago
A Factorial Experiment on Scalability of Search Based Software Testing
Software testing is an expensive process, which is vital in the industry. Construction of the test-data in software testing requires the major cost and to decide which method to us...
Arash Mehrmand, Robert Feldt
89
Voted
CIARP
2009
Springer
15 years 4 months ago
Learning Relational Grammars from Sequences of Actions
Many tasks can be described by sequences of actions that normally exhibit some form of structure and that can be represented by a grammar. This paper introduces FOSeq, an algorithm...
Blanca Vargas-Govea, Eduardo F. Morales
GECCO
2007
Springer
276views Optimization» more  GECCO 2007»
15 years 3 months ago
Automatic mutation test input data generation via ant colony
Fault-based testing is often advocated to overcome limitations of other testing approaches; however it is also recognized as being expensive. On the other hand, evolutionary algor...
Kamel Ayari, Salah Bouktif, Giuliano Antoniol
EPEW
2008
Springer
14 years 11 months ago
Towards State Space Reduction Based on T-Lumpability-Consistent Relations
Markovian behavioral equivalences can be exploited for state space reduction before performance evaluation takes place. It is known that Markovian bisimilarity corresponds to ordin...
Marco Bernardo