scientific article; zbMATH DE number 7453086

MaRDI QIDQ5020535

Maryam Ghaffari Saadat, Reiko Heckel, Leen Lambers

Publication date: 6 January 2022

Full work available at URL: https://arxiv.org/abs/1912.09607

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Computational category-theoretic rewriting ⋮ Unnamed Item

Uses Software

• Isabelle/HOL
• VAMPIRE
• SPIN
• z3
• Maude
• Augur 2
• CheckVML
• Henshin
• OCL2AC
• DrAGoM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• 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
• 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
• Rewriting abstract structures: materialization explained categorically
• Constructing optimized validity-preserving application conditions for graph transformation rules
• Specifying graph languages with type graphs
• Fundamentals of algebraic graph transformation
• Hoare-Style Verification of Graph Programs
• Sound and Complete Abstract Graph Transformation
• Resolution-Like Theorem Proving for High-Level Conditions
• Towards the Verification of Attributed Graph Transformation Systems
• Development of Correct Graph Transformation Systems
• Termination Analysis of Model Transformations by Petri Nets
• On the Use of Alloy to Analyze Graph Transformation Systems
• Correctness of high-level transformation systems relative to nested conditions
• Interactive and automated proofs for graph transformations
• Graph Transformation Units Guided by a SAT Solver
• Verification of Graph Transformation Systems with Context-Free Specifications
• Local Confluence for Rules with Nested Application Conditions
• Critical pairs in term graph rewriting
• Symbolic Model Generation for Graph Properties
• Graph Transformations
• Graph Transformations
• Lemma Learning in the Model Evolution Calculus
• Theoretical Aspects of Computing – ICTAC 2005

This page was built for publication: