Incremental protocol verification method for ECFSM-based protocols

Chung-Ming Huang, Jeng Muh Hsu, Huei Yang Lai, Jao Chiang Pong, Duen Tay Huang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Protocol verification is an activity to assure the correctness of a communication protocols. Global state reachability analysis is one of the most straightforward and easily automated protocol verification methods. In order to improve the efficiency of global state reachability analysis, many global state reduction techniques and various verification methods, e.g., the incremental protocol verification method, have been proposed in the past decade. Most of these techniques and methods are based on the state transition model, e.g., the Communicating Finite State Machine (CFSM) model. Nevertheless, two of the Formal Description Techniques (FDTs) for communication protocols, i.e., ISO's ESTELLE and CCITT's SDL, are based on the extended state transition model, e.g., the Extended Communicating Finite State Machine (ECFSM) model. Therefore, most of the previously proposed reduction techniques and verification methods cannot be directly applied to verify protocols specified in ESTELLE or SDL. This paper proposes a new incremental protocol verification method for the ECFSM model. The new method is based on the concept of dead and live variables proposed in Chu and Liu's ECFSM reduction technique [4]. By analyzing the dead and live variables, global states which have the same values for live variables and different values for dead variables can be treated as equivalent. Dead variable and live variable sets may be changed when the protocol is modified. Therefore, equivalent property of global states may be changed accordingly. As a result, the change of dead and live variable sets needs to be considered in the incremental verification process. Based on the new method, incremental verification process can be directly applied in ESTELLE or SDL verification tools.

Original languageEnglish
Title of host publicationCOMPASS - Proceedings of the Annual Conference on Computer Assurance
PublisherPubl by IEEE
Pages87-97
Number of pages11
ISBN (Print)0780312511
Publication statusPublished - 1993 Jan 1
EventProceedings of the Eighth Annual Conference on Computer Assurance - Gaithersburg, MD, USA
Duration: 1993 Jun 141993 Jun 17

Publication series

NameCOMPASS - Proceedings of the Annual Conference on Computer Assurance

Other

OtherProceedings of the Eighth Annual Conference on Computer Assurance
CityGaithersburg, MD, USA
Period93-06-1493-06-17

Fingerprint

Finite automata
Network protocols

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

Huang, C-M., Hsu, J. M., Lai, H. Y., Pong, J. C., & Huang, D. T. (1993). Incremental protocol verification method for ECFSM-based protocols. In COMPASS - Proceedings of the Annual Conference on Computer Assurance (pp. 87-97). (COMPASS - Proceedings of the Annual Conference on Computer Assurance). Publ by IEEE.
Huang, Chung-Ming ; Hsu, Jeng Muh ; Lai, Huei Yang ; Pong, Jao Chiang ; Huang, Duen Tay. / Incremental protocol verification method for ECFSM-based protocols. COMPASS - Proceedings of the Annual Conference on Computer Assurance. Publ by IEEE, 1993. pp. 87-97 (COMPASS - Proceedings of the Annual Conference on Computer Assurance).
@inproceedings{a30a75196bbe47a58195274d1f597da6,
title = "Incremental protocol verification method for ECFSM-based protocols",
abstract = "Protocol verification is an activity to assure the correctness of a communication protocols. Global state reachability analysis is one of the most straightforward and easily automated protocol verification methods. In order to improve the efficiency of global state reachability analysis, many global state reduction techniques and various verification methods, e.g., the incremental protocol verification method, have been proposed in the past decade. Most of these techniques and methods are based on the state transition model, e.g., the Communicating Finite State Machine (CFSM) model. Nevertheless, two of the Formal Description Techniques (FDTs) for communication protocols, i.e., ISO's ESTELLE and CCITT's SDL, are based on the extended state transition model, e.g., the Extended Communicating Finite State Machine (ECFSM) model. Therefore, most of the previously proposed reduction techniques and verification methods cannot be directly applied to verify protocols specified in ESTELLE or SDL. This paper proposes a new incremental protocol verification method for the ECFSM model. The new method is based on the concept of dead and live variables proposed in Chu and Liu's ECFSM reduction technique [4]. By analyzing the dead and live variables, global states which have the same values for live variables and different values for dead variables can be treated as equivalent. Dead variable and live variable sets may be changed when the protocol is modified. Therefore, equivalent property of global states may be changed accordingly. As a result, the change of dead and live variable sets needs to be considered in the incremental verification process. Based on the new method, incremental verification process can be directly applied in ESTELLE or SDL verification tools.",
author = "Chung-Ming Huang and Hsu, {Jeng Muh} and Lai, {Huei Yang} and Pong, {Jao Chiang} and Huang, {Duen Tay}",
year = "1993",
month = "1",
day = "1",
language = "English",
isbn = "0780312511",
series = "COMPASS - Proceedings of the Annual Conference on Computer Assurance",
publisher = "Publ by IEEE",
pages = "87--97",
booktitle = "COMPASS - Proceedings of the Annual Conference on Computer Assurance",

}

