70 Hits in 5.3 sec

Exploiting Attributed Type Graphs to Generate Metamodel Instances Using an SMT Solver

Hao Wu, Rosemary Monahan, James F. Power
2013 2013 International Symposium on Theoretical Aspects of Software Engineering  
In this paper we present an approach to generating instances of metamodels using a Satisfiability Modulo Theories (SMT) solver as a back-end engine.  ...  Our automated translation works by interpreting a metamodel as a bounded Attributed Type Graph with Inheritance (ATGI) and then deriving a finite universe of all bounded attribute graphs typed over this  ...  Thus, the idea of generating metamodel instances using a SMT solver is that we translate nodes and edges defined in the finite universe of all bounded attributed graphs typed over AT GI b into SMT2 quantifier  ... 
doi:10.1109/tase.2013.31 dblp:conf/tase/WuMP13 fatcat:gygjylgrnzc6rbx2n7s7wxuy3u

Metamodel Instance Generation: A systematic literature review [article]

Hao Wu and Rosemary Monahan and James F. Power
2012 arXiv   pre-print
We then identify the main topics that are related to metamodel instance generation techniques, and use these to initiate our literature search.  ...  In this paper we present a systematic literature review of instance generation techniques for metamodels, i.e. the process of automatically generating models from a given metamodel.  ...  Using SAT/SMT solvers, a model's properties can be verified within a limited search space by finding an instance.  ... 
arXiv:1211.6322v2 fatcat:fsvpuv47rfdyhkoof2xld74lue

A formal approach to finding inconsistencies in a metamodel

Hao Wu, Marie Farrell
2021 Journal of Software and Systems Modeling  
AbstractChecking the consistency of a metamodel involves finding a valid metamodel instance that provably meets the set of constraints that are defined over the metamodel.  ...  Often, a metamodel is inconsistent due to conflicts among the constraints.  ...  We used bounded typed attributed graphs as our intermediate representation and Z3 for solving constraints over these graphs to generate instances.  ... 
doi:10.1007/s10270-020-00849-8 fatcat:xmhi7nzrtnbpfa2gznukwxnsle

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

Aren A. Babikian, Oszkár Semeráth, Dániel Varró
2020 Lecture Notes in Computer Science  
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  ...  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  ...  ASMIG [38] uses the Z3 SMT solver [22] to generate typed and attributed graphs with inheritance.  ... 
doi:10.1007/978-3-030-45234-6_22 fatcat:ffxhtpiw3rec5fl7znk463f4va

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

Reiko Heckel, Leen Lambers, Maryam Ghaffari Saadat
2019 Electronic Proceedings in Theoretical Computer Science  
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  ...  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  ...  In [74] , an approach is presented to generate instances of metamodels using an SMT-solver.  ... 
doi:10.4204/eptcs.309.1 fatcat:2n6leydcevejpdnolo7x4rgqtm

A graph solver for the automated generation of consistent domain-specific models

Oszkár Semeráth, András Szabolcs Nagy, Dániel Varró
2018 Proceedings of the 40th International Conference on Software Engineering - ICSE '18  
Existing solutions which map graph models into first-order logic specification to use back-end logic solvers (like Alloy or Z3) have severe scalability issues.  ...  In the paper, we propose a graph solver framework for the automated generation of consistent domain-specific instance models which operates directly over graphs by combining advanced techniques such as  ...  Unlike existing approaches which map the model generation problem to logic solvers (dominantly SAT or SMT-solvers), we address the model generation problem of consistent instances directly over graphs  ... 
doi:10.1145/3180155.3180186 dblp:conf/icse/SemerathNV18 fatcat:ogeejaydxbeirlugigth5o2qgq

Automated Generation of Consistent Graph Models with Multiplicity Reasoning

Kristof Marussy, Oszkar Semerath, Daniel Varro
2020 IEEE Transactions on Software Engineering  
As a result, well-formedness constraints and multiplicity requirements can be evaluated in an approximated way on incomplete (unfinished) models by using advanced graph query engines with numerical solvers  ...  Type scopes allow to precisely define the required number of newly generated elements, thus one can avoid the generation of unrealistic and highly symmetric models having only a single type of elements  ...  Several generators are based on precise foundations offered by backend logic solvers (like SAT solvers [22] , [23] or SMT solvers [24] ).  ... 
doi:10.1109/tse.2020.3025732 fatcat:3youzjvkajevvpg7vre6tqnole

A Model-Driven Approach to Generate Relevant and Realistic Datasets

Adel Ferdjoukh, Eric Bourreau, Annie Chateau, Clémentine Nebut
2016 Proceedings of the 28th International Conference on Software Engineering and Knowledge Engineering  
In this paper we propose a model-driven approach based on a probabilistic simulation using domain specific metrics for automated generation of relevant and realistic datasets.  ...  Datasets may contain complexly structured data such as graphs or models, and obtaining such kind of data is sometimes expensive and available benchmarks are not as relevant as they should be.  ...  Our approach exploits domain-based metrics and the simulation of probability distributions to tackle the issue of relevance for generated instances.  ... 
doi:10.18293/seke2016-029 dblp:conf/seke/FerdjoukhBCN16 fatcat:tt2rgnf4dvhwlgoegp264h6xyu

Evaluating Well-Formedness Constraints on Incomplete Models

