A Static Analysis of Non-confluent Triple Graph Grammars for Efficient Model Transformation

DOI10.1007/978-3-319-09108-2_9zbMath1423.68223OpenAlexW139971438MaRDI QIDQ3192232

Andy Schürr, Anthony Anjorin, Erhan Leblebici, Gabriele Taentzer

Publication date: 26 September 2014

Published in: Graph Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09108-2_9

zbMATH Keywords

static analysisbidirectionalitytriple graph grammars

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (1)

An efficient composition of bidirectional programs by memoization and lazy update

Uses Software

• Moflon

This page was built for publication: A Static Analysis of Non-confluent Triple Graph Grammars for Efficient Model Transformation