Huang, C-M, Hsu, JM, Lai, HY, Pong, JC & Huang, DT 1993, Incremental protocol verification method for ECFSM-based protocols. in COMPASS - Proceedings of the Annual Conference on Computer Assurance. COMPASS - Proceedings of the Annual Conference on Computer Assurance, Publ by IEEE, pp. 87-97, Proceedings of the Eighth Annual Conference on Computer Assurance, Gaithersburg, MD, USA, 93-06-14.

Incremental protocol verification method for ECFSM-based protocols. / Huang, Chung-Ming; Hsu, Jeng Muh; Lai, Huei Yang; Pong, Jao Chiang; Huang, Duen Tay.

COMPASS - Proceedings of the Annual Conference on Computer Assurance. Publ by IEEE, 1993. p. 87-97 (COMPASS - Proceedings of the Annual Conference on Computer Assurance).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Incremental protocol verification method for ECFSM-based protocols

AU - Huang, Chung-Ming

AU - Hsu, Jeng Muh

AU - Lai, Huei Yang

AU - Pong, Jao Chiang

AU - Huang, Duen Tay

PY - 1993/1/1

Y1 - 1993/1/1

N2 - Protocol verification is an activity to assure the correctness of a communication protocols. Global state reachability analysis is one of the most straightforward and easily automated protocol verification methods. In order to improve the efficiency of global state reachability analysis, many global state reduction techniques and various verification methods, e.g., the incremental protocol verification method, have been proposed in the past decade. Most of these techniques and methods are based on the state transition model, e.g., the Communicating Finite State Machine (CFSM) model. Nevertheless, two of the Formal Description Techniques (FDTs) for communication protocols, i.e., ISO's ESTELLE and CCITT's SDL, are based on the extended state transition model, e.g., the Extended Communicating Finite State Machine (ECFSM) model. Therefore, most of the previously proposed reduction techniques and verification methods cannot be directly applied to verify protocols specified in ESTELLE or SDL. This paper proposes a new incremental protocol verification method for the ECFSM model. The new method is based on the concept of dead and live variables proposed in Chu and Liu's ECFSM reduction technique [4]. By analyzing the dead and live variables, global states which have the same values for live variables and different values for dead variables can be treated as equivalent. Dead variable and live variable sets may be changed when the protocol is modified. Therefore, equivalent property of global states may be changed accordingly. As a result, the change of dead and live variable sets needs to be considered in the incremental verification process. Based on the new method, incremental verification process can be directly applied in ESTELLE or SDL verification tools.

AB - Protocol verification is an activity to assure the correctness of a communication protocols. Global state reachability analysis is one of the most straightforward and easily automated protocol verification methods. In order to improve the efficiency of global state reachability analysis, many global state reduction techniques and various verification methods, e.g., the incremental protocol verification method, have been proposed in the past decade. Most of these techniques and methods are based on the state transition model, e.g., the Communicating Finite State Machine (CFSM) model. Nevertheless, two of the Formal Description Techniques (FDTs) for communication protocols, i.e., ISO's ESTELLE and CCITT's SDL, are based on the extended state transition model, e.g., the Extended Communicating Finite State Machine (ECFSM) model. Therefore, most of the previously proposed reduction techniques and verification methods cannot be directly applied to verify protocols specified in ESTELLE or SDL. This paper proposes a new incremental protocol verification method for the ECFSM model. The new method is based on the concept of dead and live variables proposed in Chu and Liu's ECFSM reduction technique [4]. By analyzing the dead and live variables, global states which have the same values for live variables and different values for dead variables can be treated as equivalent. Dead variable and live variable sets may be changed when the protocol is modified. Therefore, equivalent property of global states may be changed accordingly. As a result, the change of dead and live variable sets needs to be considered in the incremental verification process. Based on the new method, incremental verification process can be directly applied in ESTELLE or SDL verification tools.

UR - http://www.scopus.com/inward/record.url?scp=0027150716&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027150716&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0780312511

T3 - COMPASS - Proceedings of the Annual Conference on Computer Assurance

SP - 87

EP - 97

BT - COMPASS - Proceedings of the Annual Conference on Computer Assurance

PB - Publ by IEEE

ER -

Huang C-M, Hsu JM, Lai HY, Pong JC, Huang DT. Incremental protocol verification method for ECFSM-based protocols. In COMPASS - Proceedings of the Annual Conference on Computer Assurance. Publ by IEEE. 1993. p. 87-97. (COMPASS - Proceedings of the Annual Conference on Computer Assurance).