Supporting automated containment checking of software behavioural models using model transformations and model checking

被引:8
作者
Muram, Faiz U. L. [1 ,2 ]
Tran, Huy [1 ]
Zdun, Uwe [1 ]
机构
[1] Univ Vienna, Fac Comp Sci, Software Architecture Res Grp, Vienna, Austria
[2] Malardalen Univ, Sch Innovat Design & Engn, Vasteras, Sweden
关键词
Containment checking; Model checking; Model transformation; Behaviour models; LTL; CONSISTENCY; PROOF;
D O I
10.1016/j.scico.2019.01.005
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Models are extensively used in many areas of software engineering to represent the behaviour of software systems at different levels of abstraction. Because of the involvement of different stakeholders in constructing these models and their independent evolution, inconsistencies might occur between the models. It is thus crucial to detect these inconsistencies at early phases of the software development process, and especially as soon as refined models deviate from their abstract counterparts. In this article, we introduce a containment checking approach to verify whether a certain low-level behaviour model, typically created by refining and enhancing a high-level model, still is consistent with the specification provided in its high-level counterpart. We interpret the containment checking problem as a model checking problem, which has not received special treatment in the literature so far. Because the containment checking is based on model checking, it requires both formal consistency constraints and specifications of these models. Unfortunately, creating formal consistency constraints and specifications is currently done manually, and therefore, labour-intensive and error prone. To alleviate this issue, we define and develop a fully automated transformation of behaviour models into formal specifications and properties. The generated formal specifications and properties can directly be used by existing model checkers for detecting any discrepancy between the input models and yield corresponding counterexamples. Moreover, our approach can provide the developers more informative and comprehensive feedback regarding the inconsistency issues, and therefore, help them to efficiently identify and resolve the problems. The evaluation of various scenarios from industrial case studies demonstrates that the proposed approach efficiently translates the behaviour models into formal specifications and properties. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:38 / 71
页数:34
相关论文
共 70 条
[1]  
Amálio N, 2004, LECT NOTES COMPUT SC, V3308, P418
[2]  
[Anonymous], 1987, TEMPORAL LOGIC SPECI, DOI DOI 10.1007/3-540-51803-7_36
[3]  
[Anonymous], P WORKSH GRAPH TRANS
[4]   SMT-Based Automatic Proof of ASM Model Refinement [J].
Arcaini, Paolo ;
Gargantini, Angelo ;
Riccobene, Elvinia .
SOFTWARE ENGINEERING AND FORMAL METHODS: 14TH INTERNATIONAL CONFERENCE, SEFM 2016, 2016, 9763 :253-269
[5]   Development of distance measures for process mining, discovery, and integration [J].
Bae, Joonsoo ;
Liu, Ling ;
Caverlee, James ;
Zhang, Liang-Jie ;
Bae, Hyerim .
INTERNATIONAL JOURNAL OF WEB SERVICES RESEARCH, 2007, 4 (04) :1-17
[6]   From symptom to cause: Localizing errors in counterexample traces [J].
Ball, T ;
Naik, M ;
Rajamani, SK .
ACM SIGPLAN NOTICES, 2003, 38 (01) :97-105
[7]   A comparative survey of business process similarity measures [J].
Becker, Michael ;
Laue, Ralf .
COMPUTERS IN INDUSTRY, 2012, 63 (02) :148-167
[8]   SYMBOLIC MODEL CHECKING - 1020 STATES AND BEYOND [J].
BURCH, JR ;
CLARKE, EM ;
MCMILLAN, KL ;
DILL, DL ;
HWANG, LJ .
INFORMATION AND COMPUTATION, 1992, 98 (02) :142-170
[9]  
Cavada R., 2005, NUSMV 2 5 USER MANUA
[10]  
Cimatti A., 1999, Computer Aided Verification. 11th International Conference, CAV'99. Proceedings (Lecture Notes in Computer Science Vol.1633), P495