Computational completeness of programming languages based on graph transformation

DOI10.1007/3-540-45315-6_15MaRDI QIDQ2769432zbMATH OpenFDO

Authors Detlef Plump, Annegret Habel

Publication date 5 February 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2030/20300230

Mathematics Subject Classification ID

Theory of programming languages (68N15) Grammars and rewriting systems (68Q42)

Recommendations

• From imperative to rule-based graph programs
• Graph Transformation by Computational Category Theory
• Reasoning about graph programs
• scientific article; zbMATH DE number 1231497
• Graph transformation for specification and programming

Cited in

(22)

• Context-sensitive fusion grammars and fusion grammars with forbidden context are universal
• Monadic second-order incorrectness logic for GP 2
• A calculus of concurrent graph-rewriting processes
• Modeling pointer redirection as cyclic term-graph rewriting
• Undecidable control conditions in graph transformation units
• Rewriting strategies and strategic rewrite programs
• High-Level Programs and Program Conditions
• Resolution-Like Theorem Proving for High-Level Conditions
• Graph Multiset Transformation as a Framework for Massively Parallel Computation
• Development of Correct Graph Transformation Systems
• Strategic port graph rewriting: an interactive modelling framework
• GETGRATS: a summary of scientific results (with annotated bibliography)
• Transformation of Turing machines into context-dependent fusion grammars
• Rule-based graph repair
• Preserving consistency in geometric modeling with graph transformations
• From imperative to rule-based graph programs
• Completeness of Conversion between Reactive Programs for Ultrametric Models
• An algorithm for approximating the satisfiability problem of high-level conditions
• The York Abstract Machine
• Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing
• A foundation for functional graph programs: the \textit{graph transformation control algebra} (GTA)
• Finding the right way to Rome: effect-oriented graph transformation

Describes a project that uses

Uses Software

• DACTL
• PROGRES

This page was built for publication: Computational completeness of programming languages based on graph transformation

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