A survey of communication protocol testing
Journal of Systems and Software
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
Transforming and Selecting Functional Test Cases for Security Policy Testing
ICST '09 Proceedings of the 2009 International Conference on Software Testing Verification and Validation
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
Conformance testing to real-time communications systems
Computer Communications
| Hi-index | 0.00 |
The reachable graphs and FSM methods are successfully used to analyze the network protocols and to generate computable test traces to verify the correctness of protocol communication. But these methods are hard to use to verify the security of the protocol, because the important security properties (such as nonce, encrypt methods etc.) are not compatible in the classic FSM definition. In this article, for our 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. 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 automatically.