396 search results - page 14 / 80 » Using Refinement Checking as System Testing |
80
Voted
CSR
2008
Springer
14 years 11 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
103
Voted
GI
2009
Springer
14 years 7 months ago
2009
Springer
Abstract: Model based testing promises systematic test coverage in a continuous testing process. However, in practice, model based testing struggles with informal specifications, d...
SPIN
2004
Springer
15 years 3 months ago
2004
Springer
The notion that certain procedures are atomic provides a valuable partial specification for many multithreaded software systems. Several existing tools verify atomicity by showing...
TACAS
2010
Springer
14 years 7 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
JPDC
2006
14 years 9 months ago
2006
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We consider the version in which communicating tasks are to...