Formalising the double-pushout approach to graph transformation
From MaRDI portal
Publication:6635513
DOI10.46298/lmcs-20(4:3)2024MaRDI QIDQ6635513
[[Person:6198041|Author name not available (Why is that?)]], Detlef Plump
Publication date: 12 November 2024
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Elements of finite model theory.
- Deriving graphs from graphs by applying a production
- A graph library for Isabelle
- Verifying graph programs with monadic second-order logic
- From LCF to Isabelle/HOL
- Theorem proving graph grammars with attributes and negative application conditions
- Fundamentals of algebraic graph transformation
- Double-pushout graph transformation revisited
- Concrete Semantics
- Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL
- The Four Colour Theorem: Engineering of a Formal Proof
- Pushout-Properties: An analysis of gluing constructions for graphs
- Interactive and automated proofs for graph transformations
- Logic in Computer Science
- A formally verified proof of the prime number theorem
- A FORMAL PROOF OF THE KEPLER CONJECTURE
- Foundations of Software Science and Computation Structures
- Proceedings of the Thirteenth International Workshop on Graph Computation Models
- Mechanised DPO theory: uniqueness of derivations and Church-Rosser theorem
- Formalising the double-pushout approach to graph transformation
Related Items (1)
This page was built for publication: Formalising the double-pushout approach to graph transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635513)
