CoqTL: An Internal DSL for Model Transformation in Coq

Tisi, Massimo; Cheng, Zheng

doi:10.1007/978-3-319-93317-7_7

Cited by 8 publications

(8 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper extends an article contributed to the ICMT 2018 conference [34] that introduced the fundamental design of CoqTL. Here we extend CoqTL by adding iterative rules (Section 3.3 and 3.4).…”

Section: Introductionsupporting

confidence: 54%

CoqTL: a Coq DSL for rule-based model transformation

2019

Self Cite

View full text Add to dashboard Cite

In model-driven engineering, model transformation (MT) verification is essential for reliably producing software artifacts. While recent advancements have enabled automatic Hoare-style verification for non-trivial MTs, there are certain verification tasks (e.g. induction) that are intrinsically difficult to automate. Existing tools that aim at simplifying the interactive verification of MTs typically translate the MT specification (e.g. in ATL) and properties to prove (e.g. in OCL) into an interactive theorem prover. However, since the MT specification and proof phases happen in separate languages, the proof developer needs a detailed knowledge of the translation logic. Naturally, any error in the MT translation could cause unsound verification, i.e. the MT executed in the original environment may have different semantics from the verified MT. We propose an alternative solution by designing and implementing an internal domain specific language, namely CoqTL, for the specification of declarative MTs directly in the Coq interactive theorem prover. Expressions in CoqTL are written in Gallina (the specification language of Coq), increasing the possibilities of reusing native Coq libraries in the transformation definition and proof. CoqTL specifications can be directly executed by our transformation engine encoded in Coq, or a certified implementation of the transformation can be generated by the native Coq extraction mechanism. We ensure that CoqTL has the same expressive power of Gallina (i.e. if a MT can be computed in Gallina, then it can also be represented in CoqTL). In this article, we introduce CoqTL, evaluate its practical applicability on a use case, and identify its current limitations.

show abstract

Section: Introductionsupporting

confidence: 54%

CoqTL: a Coq DSL for rule-based model transformation

2019

Self Cite

View full text Add to dashboard Cite

show abstract

“…In other words, a code rewriting or code generation challenge is raised by the multi-strategy approach. In particular, formal semantics for the model-management engine may be of high importance to guarantee a correct output code [37].…”

Section: Code-related Challengesmentioning

confidence: 99%

Towards transparent combination of model management execution strategies for low-code development platforms

Philippe

Coullon

Tisi

et al. 2020

Proceedings of the 23rd ACM/IEEE International Conference on Model Driven Engineering Languages and Systems: Companion Proceedi

Self Cite

View full text Add to dashboard Cite

Low-code development platforms are taking an important place in the model-driven engineering ecosystem, raising new challenges, among which transparent e ciency or scalability. Indeed, the increasing size of models leads to di culties in interacting with them e ciently. To tackle this scalability issue, some tools are built upon speci c computational strategies exploiting reactivity, or parallelism. However, their performances may vary depending on the speci c nature of their usage. Choosing the most suitable computational strategy for a given usage is a di cult task which should be automated. Besides, the most e cient solutions may be obtained by the use of several strategies at the same time. is paper motivates the need for a transparent multi-strategy execution mode for model-management operations. We present an overview of the di erent computational strategies used in the model-driven engineering ecosystem, and use a running example to introduce the bene ts of mixing strategies for performing a single computation. is example helps us present our design ideas for a multi-strategy model-management system. e code-related and DevOps challenges that emerged from this analysis are also presented. CCS CONCEPTS •So ware and its engineering →So ware creation and management; •Computing methodologies →Parallel algorithms;

show abstract

“…Proofs on CoqTL may be much more demanding. For instance, proving that a complex CoqTL transformation preserves node unreachability needed more than a thousand lines of proof code in [33].…”

Section: Running Examplementioning

confidence: 99%

“…In previous work, Tisi and Cheng presented CoqTL, a RMT language implemented as an internal DSL in the Coq interactive theorem prover [33]. CoqTL allows users to define model transformations, theorems on their behavior and machine-checked proofs of these theorems in Coq.…”

Section: Introductionmentioning

confidence: 99%

Certifying a rule-based model transformation engine for proof preservation

Cheng

Tisi

Hotonnier

2020

Proceedings of the 23rd ACM/IEEE International Conference on Model Driven Engineering Languages and Systems

Self Cite

View full text Add to dashboard Cite

Executable engines for relational model-transformation languages evolve continuously because of language extension, performance improvement and bug fixes. While new versions generally change the engine semantics, end-users expect to get backward-compatibility guarantees, so that existing transformations do not need to be adapted at every engine update. The CoqTL model-transformation language allows users to define model transformations, theorems on their behavior and machinechecked proofs of these theorems in Coq. Backward-compatibility for CoqTL involves also the preservation of these proofs. However, proof preservation is challenging, as proofs are easily broken even by small refactorings of the code they verify. In this paper we present the solution we designed for the evolution of CoqTL, and by extension, of rule-based transformation engines. We provide a deep specification of the transformation engine, including a set of theorems that must hold against the engine implementation. Then, at each milestone in the engine development, we certify the new version of the engine against this specification, by providing proofs of the impacted theorems. The certification formally guarantees end-users that all the proofs they write using the provided theorems will be preserved through engine updates. We illustrate the structure of the deep specification theorems, we produce a machine-checked certification of three versions of CoqTL against it, and we show examples of user theorems that leverage this specification and are thus preserved through the updates. CCS CONCEPTS • Theory of computation → Logic; • Software and its engineering → Software notations and tools.

show abstract

CoqTL: An Internal DSL for Model Transformation in Coq

Cited by 8 publications

References 19 publications

CoqTL: a Coq DSL for rule-based model transformation

CoqTL: a Coq DSL for rule-based model transformation

Towards transparent combination of model management execution strategies for low-code development platforms

Certifying a rule-based model transformation engine for proof preservation

Contact Info

Product

Resources

About