Graph Transformations

DOI10.1007/B100934MaRDI QIDQ5292591zbMATH OpenOpenAlexFDO

Authors Detlef Plump, Sandra Steinert

Publication date 21 June 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100934

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The Graph Programming Language GP
• From imperative to rule-based graph programs
• A Hoare calculus for graph programs
• Dijkstra graphs
• Hoare-style verification of graph programs

Cited in

(17)

• The PBPO graph transformation approach
• Parallel rewriting of attributed graphs
• Dijkstra graphs
• Modeling pointer redirection as cyclic term-graph rewriting
• scientific article; zbMATH DE number 4162284 (Why is no real title available?)
• Graph Transformation Units – An Overview
• The Graph Programming Language GP
• scientific article; zbMATH DE number 1305093 (Why is no real title available?)
• scientific article; zbMATH DE number 512937 (Why is no real title available?)
• scientific article; zbMATH DE number 1923047 (Why is no real title available?)
• Parallel independence in attributed graph rewriting
• Preserving consistency in geometric modeling with graph transformations
• JGraphT—A Java Library for Graph Data Structures and Algorithms
• From imperative to rule-based graph programs
• An algorithm for approximating the satisfiability problem of high-level conditions
• The York Abstract Machine
• Linear-time graph algorithms in GP 2

Describes a project that uses

Uses Software

• PLUMP
• PROGRES

This page was built for publication: Graph Transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5292591)