Oszkár Semeráth, Dániel Varró
2017 Acta Cybernetica  
In modern modeling tools used for model-driven development, the validation of several well-formedness constraints is continuously been carried out by exploiting advanced graph query engines to highlight  ...  To this end, we map the problem of constraint evaluation over partial models into regular graph pattern matching over complete models by semantically equivalent rewrites of graph queries.  ...  Still, our previous experience showed that advanced SAT and SMT solvers failed to solve partial model analysis with the same metamodel and size [33] .  ... 
doi:10.14232/actacyb.23.2.2017.15 fatcat:7bo45gnth5dp5f3e7w3tgzjs2y

Towards the Automated Generation of Consistent, Diverse, Scalable and Realistic Graph Models [chapter]

Dániel Varró, Oszkár Semeráth, Gábor Szárnyas, Ákos Horváth
2018 Lecture Notes in Computer Science  
In the paper, we present a long-term research challenge how to generate graph models specific to a domain which are consistent, diverse, scalable and realistic at the same time.  ...  An experimental evaluation is carried out in the context of a statechart modeling tool to evaluate the trade-off between different characteristics of model generators.  ...  Acknowledgements The authors are really grateful for the anonymous reviewers and Szilvia Varró-Gyapay for the numerous constructive feedback to improve the current paper.  ... 
doi:10.1007/978-3-319-75396-6_16 fatcat:n7yqyhj35bhitikk2hl7fzd37a

Graph Constraint Evaluation over Partial Models by Constraint Rewriting [chapter]

Oszkár Semeráth, Dániel Varró
2017 Lecture Notes in Computer Science  
When using models of a complex modeling language, several well-formedness constraints need to be continuously checked to highlight conceptual design flaws for the engineers in an early phase.  ...  For that purpose, we map the problem of constraint evaluation over partial models into a regular graph pattern matching problem over complete models by semantically equivalent rewrites of graph queries  ...  Additionally, we would like to thank Gábor Bergmann and the anonymous reviewers for their insightful comments.  ... 
doi:10.1007/978-3-319-61473-1_10 fatcat:ycmk7jkgevaivo5nukfvuowlyi

Two Decades of Maude [chapter]

Manuel Clavel, Francisco Durán, Steven Eker, Santiago Escobar, Patrick Lincoln, Narciso Martí-Oliet, Carolyn Talcott
2015 Lecture Notes in Computer Science  
This paper is not an introduction to Maude, and some familiarity with it and with rewriting logic are indeed assumed.  ...  This paper is a tribute to José Meseguer, from the rest of us in the Maude team, reviewing the past, the present, and the future of the language and system with which we have been working for around two  ...  Currently, Maude uses CVC4 [5] as its backend SMT solver, however calls to the SMT solver are implemented via an abstract interface and wrappers for other SMT libraries could easily be added in the future  ... 
doi:10.1007/978-3-319-23165-5_11 fatcat:cre7i55r4reg3indrng3w5fgqa

Multi-Model Evolution through Model Repair

Patrick Stünkel, Harald König, Adrian Rutle, Yngve Lamo
2021 Journal of Object Technology  
At the same time, these models are subject to frequent changes, and as a result, maintaining their global consistency over time becomes an important issue in model management in general and Model-Driven  ...  In this paper, we present a comprehensive feature model providing an overview of the current state of the art of model management.  ...  Acknowledgments We would like to thank all the anonymous reviewers for their helpful comments, which helped to improve the quality of this paper substantially.  ... 
doi:10.5381/jot.2021.20.1.a2 fatcat:u45ymv6chrdrlbitoiyayhx6ba

CoqTL: a Coq DSL for rule-based model transformation

Zheng Cheng, Massimo Tisi, Rémi Douence
2019 Journal of Software and Systems Modeling  
Thanks especially to recent advancements in SMT solvers, automatic deductive verification is giving good results in several scenarios [7, 6, 10, 27] .  ...  It has been used to prove non-trivial mathematical theorems, or as an environment for developing formally certified software and hardware (e.g. [25, 16] ).  ...  The reflective API can be used for obtaining the metaclass of an element, checking that an element is an instance of a metaclass, and boxing/unboxing a generic element from/to a specific metaclass.  ... 
doi:10.1007/s10270-019-00765-6 fatcat:4tgvy3nxfnaqzal6xzu6yl5zfu

Multi-objective optimization in rule-based design space exploration

Hani Abdeen, Dániel Varró, Houari Sahraoui, András Szabolcs Nagy, Csaba Debreceni, Ábel Hegedüs, Ákos Horváth
2014 Proceedings of the 29th ACM/IEEE international conference on Automated software engineering - ASE '14  
In this report I present an approach (developed in collaboration with researchers from BME-MIT and Université de Montréal) to exploit multi-objective optimization techniques for rule-based design space  ...  DSE is frequently used in Model Driven Systems Design (MDSD) to partially automate design processes or to dynamically reconfigure autonomous systems.  ...  The design problem is described using domain-specific languages and exploration is done with symbolic execution and automatic theorem proving by an SMT solver.  ... 
doi:10.1145/2642937.2643005 dblp:conf/kbse/AbdeenVSNDHH14 fatcat:qmspse37b5dcnckggftfa7k4s4
« Previous Showing results 1 — 15 out of 70 results