Verifying Communication Protocols Using Live Sequence Chart Specifications

被引:6
|
作者
Kumar, Rahul [1 ]
Mercer, Eric G. [1 ]
机构
[1] Brigham Young Univ, Comp Sci Dept, Provo, UT 84606 USA
基金
中国国家自然科学基金;
关键词
D O I
10.1016/j.entcs.2009.08.016
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:33 / 48
页数:16
相关论文
共 50 条
  • [22] A Test Sequence Generation Method for Communication Protocols Using the SAT Algorithm
    Mori, Takanori
    Otsuka, Hirotaka
    Funabiki, Nobuo
    Nakata, Akio
    Higashino, Teruo
    Systems and Computers in Japan, 2003, 34 (11) : 20 - 29
  • [23] A methodology for mapping live sequence chart to coloured petri net
    Amorim, L
    Maciel, P
    Nogueira, M
    Barreto, R
    Tavares, E
    INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOL 1-4, PROCEEDINGS, 2005, : 2999 - 3004
  • [24] Verifying Estelle protocol specifications using Numerical Petri Nets
    Lai, R
    Jirachiefpattana, A
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 1996, 11 (01): : 15 - 33
  • [25] Composing specifications using communication
    Treharne, H
    Schneider, S
    Bramble, M
    ZB 2003: FORMAL SPECIFICATION AND DEVELOPMENT IN Z AND B, 2003, 2651 : 58 - 78
  • [26] Specifying and Verifying CRDT Protocols Using TLA+
    Ji Y.
    Wei H.-F.
    Huang Y.
    Lü J.
    Ruan Jian Xue Bao/Journal of Software, 2020, 31 (05): : 1332 - 1352
  • [27] A METHOD OF APPLYING MESSAGE SEQUENCE CHART SPECIFICATIONS FOR SERVICES WITH VARIANT PROCESS STRUCTURE
    MORIYASU, K
    HIRAKAWA, Y
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS, 1995, 78 (09): : 12 - 24
  • [28] VERIFYING THE SEMANTIC CORRECTNESS OF PROTOCOLS USING THE COHERENCE PROPERTY
    KARPOV, YG
    BORSHCHEV, AV
    MESHCHERSKY, AA
    AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1989, (05): : 41 - 44
  • [29] Time in message sequence chart specifications and how to derive stochastic Petri nets
    Kluge, O
    COMMUNICATION-BASED SYSTEMS, 2000, : 17 - 31
  • [30] Modeling and Verifying Security Protocols Using UML 2
    Smith, Sandra
    Beaulieu, Alain
    Phillips, W. Greg
    2011 IEEE INTERNATIONAL SYSTEMS CONFERENCE (SYSCON 2011), 2011, : 72 - 79