Translating essential OCL invariants to nested graph constraints for generating instances of meta-models

Radke, Hendrik; Arendt, Thorsten; Becker, Jan Steffen; Habel, Annegret; Taentzer, Gabriele

doi:10.1016/j.scico.2017.08.006

Cited by 17 publications

(10 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, we showed that a certain form of diversity between the generated models can be achieved by configuration. As future work, we intend to support meta-models with OCL constraints, at least partly: Integrating the constraints as application conditions into rules [17,24] is a promising basis to extend our approach in this direction. Besides, we want to support further configuration facilities which allow us to generate realistic models by leveraging a stochastic controller [38].…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Generating Large EMF Models Efficiently

Nassar

Kosiol

Kehrer

et al. 2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

There is a growing need for the automated generation of instance models to evaluate model-driven engineering techniques. Depending on a chosen application scenario, a model generator has to fulfill different requirements: As a modeling language is usually defined by a meta-model, all generated models are expected to conform to their metamodels. For performance tests of model-driven engineering techniques, the efficient generation of large models should be supported. When generating several models, the resulting set of models should show some diversity. Interactive model generation may help in producing relevant models. In this paper, we present a rule-based, configurable approach to automate model generation which addresses the stated requirements. Our model generator produces valid instance models of meta-models with multiplicities conforming to the Eclipse Modeling Framework (EMF). An evaluation of the model generator shows that large EMF models (with up to half a million elements) can be produced. Since the model generation is rule-based, it can be configured beforehand or during the generation process to produce sets of models that are diverse to a certain extent.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Radke et al [24] present a translation of OCL constraints to graph constraints which can be integrated as application conditions into a given set of transformation rules [17]. The resulting rules guarantee validity w.r.t.…”

Section: Rule-based Approachesmentioning

confidence: 99%

Generating Large EMF Models Efficiently

Nassar

Kosiol

Kehrer

et al. 2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…While some solvers support incremental analysis, they usually assume monotonic model extensions, not covering scenarios where, for example, models are corrected or repaired. Nassar et al [45] presented the OCL2AC tool, which implements the theory of Habel and Pennemann [29] and Radke et al [57] using a native approach. In [46] the authors also discussed the preservation of invariants and empirically compared the use of application conditions generated with an a-posteriori check of invariants using the facilities provided by the Eclipse Modeling Framework.…”

Section: Discussion and Outlookmentioning

confidence: 99%

Analysis of Graph Transformation Systems: Native vs Translation-based Techniques

Heckel¹,

Lambers²,

Saadat³

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The paper summarises the contributions in a session at GCM 2019 presenting and discussing the use of native and translation-based solutions to common analysis problems for Graph Transformation Systems (GTSs). In addition to a comparison of native and translation-based techniques in this area, we explore design choices for the latter, s.a. choice of logic and encoding method, which have a considerable impact on the overall quality and complexity of the analysis. We substantiate our arguments by citing literature on application of theorem provers, model checkers, and SAT/SMT solver in GTSs, and conclude with a general discussion from a software engineering perspective, including comments from the workshop participants, and recommendations on how to investigate important design choices in the future.

show abstract

“…Such an application condition ensures that the rule applies to a valid model if and only if the resulting model after the rule application satisfies the constraint. OCL2AC implements a formal approach; its correctness is shown (Radke et al 2018;Nassar et al 2019). However, OCL2AC comes with the following limitations: It cannot yet translate all OCL constraints but only those that are two-valued and in first-order logic.…”

Section: A Correct-by-construction Approachmentioning

confidence: 99%

Java Bytecode Verification with OCL Why, How and Whenc.

Bockisch¹,

Taentzer²,

Nassar³

et al. 2020

JOT

Self Cite

View full text Add to dashboard Cite

Program transformations are frequently developed, e.g., to realize programming language extensions or dynamic program analyses such as profiling. They are typically implemented by manipulating bytecode as the availability of source code is not guaranteed. There are standard libraries such as ASM that are typically used for implementing Java bytecode manipulations. To check their correctness, they are usually tested by applying them to different programs, running the manipulated programs and observing their behaviors. As part of the second step, the Java virtual machine verifies the bytecode, which can uncover errors in the bytecode introduced by the manipulation. That approach uses different technologies that are not well linked making the process of developing and testing bytecode manipulations difficult. In this paper, we intend to perform bytecode manipulation by using concepts and techniques of model-driven engineering. We are convinced that the declarative nature of model transformation rules allows the debugging and analyzing of bytecode manipulations in more details than classically done. Following this path, a meta-model for bytecode is needed including OCL constraints for bytecode verification. We analyze the semantic rules of the bytecode verifier according to their complexity factor, present a meta-model for Java bytecode, show how the semantic rules can be expressed as OCL constraints on top of this meta-model, and show that basing bytecode manipulation on model transformation can provide more immediate guidance and feedback to the developer.

show abstract

Translating essential OCL invariants to nested graph constraints for generating instances of meta-models

Cited by 17 publications

References 7 publications

Generating Large EMF Models Efficiently

Generating Large EMF Models Efficiently

Analysis of Graph Transformation Systems: Native vs Translation-based Techniques

Java Bytecode Verification with OCL Why, How and Whenc.

Contact Info

Product

Resources

About