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

Wu, Hao; Monahan, Rosemary; Power, James F.

doi:10.1109/tase.2013.31

Cited by 22 publications

(26 citation statements)

References 17 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…EMF2CSP/UML2CSP [8,10] translates model generation to a constraint programming problem, and solves it by use of an underlying CSP solver. ASMIG [38] uses the Z3 SMT solver [22] to generate typed and attributed graphs with inheritance. An advanced model generation approach is presented in the Formula framework [15] also using the Z3 SMT solver.…”

Section: Related Workmentioning

confidence: 99%

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

Babikian

Semeráth

Varró

2020

Fundamental Approaches to Software Engineering

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: Related Workmentioning

confidence: 99%

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

Babikian

Semeráth

Varró

2020

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…This advantage differs from modularity above in that this concerns comparison of alternative algorithms whereas modularity is helpful in developing and changing a single algorithm. Analysis techniques for GTS to which SAT/SMT solvers have been applied include WP (Section 5.1) in a graph specification framework for verification (DrAGoM [49]), TA (Section 5.2) using Petrinet approximation and weighted type graphs (GREZ [16]), and SSA tools (Section 5.3) such as Mini-SAT [38], a GROOVE extension [34], SGA [68,69]), and instance generators Cartier [67], Reflective Instantiator [42], and ASMIG [74] for metamodels (Section 5.4).…”

Section: Use Of Sat and Smt Solversmentioning

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

“…In [9], Mougenot et al use random tree generation to generate the tree structure of a model. Wu et al [12] translate a meta-model into SMT (Satisfiability Modulo Theory) in order to automatically generate conform models. In [3], Ehrig et al transform a meta-model into a graph grammar which is used to produce instances.…”

Section: Related Workmentioning

confidence: 99%

“…In [9], authors use a uniform distribution during the generation process and add weights in order to influence the frequency of appearance of different elements. In [12], authors describe two techniques to obtain relevant instances. The first one is the use of partition-based criteria which must be provided by the users.…”

Section: Related Workmentioning

confidence: 99%

A Model-Driven Approach to Generate Relevant and Realistic Datasets

Ferdjoukh¹,

Bourreau²,

Château³

et al. 2016

International Conferences on Software Engineering and Knowledge Engineering

View full text Add to dashboard Cite

Abstract:Disposing of relevant and realistic datasets is a difficult challenge in many areas, for benchmarking or testing purpose. 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. 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.

show abstract

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

Cited by 22 publications

References 17 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

A Model-Driven Approach to Generate Relevant and Realistic Datasets

Contact Info

Product

Resources

About