Formal Verification of Graph Grammars using Mathematical Induction

DOI10.1016/j.entcs.2009.05.044zbMath1347.68243OpenAlexW1989383032MaRDI QIDQ5179351

Leila Ribeiro, Simone André da Costa

Publication date: 19 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.05.044

zbMATH Keywords

formal verificationgraph grammarsmathematical induction

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (4)

Theorem proving graph grammars with attributes and negative application conditions ⋮ Interactive and automated proofs for graph transformations ⋮ Correct transformation: from object-based graph grammars to PROMELA ⋮ Verification of graph grammars using a logical approach

Uses Software

• Isabelle/HOL
• SPIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unfolding semantics of graph transformation
• Monadic second-order definable graph transductions: a survey
• Isabelle/HOL. A proof assistant for higher-order logic
• Modeling and Verifying Graph Transformations in Proof Assistants
• On the Use of Alloy to Analyze Graph Transformation Systems
• Handbook of Graph Grammars and Computing by Graph Transformation
• Graph Transformations
• Formal Methods for the Design of Real-Time Systems
• Formal Methods in Software and Systems Modeling
• Developments in Language Theory
• Formal Methods for Open Object-Based Distributed Systems

This page was built for publication: Formal Verification of Graph Grammars using Mathematical Induction