Model Transformation as Conservative Theory-Transformation

被引:1
作者
Brucker, Achim [1 ]
Tuong, Frederic [2 ]
Wolff, Burkhart [3 ]
机构
[1] Univ Exeter, Comp Sci, Exeter, Devon, England
[2] Trinity Coll Dublin, Dublin, Ireland
[3] Univ Paris Saclay, Comp Sci, Gif Sur Yvette, France
来源
JOURNAL OF OBJECT TECHNOLOGY | 2020年 / 19卷 / 03期
关键词
Model Transformation; Conservativity; UML; OCL; Isabelle/HOL; ENVIRONMENT; SEMANTICS; HOL;
D O I
10.5381/jot.2020.19.3.a3
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Model transformations play a central role in model-driven software development. Hence, logical unsafe model transformation can result in erroneous systems. Still, most model transformations are written in languages that do not provide built-in safeness guarantees. We present a new technique to construct tool support for domain-specific languages (DSLs) inside the interactive theorem prover environment Isabelle. Our approach is based on modeling the DSL formally in higher-order logic (HOL), modeling the API of Isabelle inside it, and defining the transformation between these two. Reflection via the powerful code generators yields code that can be integrated as extension into Isabelle and its user interface. Moreover, we use code generation to produce tactic code which is bound to appropriate command-level syntax. Our approach ensures the logical safeness (conservativity) of the theorem prover extension and, thus, provides a certified tool for the DSL in all aspects: the deductive capacities of theorem prover, code generation, and IDE support. We demonstrate our approach by extending Isabelle/HOL with support for UML/OCL and, more generally, providing support for a formal object-oriented modeling method.
引用
收藏
页码:1 / 16
页数:16
相关论文
共 36 条
  • [11] Brucker AD, 2008, LECT NOTES COMPUT SC, V4961, P97, DOI 10.1007/978-3-540-78743-3_8
  • [12] A Formally Verified Model of Web Components
    Brucker, Achim D.
    Herzberg, Michael
    [J]. FORMAL ASPECTS OF COMPONENT SOFTWARE, FACS 2019, 2020, 12018 : 51 - 71
  • [13] Semantics, calculi, and analysis for object-oriented specifications
    Brucker, Achim D.
    Wolff, Burkhart
    [J]. ACTA INFORMATICA, 2009, 46 (04) : 255 - 284
  • [14] An Extensible Encoding of Object-oriented Data Models in HOL with an Application to IMP plus
    Brucker, Achim D.
    Wolff, Burkhart
    [J]. JOURNAL OF AUTOMATED REASONING, 2008, 41 (3-4) : 219 - 249
  • [15] Brucker Achim D., 2014, FEATHERWEIGHT OCL PR
  • [16] Formal Verification of an Executable LTL Model Checker with Partial Order Reduction
    Brunner, Julian
    Lammich, Peter
    [J]. JOURNAL OF AUTOMATED REASONING, 2018, 60 (01) : 3 - 21
  • [17] Verifying and reflecting quantifier elimination for Presburger arithmetic
    Chaieb, A
    Nipkow, T
    [J]. LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2005, 3835 : 367 - 380
  • [18] CLAVEL M, 1996, P REFL 96, P263
  • [19] Costantini S, 2002, LECT NOTES ARTIF INT, V2408, P253
  • [20] Proof-Producing Reflection for HOL With an Application to Model Polymorphism
    Fallenstein, Benja
    Kumar, Ramana
    [J]. INTERACTIVE THEOREM PROVING, 2015, 9236 : 170 - 186