Formal specification and verification of the kernel functional unit of the OSI session layer protocol and service using CCS

  • Authors:

  • Milica Barjaktarovic;Shiu-Kai Chin;Kamal Jabbour

  • Affiliations:

  • Department of Electrical and Computer Engineering, Wilkes University, Wilkes, PA and Syracuse University, Syracuse, NY;Department of Electrical and Computer Engineering, Wilkes University, Wilkes, PA and Syracuse University, Syracuse, NY;Department of Electrical and Computer Engineering, Wilkes University, Wilkes, PA and Syracuse University, Syracuse, NY

  • Venue:
  • ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes an application of formal methods to protocol specification, validation and verification. Formal methods can be incorporated in protocol design and testing so that time and resources are saved on implementation, testing, and documentation. In this paper we show how formal methods can be used to write the control sequence, i.e. pseudo code, which can be formally tested using automated support. The formal specification serves as a blueprint for a correct implementation with desired properties.As a formal method we chose a process algebra called "plain" Calculus of Communicating Systems (CCS). Our specific objectives were to: 1) build a CCS model of the Kernel Functional Unit of OSI session layer service: 2) obtain a session protocol specification through stepwise refinement of the service specification; and 3) verify that the protocol specification satisfies the service specification. We achieved all of our objectives. Verification and validation were accomplished by using the CCS's model checker, the Edinburgh Concurrency Workbench (CWB). We chose plain CCS because of itssuccinct, abstract, and modular specifications, strong mathematical foundation which allows for formal reasoning and proofs, and existence of the automated support tool which supports temporal logic. The motivation for this work is: 1) testing the limits of CCS's succinct notation; 2) combining CCS and temporal logic; and 3) using a model-checker on a real-life example.