Graph

Business

Mathematics

Computer science

Domain-specific language

Marketing

Satisfiability modulo theories

Solver

Scalability

Benchmarking

Theoretical computer science

Domain (mathematical analysis)

Mathematical analysis

Programming language

Database

Metamodeling

Many testing and benchmarking scenarios in software and systems engineering depend on the systematic generation of graph models. For instance, tool qualification necessitated by safety standards would require a large set of consistent (well-formed or malformed) instance models specific to a domain. However, automatically generating consistent graph models which comply with a metamodel and satisfy all well-formedness constraints of industrial domains is a significant challenge. 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 refinement of partial models, shape analysis, incremental graph query evaluation, and rule-based design space exploration to provide a more efficient guidance. Our initial performa...

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