TY - JOUR
T1 - An Algebraic Specification of HDLC Procedures and Its Verification
AU - Higashino, Teruo
AU - Sugiyama, Yuji
AU - Taniguchi, Kenichi
AU - Kasami, Tadao
AU - Mori, Masaaki
N1 - Copyright:
Copyright 2015 Elsevier B.V., All rights reserved.
PY - 1984/11
Y1 - 1984/11
N2 - It is well known that algebraic specification methods are promising for specifying programs and for verifying their various properties formally. In this paper, an algebraic specification of information transfer procedures of high-level data link control (HDLC) procedures is presented and some of the main properties of the specification are shown. First, we introduce abstract states, state transition functions, and output functions corresponding to elementary notions extracted from the description of HDLC procedures in ISO 3309–1979 (E) and ISO 4335–1979 (E). Second, we show axioms which represent the relations between the values of functions before and after the state transitions. Then, it is proved that the specification is “consistent,” “sufficiently complete,” and “nonredundant.” Also it is shown that an implementation which realizes the specification is naturally derived. In the last section, verification of various properties of HDLC procedures is formulated in the same framework as the algebraic specification, and some verification examples are presented.
AB - It is well known that algebraic specification methods are promising for specifying programs and for verifying their various properties formally. In this paper, an algebraic specification of information transfer procedures of high-level data link control (HDLC) procedures is presented and some of the main properties of the specification are shown. First, we introduce abstract states, state transition functions, and output functions corresponding to elementary notions extracted from the description of HDLC procedures in ISO 3309–1979 (E) and ISO 4335–1979 (E). Second, we show axioms which represent the relations between the values of functions before and after the state transitions. Then, it is proved that the specification is “consistent,” “sufficiently complete,” and “nonredundant.” Also it is shown that an implementation which realizes the specification is naturally derived. In the last section, verification of various properties of HDLC procedures is formulated in the same framework as the algebraic specification, and some verification examples are presented.
KW - Algebraic specification
KW - Church-Rosser property
KW - HDLC procedures
KW - term rewriting system
KW - verification
UR - http://www.scopus.com/inward/record.url?scp=0021521640&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0021521640&partnerID=8YFLogxK
U2 - 10.1109/TSE.1984.5010311
DO - 10.1109/TSE.1984.5010311
M3 - Article
AN - SCOPUS:0021521640
SN - 0098-5589
VL - SE-10
SP - 825
EP - 836
JO - IEEE Transactions on Software Engineering
JF - IEEE Transactions on Software Engineering
IS - 6
ER -