On requirement verification for evolving Statecharts specifications

被引:0
|
作者
Carlo Ghezzi
Claudio Menghi
Amir Molzam Sharifloo
Paola Spoletini
机构
[1] Politecnico di Milano,DeepSE Research Group, Dipartimento di Elettronica e Informazione
[2] Università dell’Insubria,DiSTA
来源
Requirements Engineering | 2014年 / 19卷
关键词
Software modeling; Statecharts; Agile development; Formal verification; Model checking; Incremental verification;
D O I
暂无
中图分类号
学科分类号
摘要
Software development processes have been evolving from rigid, pre-specified, and sequential to incremental, and iterative. This evolution has been dictated by the need to accommodate evolving user requirements and reduce the delay between design decision and feedback from users. Formal verification techniques, however, have largely ignored this evolution and even when they made enormous improvements and found significant uses in practice, like in the case of model checking, they remained confined into the niches of safety-critical systems. Model checking verifies if a system’s model M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{M}$$\end{document} satisfies a set of requirements, formalized as a set of logic properties Φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Phi$$\end{document}. Current model-checking approaches, however, implicitly rely on the assumption that both the complete model M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{M}$$\end{document} and the whole set of properties Φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Phi$$\end{document} are fully specified when verification takes place. Very often, however, M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{M}$$\end{document} is subject to change because its development is iterative and its definition evolves through stages of incompleteness, where alternative design decisions are explored, typically to evaluate some quality trade-offs. Evolving systems specifications of this kind ask for novel verification approaches that tolerate incompleteness and support incremental analysis of alternative designs for certain functionalities. This is exactly the focus of this paper, which develops an incremental model-checking approach for evolving Statecharts. Statecharts have been chosen both because they are increasingly used in practice natively support model refinements.
引用
收藏
页码:231 / 255
页数:24
相关论文
共 50 条
  • [1] On requirement verification for evolving Statecharts specifications
    Ghezzi, Carlo
    Menghi, Claudio
    Sharifloo, Amir Molzam
    Spoletini, Paola
    REQUIREMENTS ENGINEERING, 2014, 19 (03) : 231 - 255
  • [2] Automatic verification of requirement specifications
    Kwon, GH
    Jeong, CJ
    Chung, YD
    INTELLIGENT INFORMATION SYSTEMS, (IIS'97) PROCEEDINGS, 1997, : 277 - 281
  • [3] Matching and merging of statecharts specifications
    Nejati, Shiva
    Sabetzadeh, Mehrdad
    Chechik, Marsha
    Easterbrook, Steve
    Zave, Pamela
    ICSE 2007: 29TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, PROCEEDINGS, 2007, : 54 - +
  • [4] Interactive verification of statecharts
    Thums, A
    Schellhorn, G
    Ortmeier, F
    Reif, W
    INTEGRATION OF SOFTWARE SPECIFICATION TECHNIQUES FOR APPLICATIONS IN ENGINEERING, 2004, 3147 : 355 - 373
  • [5] Reachability Verification of Rhapsody Statecharts
    Madhukar, Kumar
    Metta, Ravindra
    Singh, Priyanka
    Venkatesh, R.
    IEEE SIXTH INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION WORKSHOPS (ICSTW 2013), 2013, : 96 - 101
  • [6] Trace Based Reachability Verification for Statecharts
    Madhukar, Kumar
    Metta, Ravindra
    Shrotri, Ulka
    Venkatesh, R.
    2013 1ST FME WORKSHOP ON FORMAL METHODS IN SOFTWARE ENGINEERING (FORMALISE), 2013, : 22 - 28
  • [7] Verification of Statecharts Using Data Abstraction
    Helke, Steffen
    Kammueller, Florian
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2016, 7 (01) : 571 - 583
  • [8] Formal verification and hardware design with statecharts
    Philipps, J
    Scholz, P
    PROSPECTS FOR HARDWARE FOUNDATIONS: ESPRIT WORKING GROUP 8533 NADA - NEW HARDWARE DESIGN METHODS SURVEY CHAPTERS, 1998, 1546 : 356 - 389
  • [9] Compositional verification of quantitative properties of statecharts
    Levi, F
    JOURNAL OF LOGIC AND COMPUTATION, 2001, 11 (06) : 829 - 878
  • [10] Optimizing the Symbolic Execution of Evolving Rhapsody Statecharts
    Khalil, Amal
    Dingel, Juergen
    ADVANCES IN COMPUTERS, VOL 108, 2018, 108 : 145 - 281