The Community for Technology Leaders
Green Image
<p>For the development of communications software composed of many modules, protocol validation is considered essential to detect errors in the interactions among the modules. Protocol validation techniques previously proposed have required validation time that is too long for many actual protocols. The authors propose a novel fast protocol validation technique to overcome this drawback. The proposed technique is to construct the minimum acyclic form of state transitions in individual processes of the protocol, and to detect protocol errors such as system deadlocks and channel overflows fast. The authors also present a protocol validation system based on the technique to confirm its feasibility and show validation results for some actual protocols. As a result, the protocol validation system is expected to improve productivity in the development and maintenance of communications software.</p>
finite state machines; acyclic expansion algorithm; protocol validation; communications software; state transitions; protocol errors; system deadlocks; channel overflows; computer communications software; finite automata; program verification; protocols; system recovery
Y. Kakuda, M. Norigoe, Y. Wakahara, "An Acyclic Expansion Algorithm for Fast Protocol Validation", IEEE Transactions on Software Engineering, vol. 14, no. , pp. 1059-1070, August 1988, doi:10.1109/32.7616
100 ms
(Ver 3.3 (11022016))