By Topic

A semi-automated verification method for communication protocols modeled as 2-ECFSMs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Higuchi, M. ; Dept. of Inf. & Comput. Sci., Osaka Univ., Japan ; Sano, J. ; Hara, K. ; Fujii, M.

Previously, we proposed a verification method via invariants for communication protocol modeled as 2-ECPSMs. In the proposed method, a human verifier describes an invariant of a given protocol in a disjunctive normal form, and a verification system shows safety or liveness based on the invariant. The tedious work on describing invariant formulae is the most significant shortcoming of the proposed method. This paper deals with a semi-automated derivation of invariant formulae for communication protocol modeled as 2-ECFSMs. In the method, the logical formula which holds on a subset of reachable states is automatically generated. Such a subset consists of states which are teachable by synchronous communication from the initial states and those which are reachable by sequences of sending transitions from synchronously reachable states. To obtain an invariant, a human verifier supplements several disjuncts for other part of reachability set. We conducted an experiment on deriving an invariant formula of a sample protocol extracted from the OSI session protocol. By the result, 636 conjunctive formulae were automatically derived and the conjunction of those formulae was shown to be an invariant of the sample protocol, i.e. the sample protocol was shown to be safe automatically

Published in:

Distributed Computing Systems, 1996., Proceedings of the 16th International Conference on

Date of Conference:

27-30 May 1996