Abstract

In this paper, we present a novel technique to automatically synthesize consistent, diverse and structurally realistic domain-specific graph models. A graph model is (1) consistent if it is metamodel-compliant and it satisfies the well-formedness constraints of the domain; (2) it is diverse if local neighborhoods of nodes are highly different; and (1) it is structurally realistic if a synthetic graph is at a close distance to a representative real model according to various graph metrics used in network science, databases or software engineering. Our approach grows models by model extension operators using a hill-climbing strategy in a way that (A) ensures that there are no constraint violation in the models (for consistency reasons), while (B) more realistic candidates are selected to minimize a target metric value (wrt. the representative real model). We evaluate the effectiveness of the approach for generating realistic models using multiple metrics for guidance heuristics and compared to other model generators in the context of three case studies with a large set of real human models. We also highlight that our technique is able to generate a diverse set of models, which is a requirement in many testing scenarios.

Highlights

  • 1.1 MotivationAutomated graph model generation has recently become a key research component in many areas of software and systems engineering

  • We conducted several measurements to address the following research questions: RQ1: What graph metrics are effective for guiding model generators toward realistic graph models?

  • We used an effective metamodel of Eclipse Modeling Framework (EMF), and formalized 3 additional constraints

Read more

Summary

Introduction

1.1 MotivationAutomated graph model generation has recently become a key research component in many areas of software and systems engineering. Consistent model generators like Alloy [32,80], Formula [33,36], SDG [75,76] and Viatra Solver [65,67] are able to automatically derive well-formed models for a given domain specification. These generators either use an underlying logic solver (like SAT solvers [19,42] or SMT solvers [51]), or use logic reasoning or search-based techniques directly on the level of graphs [69,75,76]

Objectives
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call