Similar Items: Formalising the Double-Pushout Approach to Graph Transformation
- Formalising the pi-calculus using nominal logic
- Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda
- A higher-order transformation approach to the formalization and analysis of BPMN using graph transformation systems
- Using weakest application conditions to rank graph transformations for graph repair
- Termination of Graph Transformation Systems via Generalized Weighted Type Graphs
- FORMALISING THE LOGIC OF SPATIAL QUALIFICATION USING A QUALITATIVE REASONING APPROACH