From imperative to rule-based graph programs

DOI10.1016/J.JLAMP.2016.12.001zbMath1362.68032OpenAlexW2573579185MaRDI QIDQ516038

Detlef Plump

Publication date: 20 March 2017

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://eprints.whiterose.ac.uk/110721/1/1_s2.0_S2352220816301675_main.pdf

zbMATH Keywords

computational completenessgraph transformationGP 2graph programsrandom access machinesrule-based programming

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of programming languages (68N15)

Related Items (6)

Evolving graphs with semantic neutral drift ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parallel rewriting of attributed graphs ⋮ Unnamed Item ⋮ Verifying graph programs with monadic second-order logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A system of graph grammars which generates all recursively enumerable sets of labelled graphs
• Time bounded random access machines
• A structural approach to operational semantics
• Parametrized complexity theory.
• Fundamentals of algebraic graph transformation
• Hoare-Style Verification of Graph Programs
• The Graph Programming Language GP
• Visual Modelling of Complex Systems: Towards an Abstract Machine for PORGY
• Flow diagrams, turing machines and languages with only two formation rules

This page was built for publication: From imperative to rule-based graph programs