Graph Transformations

DOI10.1007/B100934zbMATH Open1116.68560OpenAlexW4214712303MaRDI QIDQ5292591FDOQ5292591

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

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

Mathematics Subject Classification ID

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

Cited In (16)

• Parallel rewriting of attributed graphs
• The PBPO graph transformation approach
• Title not available (Why is that?)
• Preserving consistency in geometric modeling with graph transformations
• Title not available (Why is that?)
• JGraphT—A Java Library for Graph Data Structures and Algorithms
• Title not available (Why is that?)
• The Graph Programming Language GP
• An algorithm for approximating the satisfiability problem of high-level conditions
• Title not available (Why is that?)
• Graph Transformation Units – An Overview
• Dijkstra graphs
• Title not available (Why is that?)
• Modeling pointer redirection as cyclic term-graph rewriting
• From imperative to rule-based graph programs
• The York Abstract Machine

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)