Knowledge-Based graph exploration analysis

  • Authors:
  • Ismênia Galvão;Eduardo Zambon;Arend Rensink;Lesley Wevers;Mehmet Aksit

  • Affiliations:
  • Software Engineering Group, University of Twente, The Netherlands;Formal Methods and Tools Group, Computer Science Department, University of Twente, Enschede, The Netherlands;Formal Methods and Tools Group, Computer Science Department, University of Twente, Enschede, The Netherlands;Formal Methods and Tools Group, Computer Science Department, University of Twente, Enschede, The Netherlands;Software Engineering Group, University of Twente, The Netherlands

  • Venue:
  • AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a context where graph transformation is used to explore a space of possible solutions to a given problem, it is almost always necessary to inspect candidate solutions for relevant properties. This means that there is a need for a flexible mechanism to query not only graphs but also their evolution. In this paper we show how to use Prolog queries to analyse graph exploration. Queries can operate both on the level of individual graphs and on the level of the transformation steps, enabling a very powerful and flexible analysis method. This has been implemented in the graph-based verification tool groove. As an application of this approach, we show how it gives rise to a competitive analysis technique in the domain of feature modelling.