Modeling and Formal Verification of IMPP

  • Sohel Khan*
  • , Abdul Waheed
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper describes the modeling and formal verification of the application layer protocol, Instant Messaging and Presence Protocol (IMPP). Spin is a model checker for the verification of asynchronous, distributed and concurrent finite state systems. It accepts the system specification in a high level language called Promela (PROcess MEta LAnguage) and verification claims in temporal logic. We have selected Instant Messaging and Presence Protocol (IMPP) for modeling, simulation and verification as it is characterized by concurrency and distributed computing, which makes it a good candidate to explore the potential of model checking and verification. Further the important properties of the protocol are verified using LTL (Linear Temporal Logic). One of our aims was also to get an insight into the scope and utility of formal methods based on state space exploration in testing larger and complex software systems, which has been achieved to some extent.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Software Engineering Research and Practise. SERP 2003
EditorsB. Al-Ani, H.R. Arabnia, Y. Mun, B. Al-Ani, H.R. Arabnia, Y. Mun
Pages522-528
Number of pages7
StatePublished - 2003

Publication series

NameProceedings of the International Conference on Software Engineering Research and Practise
Volume2

Keywords

  • Formal Methods
  • Instant Message Systems
  • LTL
  • Promela
  • Spin
  • Verification Tools
  • Verification of Communication protocols

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Modeling and Formal Verification of IMPP'. Together they form a unique fingerprint.

Cite this