Warren's abstract machine: a tutorial reconstruction
Warren's abstract machine: a tutorial reconstruction
Theories of programming languages
Theories of programming languages
The PROGRES approach: language and environment
Handbook of graph grammars and computing by graph transformation
The AGG approach: language and environment
Handbook of graph grammars and computing by graph transformation
Proceedings of the 22nd international conference on Software engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph Pattern Matching in PROGRES
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Computational Completeness of Programming Languages Based on Graph Transformation
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
An Overview of the GXL Graph Exchange Language
Revised Lectures on Software Visualization, International Seminar
Relabelling in Graph Transformation
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Chaos and Fractals
Algorithm Design
prefuse: a toolkit for interactive information visualization
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Semantics with Applications: An Appetizer (Undergraduate Topics in Computer Science)
Semantics with Applications: An Appetizer (Undergraduate Topics in Computer Science)
Electronic Notes in Theoretical Computer Science (ENTCS)
Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools
Applications of Graph Transformations with Industrial Relevance
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Formally specified type checkers for domain specific languages: experience report
Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
A hoare calculus for graph programs
ICGT'10 Proceedings of the 5th international conference on Graph transformations
PORGY: A Visual Graph Rewriting Environment for Complex Systems
Computer Graphics Forum
A strategy language for graph rewriting
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Elixir: a system for synthesizing concurrent graph programs
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Hoare-Style Verification of Graph Programs
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
A visual token-based formalization of BPMN 2.0 based on in-place transformations
Information and Software Technology
M,N-adhesive transformation systems
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Verification of graph programs
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handling low-level data structures. The core of GP consists of four constructs: single-step application of a set of conditional graph-transformation rules, sequential composition, branching and iteration. This paper gives an overview on the GP project. We introduce the language by discussing a sequence of small programming case studies, formally explain conditional rule schemata which are the building blocks of programs, and present a semantics for GP in the style of structural operational semantics. A special feature of the semantics is how it uses the notion of finitely failing programs to define powerful branching and iteration commands. We also describe GP's prototype implementation.