Verification of graph transformation systems with context-free specifications

DOI10.1007/978-3-642-15928-2_8MaRDI QIDQ4931307zbMATH OpenOpenAlexFDO

Authors Barbara König, Javier Esparza

Publication date 4 October 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15928-2_8

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1863175
• Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations
• A framework for the verification of infinite-state graph transformation systems
• scientific article; zbMATH DE number 2090850
• scientific article; zbMATH DE number 2016064

Cited in

(11)

• Formal software specification with refinements and modules of typed graph transformation systems
• Monadic second-order incorrectness logic for GP 2
• Incorrectness logic for graph programs
• scientific article; zbMATH DE number 1615264 (Why is no real title available?)
• Verifying a behavioural logic for graph transformation systems
• Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations
• Proceedings of the workshop on graph transformation for concurrency and verification (GT-VC 2006), Bonn, Germany, August 31, 2006
• Analysis of graph transformation systems: native vs translation-based techniques
• On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
• Tools and Algorithms for the Construction and Analysis of Systems
• A framework for the verification of infinite-state graph transformation systems

This page was built for publication: Verification of graph transformation systems with context-free specifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4931307)