2302 search results - page 63 / 461 » Testing as Abstraction |
167
click to vote
FCT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Message sequence charts are an attractive formalism for specifying communicating systems. One way to test such a system is to substitute a component by a test process and...
172
click to vote
CONCUR
2006
Springer
15 years 9 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
152
click to vote
ECMDAFA
2006
Springer
15 years 9 months ago
2006
Springer
In MDE, model transformations should be efficiently tested so that it may be used and reused safely. Mutation analysis is an efficient technique to evaluate the quality of test dat...
189
click to vote
FASE
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
155
click to vote
JCP
2007
15 years 5 months ago
2007
Abstract— As the technologies of autonomic computing become more prevalent, it is essential to develop methodologies for testing their dynamic self-management operations. Self-ma...