A unified categorical approach for attributed graph rewriting

Attributed graphs are often used in software engineering. Mainly algorithms concerning programs and models transformations are based on rewriting techniques. We suggest a unified categorical approach for the description and the verification of such algorithms and programs. This contribution which is a generalization of the double pushout approach can be seen as a mix between pushout and pullback. This will facilitate the computations on attributes within a unified framework. It should be particularly helpful for model to model transformation in the domain of "Model Driven Architecture".