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 条
  • [11] Method of designing communication service specifications using message sequence charts
    Mizuno, Osamu
    Niitsu, Yoshihiro
    Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi), 1993, 76 (03): : 1 - 15
  • [12] DESIGNING SECURE COMMUNICATION PROTOCOLS FROM TRUST SPECIFICATIONS
    PAPADIMITRIOU, CH
    RANGAN, V
    SIDERI, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 560 : 360 - 368
  • [13] DESIGNING SECURE COMMUNICATION PROTOCOLS FROM TRUST SPECIFICATIONS
    PAPADIMITRIOU, CH
    RANGAN, V
    SIDERI, M
    ALGORITHMICA, 1994, 11 (05) : 485 - 499
  • [14] PROSPEC - AN INTERACTIVE PROGRAMMING ENVIRONMENT FOR DESIGNING AND VERIFYING COMMUNICATION PROTOCOLS
    CHOW, CH
    LAM, SS
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1988, 14 (03) : 327 - 338
  • [15] A tableau method for verifying dialogue game protocols for agent communication
    Bentahar, Jamal
    Moulin, Bernard
    Meyer, John-Jules Ch.
    DECLARATIVE AGENT LANGUAGES AND TECHNOLOGIES III, 2006, 3904 : 223 - 244
  • [16] A new model checking approach for verifying agent communication protocols
    Bentahar, Jamal
    Moulin, Bernard
    Meyer, John-Jules Ch.
    2006 CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, VOLS 1-5, 2006, : 1877 - +
  • [17] Verifying Modal Workflow Specifications Using Constraint Solving
    Bride, Hadrien
    Kouchnarenko, Olga
    Peureux, Fabien
    INTEGRATED FORMAL METHODS, IFM 2014, 2014, 8739 : 171 - 186
  • [18] Verifying formal specifications using fault tree analysis
    Liu, SY
    INTERNATIONAL SYMPOSIUM ON PRINCIPLES OF SOFTWARE EVOLUTION, PROCEEDINGS, 2000, : 272 - 281
  • [19] Basic protocols, message sequence charts, and the verification of requirements specifications
    Letichevsky, A
    Kapitonova, J
    Letichevsky, A
    Volkov, V
    Baranov, S
    Weigert, T
    COMPUTER NETWORKS, 2005, 49 (05) : 661 - 675
  • [20] Synthesizing software architecture descriptions from message sequence chart specifications
    Leue, S
    Mehrmann, L
    Rezai, M
    13TH IEEE INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING, PROCEEDINGS, 1998, : 192 - 195