A protocol test generation procedure
Computer Networks and ISDN Systems
Test Selection Based on Finite State Models
IEEE Transactions on Software Engineering
Theoretical Computer Science
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Designing tests for time dependent systems
ICCC '95 Proceedings of the 12th international conference on computer communication on Information highways : for a smaller world and better living: for a smaller world and better living
Theoretical Computer Science
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
Verifying ET-LOTOS programmes with KRONOS
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
Automated Test Generation from Timed Automata
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
The Observational Power of Clocks
CONCUR '94 Proceedings of the Concurrency Theory
Generating Test Cases for a Timed I/O Automaton Model
Proceedings of the IFIP TC6 12th International Workshop on Testing Communicating Systems: Method and Applications
A Practical and Complete Algorithm for Testing Real-Time Systems
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Two examples of verification of multirate timed automata with Kronos
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Timed Test Cases Generation Based on State Characterization Technique
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Automatic Testing of Reactive Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Automatic generation of tests for timing constraints from requirements
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Integration of Time in Canonical Testers for Real-Time Systems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Path Optimization for Graph Partitioning Problems
Path Optimization for Graph Partitioning Problems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
| Hi-index | 0.00 |
Testing is an important step of the development of complex systems. It requires a lot of resources of memory and time. In addition, the complexity of such a step increases if the systems handle time constraints. In this paper, we present several solutions to generate test sequences in a distributed manner. Our methods are first explained and then compared from a theoretical point of view. Our solution leveraging DHT networks seems to be the most efficient to tackle test generation on very large-scale networks.