Conformance testing with labelled transition systems: implementation relations and test generation
Computer Networks and ISDN Systems - Special issue on protocol testing
A survey of communication protocol testing
Journal of Systems and Software
Confirming Configurations in EFSM Testing
IEEE Transactions on Software Engineering
Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-Outs
IEEE Transactions on Computers
Compositional testing of communication systems
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
An EFSM-based intrusion detection system for ad hoc networks
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Network securing against threatening requests
DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security
Test generation for interworking systems
Computer Communications
Conformance testing to real-time communications systems
Computer Communications
A model-based approach to security flaw detection of network protocol implementations
ICNP '08 Proceedings of the 2008 IEEE International Conference on Network Protocols
| Hi-index | 0.00 |
The transition system is widely used to model and to analyze the properties of protocol implementations. It presents the systems with reachable finite state graphes and can be used to calculate the possible transitions traces to verify the correctness of the protocol implementation. But this method is hard to be used to verify the security of authentication protocol, because some important security properties (such as nonce, encryption etc.) are not compatible in the classic definition of system transition. In addition, the security protocols usually need to consider the actions of possible attackers, which is also an obstacle to use transition system on security protocol. In this article, for the purpose of security protocol verification, we extend the classic IOLTS model to SG-IOLTS model, which defines variables and atoms into transitions to capture the security properties and combines the distribute concurrent components together. We also propose an finite intruder model within this SG-IOLTS, which makes the reachable graph contains the transitions of intruders and makes the security verifying traces can be generated through the transition system.