Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
The PROGRES approach: language and environment
Handbook of graph grammars and computing by graph transformation
The GNU Prolog system and its implementation
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Software Product Line Engineering: Foundations, Principles and Techniques
Software Product Line Engineering: Foundations, Principles and Techniques
Augur 2 --- A New Version of a Tool for the Analysis of Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Applying formal methods to gossiping networks with mCRL and groove
ACM SIGMETRICS Performance Evaluation Review
Formal modelling of feature configuration workflows
Proceedings of the 13th International Software Product Line Conference
Automated analysis of feature models 20 years later: A literature review
Information Systems
Automated reasoning on feature models
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
Modelling and analysis using GROOVE
International Journal on Software Tools for Technology Transfer (STTT)
Feature models, grammars, and propositional formulas
SPLC'05 Proceedings of the 9th international conference on Software Product Lines
Weakest preconditions for high-level programs
ICGT'06 Proceedings of the Third international conference on Graph Transformations
A survey and comparison of transformation tools based on the transformation tool contest
Science of Computer Programming
Hi-index | 0.00 |
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.