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 条
  • [31] Oven: Safe and Live Communication Protocols in Scala, using Synthetic Behavioural Type Analysis
    Ferreira, Francisco
    Jongmans, Sung-Shik
    PROCEEDINGS OF THE 32ND ACM SIGSOFT INTERNATIONAL SYMPOSIUM ON SOFTWARE TESTING AND ANALYSIS, ISSTA 2023, 2023, : 1511 - 1514
  • [32] On constructing communication protocols from component-based service specifications
    Nakamura, M
    Kakuda, Y
    Kikuno, T
    COMPUTER COMMUNICATIONS, 1996, 19 (14) : 1200 - 1215
  • [33] A Partition-Based Model Checking Method for Verifying Communication Protocols with SPIN
    Zhang, Xinchang
    Yang, Meihong
    Li, Xingfeng
    Shi, Huiling
    INFORMATION AND AUTOMATION, 2011, 86 : 71 - +
  • [34] VERIFYING UCM SPECIFICATIONS OF DISTRIBUTED SYSTEMS USING COLORED PETRI NETS
    Vizovitin, N. V.
    Nepomniaschy, V. A.
    Stenenko, A. A.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2015, 51 (02) : 213 - 222
  • [35] An Incremental Runtime Stochastic Model Checking Framework for Verifying Communication Protocols of Industrial CPS
    Liu, Yang
    Wang, Tao
    He, Chao
    2024 IEEE 15TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE, ICSESS 2024, 2024, : 183 - 187
  • [36] Descartes-Agent: Verifying Formal Specifications Using the Model Checking Technique
    Subburaj, Vinitha Hannah
    Urban, Joseph E.
    2018 SECOND IEEE INTERNATIONAL CONFERENCE ON ROBOTIC COMPUTING (IRC), 2018, : 392 - 398
  • [37] Verifying compiler based refinement of BluespecTM specifications using the SPIN model checker
    Singh, Gaurav
    Shukla, Sandeep K.
    MODEL CHECKING SOFTWARE, PROCEEDINGS, 2008, 5156 : 250 - 269
  • [38] Verifying concurrent probabilistic systems using probabilistic-epistemic logic specifications
    Wei Wan
    Jamal Bentahar
    Hamdi Yahyaoui
    Abdessamad Ben Hamza
    Applied Intelligence, 2016, 45 : 747 - 776
  • [39] Construction of global state transition graph for verifying specifications written in message sequence charts for telecommunications software
    Kim, BM
    Kim, HS
    Kim, W
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2001, E84D (02): : 249 - 261
  • [40] Construction of global state transition graph for verifying specifications written in message sequence charts for telecommunications software
    Kim, Byeong Man
    Kim, Hyeon Soo
    Kim, Wooyoung
    IEICE Transactions on Information and Systems, 2001, (02) : 249 - 261