Trace Based Reachability Verification for Statecharts

被引:0
|
作者
Madhukar, Kumar [1 ]
Metta, Ravindra [1 ]
Shrotri, Ulka [1 ]
Venkatesh, R. [1 ]
机构
[1] Tata Consultancy Serv, TRDDC, Pune 411013, Maharashtra, India
关键词
DYNAMIC ABSTRACTION;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Statecharts are widely used to model the behavior of reactive systems. While this visual formalism makes modeling easier, the state of the art in verification of statechart specifications is far from satisfactory due to the state explosion problem. We present History Abstraction, a trace-based verification technique to address this problem. Given a set of traces in a statechart model, the model is abstracted to contain at most three states per statechart: current, history and future. A path to a desired state in the abstract model is a sketch of a potential path to that state in the original model. We follow an incremental concretization procedure to extend the sketch to a complete path in the original model. This paper presents our technique. Our experiments suggest that the technique scales to large industry models.
引用
收藏
页码:22 / 28
页数:7
相关论文
共 50 条
  • [21] A case study in verification of UML statecharts: The PROFIsafe protocol
    Malik, R
    Muhlfeld, R
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2003, 9 (02) : 138 - 151
  • [22] Efficient Verification of Network Reachability Properties
    Yang, Hongkun
    2013 21ST IEEE INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS (ICNP), 2013,
  • [23] Reachability analysis for formal verification of SystemC
    Drechsler, R
    Grosse, D
    EUROMICRO SYMPOSIUM ON DIGITAL SYSTEM DESIGN, PROCEEDINGS: ARCHITECTURES, METHODS AND TOOLS, 2002, : 337 - 340
  • [24] Reachability as Derivability, Finite Countermodels and Verification
    Lisitsa, Alexei
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, 2010, 6252 : 233 - 244
  • [25] Reachability analysis in verification via supercompilation
    Lisitsa, Alexei
    Nemytykh, Andrei P.
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2008, 19 (04) : 953 - 969
  • [26] Verification by approximate forward and backward reachability
    Govindaraju, SG
    Dill, DL
    1998 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN: DIGEST OF TECHNICAL PAPERS, 1998, : 366 - 370
  • [27] Protocol Verification by Simultaneous Reachability Graph
    Wang, Cailu
    Tao, Yuegang
    Zhou, Ying
    IEEE COMMUNICATIONS LETTERS, 2017, 21 (08) : 1727 - 1730
  • [28] REACHABILITY AND VERIFICATION PROBLEMS OF HYBRID SYSTEMS
    Alibek, A.
    Altayeva, A. B.
    Kulpeshov, B. Sh.
    BULLETIN OF THE NATIONAL ACADEMY OF SCIENCES OF THE REPUBLIC OF KAZAKHSTAN, 2014, (02): : 3 - 7
  • [29] Specification and verification of a safety shell with statecharts and extended timed graphs
    van Katwijk, J
    Toetenel, H
    Sahraoui, AE
    Anderson, E
    Zalewski, J
    COMPUTER SAFETY, RELIABILITY AND SECURITY, PROCEEDINGS, 2000, 1943 : 37 - 52
  • [30] Formal verification of UML statecharts with real-time extensions
    David, A
    Möller, MO
    Yi, W
    FUNDAMENTAL APPROACHES TO SOFTWARE ENGINEERING, PROCEEDINGS, 2002, 2306 : 218 - 232