Verifying Communication Protocols Using Live Sequence Chart Specifications

Authors:
Rahul Kumar;Eric G. Mercer
Affiliations:
Computer Science Department, Brigham Young University, Provo, Utah 84606, USA;Computer Science Department, Brigham Young University, Provo, Utah 84606, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 6
Cited 0

Operational semantics for MSC'96

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on advanced topics on SDL and MSC
Verification of a Radio-Based Signaling System Using the STATEMATE Verification Environment

Formal Methods in System Design
Model Checking Live Sequence Charts

ICECCS '05 Proceedings of the 10th IEEE International Conference on Engineering of Complex Computer Systems
Live sequence charts applied to hardware requirements specification and verification: A VCI bus interface model

International Journal on Software Tools for Technology Transfer (STTT) - Special section on high-level test of complex systems
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual
Temporal logic for scenario-based specifications

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The need for a formal verification process in System on Chip (SoC) design and Intellectual Property (IP) integration has been recognized and investigated significantly in the past. A major drawback is the lack of a suitable specification language against which definitive and efficient verification of inter-core communication can be performed to prove compliance of an IP block against the protocol specification. Previous research has yielded positive results of verifying systems against the graphical language of Live Sequence Charts (LSCs) but has identified key limitations of the process that arise from the lack of support for important constructs of LSCs such as Kleene stars, subcharts, and hierarchical charts. In this paper we further investigate the use of LSCs as a specification language and show how it can be formally translated to automata suitable for input to a model checker for automatic verification of the system under test. We present the translation for subcharts, Kleene stars, and hierarchical charts that are essential for protocol specification and have not been translated to automata before. Further, we successfully translate the BVCI protocol (point to point communication protocol) specification from LSC to an automaton and present a case study of verifying models using the resulting automaton.