245 search results - page 2 / 49 » State Complexity of Testing Divisibility |
COCO
2000
Springer
14 years 1 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
COMPSAC
2007
IEEE
14 years 4 months ago
2007
IEEE
Although many of the software engineering activities can now be model-supported, the model is often missing in software development. We are interested in retrieving statemachine m...
ASM
2005
ASM
14 years 3 months ago
2005
ASM
Abstract. Exploration algorithms are relevant to the industrial practice of gentest cases from an abstract state machine whose runs define the predicted behavior of the software s...
GECCO
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. This paper shows how the presence of states in test objects can hinder or render impossible the search for test data using evolutionary testing. Additional guidance is re...
TAICPART
2006
IEEE
14 years 3 months ago
2006
IEEE
The design of complex systems, e.g., telecom services, is nowadays usually based on the integration of components (COTS), loosely coupled in distributed architectures. When compon...