Evaluation Diversity for Graph Conditions

Abstract

Graphs are used as a universal data structure in various domains. Sets of graphs (and likewise graph morphisms) can be specified using the graph logic of Graph Conditions (GCs). The evaluation of a graph against a GC results in a satisfaction judgement on whether the graph is specified by the GC. is as expressive as first-order logic on graphs and infinitely many graphs may be evaluated against a given GC. Therefore, a complete compact overview of how a given GC may be evaluated for varying graphs can support GC validation, testing, debugging, and repair.As a main contribution, we generate such an overview for a given GC in the form of a complete finite set of diverse evaluations for varying associated graphs formally given by so called Evaluation Trees (ETs). Each of these ETs concretely describes how its associated graph is evaluated against the given GC by presenting each evaluation step. The returned ETs are complete since each possible ET subsumes one of the returned ETs and diverse by not containing superfluous ETs subsuming smaller ETs. We apply an implementation of our ET generation procedure in the tool to a running example.KeywordsGraph logicGraph conditionsLogic coverageCoverage criteriaModel generationValidationDebugging