Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Eight Years of Experience in Test Generation from FDTs using TVEDA
FORTE X / PSTV XVII '97 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (PSTV XVII)
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Using On-The-Fly Verification Techniques for the Generation of test Suites
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Conformance Testing of a Multimedia System Using PHACT
IWTCS Proceedings of the IFIP TC6 11th International Workshop on Testing Communicating Systems
Autolink - Putting SDL-Based Test Generation Into Practice
IWTCS Proceedings of the IFIP TC6 11th International Workshop on Testing Communicating Systems
Formal Test Automation: A Simple Experiment
Proceedings of the IFIP TC6 12th International Workshop on Testing Communicating Systems: Method and Applications
Formal Test Automation: The Conference Protocol with TGV/TORX
TestCom '00 Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems: Tools and Techniques
Formal Test Automation: The Conference Protocol with PHACT
TestCom '00 Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems: Tools and Techniques
A two-level approach to automated conformance testing of VHDL designs
A two-level approach to automated conformance testing of VHDL designs
A symbolic framework for model-based testing
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
| Hi-index | 0.00 |
This paper presents a comparison of four algorithms for test derivation: TorX, TGV, Autolink and UIO algorithms. The algorithms are classified according to the detection power of their conformance relations. Because Autolink does not have an explicit conformance relation, a conformance relation is reconstructed for it. The experimental results obtained by applying TorX, Autolink, UIO and TGV to the Conference Protocol case study are consistent with the theoretical results of this paper.