VIATRA Solver: A Framework for the Automated Generation of Consistent Domain-Specific Models

Semeráth, Oszkár; Babikian, Aren A.; Pilarski, Sebastian; Varró, Dániel

doi:10.1109/icse-companion.2019.00034

Cited by 14 publications

(20 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Examples of input and output files as well as our measurement results are on GitHub 4 . Altogether, Yakindu Statecharts provide a sufficiently complex case to assess the proposed mapping and the underlying theorem provers, and it has been used as a case study in existing papers of model generation [27,30].…”

Section: Discussionmentioning

confidence: 99%

“…Measurement setup: We compare the model generation scalability of the Vampire (4.4) theorem prover to that of two other approaches that use Alloy (4.2) [13] and VIATRA Solver [27,30] as back-end solvers, respectively. We select Vampire for our experimentation as it is the most scalable theorem prover that we are able to run locally using generated TPTP files as input.…”

Section: Research Question 2 (Rq2)mentioning

confidence: 99%

“…External Validity: Our approach is limited to a single domain selected based on its past use in related lines of existing research [27,29,30,37]. The domain of Yakindu Statecharts is sufficiently complex to cover all features of our mapping, thus we expect similar scalability results in other domains.…”

Section: Threats To Validitymentioning

confidence: 99%

See 2 more Smart Citations

Automated Generation of Consistent Graph Models with First-Order Logic Theorem Provers

Babikian

Semeráth

Varró

2020

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

The automated generation of graph models has become an enabler in several testing scenarios, including the testing of modeling environments used in the design of critical systems, or the synthesis of test contexts for autonomous vehicles. Those approaches rely on the automated construction of consistent graph models, where each model satisfies complex structural properties of the target domain captured in first-order logic predicates. In this paper, we propose a transformation technique to map such graph generation tasks to a problem consisting of first-order logic formulae, which can be solved by state-of-the-art TPTPcompliant theorem provers, producing valid graph models as outputs. We conducted performance measurements over all 73 theorem provers available in the TPTP library, and compared our approach with other solver-based approaches like Alloy and VIATRA Solver.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Research Question 2 (Rq2)mentioning

confidence: 99%

See 1 more Smart Citation

Automated Generation of Consistent Graph Models with First-Order Logic Theorem Provers

Babikian

Semeráth

Varró

2020

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…During the discussion at the workshop it was pointed out by Nebras Nassar that mappings to Alloy, but also direct mappings into SAT/SMT solvers, have limited scalability due to to large numbers of variables required for encoding complex model transformations, limiting us to models with roughly 100 to 200 elements. This problem has been investigated for mappings to Alloy, a tool that supports the analysis of software models using SAT/SMT solvers [64,71]. Generating a logic specification from a given model is a challenge if, due to frequent model updates, the given model has to be translated and checked repeatedly.…”

Section: Discussion and Outlookmentioning

confidence: 99%

“…Several approaches to instance generation, including [64,66,63], have been discussed in Section 4.3. In what follows, we consider a few translation-based approaches to instance generation which use existing SAT/SMT solvers.…”

Section: Instance Generationmentioning

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

Generating Large EMF Models Efficiently

Nassar

Kosiol

Kehrer

et al. 2020

Lecture Notes in Computer Science

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

VIATRA Solver: A Framework for the Automated Generation of Consistent Domain-Specific Models

Cited by 14 publications

References 20 publications

Automated Generation of Consistent Graph Models with First-Order Logic Theorem Provers

Automated Generation of Consistent Graph Models with First-Order Logic Theorem Provers

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

Generating Large EMF Models Efficiently

Contact Info

Product

Resources

About