Pages that link to "Item:Q4951113"

The following pages link to Handbook of Graph Grammars and Computing by Graph Transformation (Q4951113):

Displaying 41 items.

• Amalgamation of domain specific languages with behaviour (Q347380) (← links)
• Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs (Q418014) (← links)
• Polynomial graph transformability (Q418788) (← links)
• Learning an efficient constructive sampler for graphs (Q511780) (← links)
• Algebraic hierarchical graph transformation (Q596311) (← links)
• Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
• A formalisation of deep metamodelling (Q736852) (← links)
• Reactive systems, (semi-)saturated semantics and coalgebras on presheaves (Q843097) (← links)
• Attributed graph transformation with node type inheritance (Q882448) (← links)
• Programming with narrowing: a tutorial (Q968524) (← links)
• Automating the transformation-based analysis of visual languages (Q973037) (← links)
• Adaptive star grammars and their languages (Q986544) (← links)
• Towards automated software model checking using graph transformation systems and bogor (Q1049792) (← links)
• A rewriting approach to binary decision diagrams (Q1349250) (← links)
• On congruences of automata defined by directed graphs (Q1399978) (← links)
• Criteria to disprove context freeness of collage languages. (Q1401171) (← links)
• Tree-based picture generation (Q1583092) (← links)
• Formal software specification with refinements and modules of typed graph transformation systems (Q1608315) (← links)
• Hierarchical graph transformation (Q1608318) (← links)
• Graph grammars according to the type of input and manipulated data: a survey (Q1750316) (← links)
• Compiling dyadic first-order specifications into map algebra (Q1870581) (← links)
• Reducibility between classes of port graph grammar. (Q1872703) (← links)
• A structural approach to graph transformation based on symmetric Petri nets (Q2035652) (← links)
• Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars (Q2117263) (← links)
• Rule-based transformation of graph rewriting rules: towards higher-order graph grammars (Q2355681) (← links)
• Theorem proving graph grammars with attributes and negative application conditions (Q2358623) (← links)
• Using Graph Grammar Systems with Memory in Computer Aided Design (Q2814381) (← links)
• Transformation of Shaped Nested Graphs and Diagrams1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph). (Q2841248) (← links)
• GS·Λ Theories (Q2842817) (← links)
• Verification of Random Graph Transformation Systems (Q2867889) (← links)
• Modeling Pointer Redirection as Cyclic Term-graph Rewriting (Q2867899) (← links)
• Undecidable Control Conditions in Graph Transformation Units (Q2873611) (← links)
• On Term-Graph Rewrite Strategies (Q2873679) (← links)
• The Edge of Graph Transformation — Graphs for Behavioural Specification (Q3059705) (← links)
• Graph Transformation by Computational Category Theory (Q3059706) (← links)
• Autonomous Units and Their Semantics – The Concurrent Case (Q3059708) (← links)
• Graph Transformation with Dependencies for the Specification of Interactive Systems (Q3184727) (← links)
• Adhesive and quasiadhesive categories (Q5313719) (← links)
• Towards a Notion of Transaction in Graph Rewriting (Q5404174) (← links)
• Graph Transformation Semantics for a QVT Language (Q5404176) (← links)
• The York Abstract Machine (Q5404181) (← links)