M3C: Modal Meta Model Checking

被引:4
作者
Steffen, Bernhard [1 ]
Murtovi, Alnis [1 ]
机构
[1] TU Dortmund Univ, Chair Programming Syst, Dortmund, Germany
来源
FORMAL METHODS FOR INDUSTRIAL CRITICAL SYSTEMS, FMICS 2018 | 2018年 / 11119卷
关键词
Modal Transition Systems; Context-free/procedural transition systems; Modal refinement; Second-order model checking; Meta model; Domain-specific languages; Predicate/property transformers; Binary decision diagram; Compositionality; VERIFICATION;
D O I
10.1007/978-3-030-00244-2_15
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
M3C is a method and tool supporting meta-level product lining and evolution that comprises both context free system structure and modal refinement. The underlying Context-Free Modal Transition Systems can be regarded as loose specifications of meta models, and modal refinement as a way to increase the specificity of allowed DSLs by constraining the range of allowed syntax specifications. Model checking with M3C allows one to verify properties specified in a branching-time logic for all DSLs of a given level of specificity in one go, which is illustrated by looking at variations of an elementary programming language. Technically, M3C is based on second-order model checking which determines how procedure calls affect the validity of the properties of interest. The inherent compositionality of the second-order approach leads to a runtime complexity linear in the size of the procedural system representation, whose corresponding transition systems typically have infinitely many states. In fact, second-order model checking can be regarded as a means to tame state explosion via 'procedural abstraction', a technique which may well be beneficial also for regular (recursion-free) systems.
引用
收藏
页码:223 / 241
页数:19
相关论文
共 21 条
[1]  
[Anonymous], 1990, LNCS, DOI DOI 10.1007/3-540-52148-8
[2]  
Blackburn Patrick, 2006, HDB MODAL LOGIC STUD, V3
[3]  
BURKART O, 1992, LECT NOTES COMPUT SC, V630, P123
[4]  
Burkart O, 1994, LECT NOTES COMPUT SC, V836, P98
[5]   Model checking the full modal mu-calculus for infinite sequential processes [J].
Burkart, O ;
Steffen, B .
THEORETICAL COMPUTER SCIENCE, 1999, 221 (1-2) :251-270
[6]  
Clarke EM, 1999, MODEL CHECKING, P1
[7]   A LINEAR-TIME MODEL-CHECKING ALGORITHM FOR THE ALTERNATION-FREE MODAL MU-CALCULUS [J].
CLEAVELAND, R ;
STEFFEN, B .
FORMAL METHODS IN SYSTEM DESIGN, 1993, 2 (02) :121-147
[8]  
Emerson E.Allen., 1997, DIMACS SERIES DISCRE, P185
[9]  
Frohme M., 2018, COMPOSITIONAL LEARNI
[10]   Active Mining of Document Type Definitions [J].
Frohme, Markus ;
Steffen, Bernhard .
FORMAL METHODS FOR INDUSTRIAL CRITICAL SYSTEMS, FMICS 2018, 2018, 11119 :147-161