Abstract
With an example, this paper describes a method of using temporal logic for stepwise analysis of protocol specifications. Each level in the specified hierarchy is a kind of incarnation from higher-levels by adding some implementation strategies, and the correctness of top-down refinements could be verified in the unified temporal framework.
Article PDF
Similar content being viewed by others
References
B.T. Hailpern and S. Owicki, Verifying network protocols using temporal logic, in Proc. Trends and Applications: Computer Network Protocols, IEEE Computer Society, 1980, 18–28.
R.L. Schwartzand P.M. Smith, From State Machines to Temporal Logic: Specification Methods for Protocol Standards, in Protocol Specification, Testing and Verification, C. Sunshine ed., North Holland, 1982, 3–19.
Z. Manna and A. Pnueli, Verification of concurrent programs: a temporal proof system, CS Tech. Report, Stanford Univ., 1983.
N.V. Stenning, A data transfer protocol,Computer Network,1:2(1976), 99–110.
E.W. Dijkstra, Cuarded commands, nondeterminacy and formal derivation of programs, in Programming Methodology, A Collection of Articles by Members of IFIP WG2.3., ed. by D. Gries, 1978.
C.S. Tang, Toward a unified logic basis for programming languages, Proc. IFIP’s 83, paris, 1983.
Y. Feng, H. Lin and C.S. Tang, A proofsystem for temporal logic programs,Computer Research and Development,22:10(1985).
D.E. Knuth, Verification of link-level protocols, Tech. Report Stanford Univ., 1981.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Feng, Y. Hierarchical protocol analysis by temporal logic. J. of Comput. Sci. & Technol. 3, 56–69 (1988). https://doi.org/10.1007/BF02943332
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02943332