Analysis of graph transformation systems: native vs translation-based techniques
From MaRDI portal
Publication:5020535
Authors: R. Heckel, Leen Lambers, Maryam Ghaffari Saadat 
Publication date: 6 January 2022
Full work available at URL: https://arxiv.org/abs/1912.09607
Recommendations
- On the Use of Alloy to Analyze Graph Transformation Systems
- Formal verification of invariants for attributed graph transformation systems based on nested attributed graph conditions
- Preface to the special issue on the 10th international conference on graph transformation
- Analysing graph transformation systems through constraint handling rules
- Formal Methods in Software and Systems Modeling
Cites Work
- Title not available (Why is that?)
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Isabelle/HOL. A proof assistant for higher-order logic
- Formal techniques for distributed systems. Joint IFIP WG 6.1 international conference, FMOODS/FORTE 2013, held as part of the 8th international federated conference on distributed computing techniques, DisCo Tec 2013, Florence, Italy, June 3--5, 2013. Proceedings
- Title not available (Why is that?)
- Lemma Learning in the Model Evolution Calculus
- Correctness of high-level transformation systems relative to nested conditions
- Verification of graph transformation systems with context-free specifications
- Fundamentals of algebraic graph transformation
- Local Confluence for Rules with Nested Application Conditions
- Towards the Verification of Attributed Graph Transformation Systems
- On the Use of Alloy to Analyze Graph Transformation Systems
- Graph Transformations
- Hoare-style verification of graph programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Resolution-Like Theorem Proving for High-Level Conditions
- Title not available (Why is that?)
- Constructing optimized validity-preserving application conditions for graph transformation rules
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Transformations
- Termination Analysis of Model Transformations by Petri Nets
- Theoretical Aspects of Computing – ICTAC 2005
- Title not available (Why is that?)
- Critical pairs in term graph rewriting
- Verifying graph transformation systems with description logics
- Initial conflicts and dependencies: critical pairs revisited
- Modular termination of graph transformation
- Towards the automated generation of consistent, diverse, scalable and realistic graph models
- Symbolic model generation for graph properties
- Interactive and automated proofs for graph transformations
- Rewriting abstract structures: materialization explained categorically
- Sound and complete abstract graph transformation
- Development of Correct Graph Transformation Systems
- Title not available (Why is that?)
- Graph transformation units guided by a SAT solver
Cited In (7)
Uses Software
This page was built for publication: Analysis of graph transformation systems: native vs translation-based techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020535)
