Validating Rule-based Algorithms

A rule-based system is a series of if-then statements that utilizes a set of assertions, to which rules are created on how to act upon those assertions. Rule-based systems often construct the basis of software artifacts which can provide answers to problems in place of human experts. Such systems are also referred as expert systems. Rule-based solutions are also widely applied in artificial intelligence-based systems, and graph rewriting is one of the most frequently applied implementation techniques for their realization. As the necessity for reliable rule-based systems increases, so emerges the field of research regarding verification and validation of graph rewriting-based approaches. Verification and validation indicate determining the accuracy of a model transformation / rule-based system, and ensure that the processing output satisfies specific conditions. This paper introduces the concept of taming the complexity of these verification/validation solutions by starting with the most general case and moving towards more specific solutions. Furthermore, we provide a dynamic (online) method to support the validation of algorithms designed and executed in rule-based systems. The proposed approach is based on a graph rewriting-based solution.

[1]  Bernhard Schätz,et al.  Formalization and Rule-Based Transformation of EMF Ecore-Based Models , 2009, SLE.

[2]  Reiko Heckel,et al.  Verification of Architectural Refactorings by Rule Extraction , 2008, FASE.

[3]  Gabriele Taentzer,et al.  Efficient parsing of visual languages based on critical pair analysis and contextual layered graph transformation , 2000, Proceeding 2000 IEEE International Symposium on Visual Languages.

[4]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[5]  Juan de Lara,et al.  Event-driven grammars: relating abstract and concrete levels of visual languages , 2007, Software & Systems Modeling.

[6]  Reiko Heckel,et al.  Graph Grammars with Negative Application Conditions , 1996, Fundam. Informaticae.

[7]  Dorothea Blostein,et al.  Issues in the Practical Use of Graph Rewriting , 1994, TAGT.

[8]  Stuart Kent,et al.  A Relational Approach to Defining Transformations in a Metamodel , 2002, UML.

[9]  Andy Schürr,et al.  Specification of Graph Translators with Triple Graph Grammars , 1994, WG.

[10]  Gabriele Taentzer,et al.  Formal foundation of consistent EMF model transformations by algebraic graph transformation , 2011, Software & Systems Modeling.

[11]  Juan de Lara,et al.  Meta-modelling and graph grammars for multi-paradigm modelling in AToM3 , 2004, Software & Systems Modeling.

[12]  Tom Mens,et al.  A Taxonomy of Model Transformation , 2006, GRaMoT@GPCE.

[13]  Dániel Varró,et al.  Model Checking Graph Transformations: A Comparison of Two Approaches , 2004, ICGT.

[14]  Ákos Lédeczi,et al.  Raising the Abstraction of Domain-Specific Model Translator Development , 2009, 2009 16th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems.

[15]  Márk Asztalos,et al.  Architectural Design Patterns for Language Parsers , 2014 .

[16]  Frederick Hayes-Roth,et al.  Rule-based systems , 1985, CACM.

[17]  Dániel Varró,et al.  Automated formal verification of visual modeling languages by model checking , 2004, Software & Systems Modeling.

[18]  Gabor Karsai,et al.  Towards Verifying Model Transformations , 2008, GT-VMT@ETAPS.

[19]  Juan de Lara,et al.  Automated Model Transformation and Its Validation Using AToM 3 and AGG , 2004, Diagrams.

[20]  Tony Williams,et al.  Rule-Based Systems , 1988, Encyclopedia of Social Network Analysis and Mining.

[21]  Márk Asztalos,et al.  Formal specification and analysis of functional properties of graph rewriting‐based model transformation , 2013, Softw. Test. Verification Reliab..