From imperative to rule-based graph programs
DOI10.1016/J.JLAMP.2016.12.001zbMATH Open1362.68032OpenAlexW2573579185MaRDI QIDQ516038FDOQ516038
Authors: 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
Recommendations
computational completenessgraph transformationGP 2graph programsrandom access machinesrule-based programming
Theory of programming languages (68N15) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Introduction to algorithms.
- Title not available (Why is that?)
- A structural approach to operational semantics
- Parametrized complexity theory.
- Fundamentals of algebraic graph transformation
- Flow diagrams, turing machines and languages with only two formation rules
- Time bounded random access machines
- Title not available (Why is that?)
- A system of graph grammars which generates all recursively enumerable sets of labelled graphs
- Title not available (Why is that?)
- Hoare-style verification of graph programs
- The Graph Programming Language GP
- Visual modelling of complex systems: towards an abstract machine for PORGY
Cited In (11)
- Parallel rewriting of attributed graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Graph Programming Language GP
- Evolving graphs with semantic neutral drift
- A small-step operational semantics for GP 2
- Time and space measures for a complete graph computation model
- Graph Transformations
- Title not available (Why is that?)
- Verifying graph programs with monadic second-order logic
This page was built for publication: From imperative to rule-based graph programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516038)
