Titlebook: ;

Perigee

indubitable

Concepts for Specifying Complex Graph Transformation Systemse with large specifications showed that packages alone are not sufficient and therefore we have developed concepts for modularizing and coupling specifications. Our graph database provides the runtime-support required by these concepts.

违抗

地牢

Towards Graph Programs for Graph Algorithmst but can be exponential in the number of rule applications. The second program is a refinement of the first which is essentially deterministic and uses at most a quadratic number of rule applications.