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 条
  • [1] Compositional Synthesis of Reactive Systems from Live Sequence Chart Specifications
    Kugler, Hillel
    Segall, Itai
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2009, 5505 : 77 - +
  • [2] Verifying communication constraints in RSML specifications
    Heimdahl, MPE
    1997 HIGH-ASSURANCE ENGINEERING WORKSHOP - PROCEEDINGS, 1997, : 56 - 61
  • [3] Using Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom
    Sethi, Divjyot
    Talupur, Muralidhar
    Malik, Sharad
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, ATVA 2014, 2014, 8837 : 330 - 347
  • [4] Development of communication protocols using algebraic and temporal specifications
    Jmaiel, M
    Pepper, P
    COMPUTER NETWORKS, 2003, 42 (06) : 737 - 764
  • [5] ON THE CONSTRUCTION OF SUBMODULE SPECIFICATIONS AND COMMUNICATION PROTOCOLS
    MERLIN, P
    VONBOCHMANN, G
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1983, 5 (01): : 1 - 25
  • [6] Verifying Quantum Communication Protocols with Ground Bisimulation
    Qin, Xudong
    Deng, Yuxin
    Du, Wenjie
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT II, TACAS 2020, 2020, 12079 : 21 - 38
  • [7] Strong safe realizability of message sequence chart specifications
    Mousavi, Abdolmajid
    Far, Behrouz
    Eberlein, Armin
    Heidari, Behrouz
    INTERNATIONAL SYMPOSIUM ON FUNDAMENTALS OF SOFTWARE ENGINEERING, PROCEEDINGS, 2007, 4767 : 334 - +
  • [8] A roadmap to autonomous of airlines: specifications and communication protocols
    Jafarzadeh, Hadi
    INTERNATIONAL JOURNAL OF SUSTAINABLE AVIATION, 2018, 4 (01) : 63 - 77
  • [9] The use of conditional grammars for specifying and verifying communication protocols
    Matousek, P
    MODELLING AND SIMULATION 2001, 2001, : 59 - 62
  • [10] A TRANSLATION METHOD FROM NATURAL-LANGUAGE SPECIFICATIONS OF COMMUNICATION PROTOCOLS INTO ALGEBRAIC SPECIFICATIONS USING CONTEXTUAL DEPENDENCIES
    ISHIHARA, Y
    SEKI, H
    KASAMI, T
    SHIMABUKURO, J
    OKAWA, K
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1993, E76D (12) : 1479 - 1489