Incorporating Proofs in a Categorical Attributed Graph Transformation System for Software Modelling and Verification

This paper deals with model transformations based on attributed graphs transformation. Our approach is based on the categorical approach called Single Pushout. The principal goal being to strengthen the attribute computation part, we generalize our earlier approach based on the use of typed lambda-terms with inductive types and recursion to represent attributes and computation functions. The generalized approach takes terms in variable context as attributes and partial proofs as computation functions that permit to combine computation with proof development and verification. The intended domains of application are the development of cerified software models and semantics models for interactive proof development and verification.

[1]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[2]  Zhaohui Luo,et al.  Coercion completion and conservativity in coercive subtyping , 2001, Ann. Pure Appl. Log..

[3]  Louis Féraud,et al.  Typed lambda-terms in categorical attributed graph transformation , 2011, AMMSE.

[4]  Thierry Coquand,et al.  Inheritance as Implicit Coercion 1 , 1991 .

[5]  Bertrand Boisvert.  Graph Transformations , Proofs , and Grammars , 2013 .

[6]  Michael Löwe,et al.  Algebraic Approach to Single-Pushout Graph Transformation , 1993, Theor. Comput. Sci..

[7]  Marko C. J. D. van Eekelen,et al.  Term Graph Rewriting , 1987, PARLE.

[8]  Hartmut Ehrig,et al.  Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation , 2006, Fundam. Informaticae.

[9]  Zhaohui Luo,et al.  Computation and reasoning - a type theory for computer science , 1994, International series of monographs on computer science.

[10]  Christian Percebois,et al.  Attribute Computations in the DPoPb Graph Transformation Engine , 2010, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[11]  Benoît Combemale,et al.  Formally defining and iterating infinite models , 2012, MODELS'12.

[12]  Louis Féraud,et al.  Computations in Graph Rewriting: Inductive Types and Pullbacks in DPO Approach , 2009, CEE-SET.

[13]  David Chemouil,et al.  Isomorphisms of simple inductive types through extensional rewriting , 2005, Mathematical Structures in Computer Science.

[14]  Alan Bundy,et al.  The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.

[15]  Fernando Orejas,et al.  Symbolic graphs for attributed graph constraints , 2011, J. Symb. Comput..

[16]  Jean Bézivin,et al.  Model Transformations in Practice Workshop , 2005, MoDELS.

[17]  Zhaohui Luo.  Coercions in a polymorphic type system , 2008, Math. Struct. Comput. Sci..

[18]  Louis Féraud,et al.  A Unified Categorical Approach for Attributed Graph Rewriting , 2008, CSR.

[19]  A. J. Nijman,et al.  PARLE Parallel Architectures and Languages Europe , 1987, Lecture Notes in Computer Science.

[20]  Maxime Rebout,et al.  Une approche catégorique unifiée pour la récriture de graphes attribués , 2008 .

[21]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series) , 1992 .

[22]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .