Development of Correct Graph Transformation Systems

DOI10.1007/978-3-540-87405-8_48zbMATH Open1175.68230OpenAlexW2141017646MaRDI QIDQ3540429FDOQ3540429

Authors: Karl-Heinz Pennemann 

Publication date: 20 November 2008

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

Full work available at URL: http://oops.uni-oldenburg.de/884/1/pendev09.pdf

Recommendations

• Correctness of high-level transformation systems relative to nested conditions
• Verifying graph transformation systems with description logics
• Publication:5748897
• Proving correctness of logically decorated graph rewriting systems
• Graph transformation for specification and programming

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Formal Methods in Software and Systems Modeling
• Correctness of high-level transformation systems relative to nested conditions
• Title not available (Why is that?)
• Graph-based specification of access control policies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph Transformations
• Theory of constraints and application conditions: from graphs to high-level structures
• Satisfiability of High-Level Conditions
• Weakest Preconditions for High-Level Programs
• An algorithm for approximating the satisfiability problem of high-level conditions

Cited In (14)

• The Edge of Graph Transformation — Graphs for Behavioural Specification
• Translating essential OCL invariants to nested graph constraints focusing on set operations
• Proving correctness of logically decorated graph rewriting systems
• Title not available (Why is that?)
• Correctness of high-level transformation systems relative to nested conditions
• Decidability of Resilience for Well-Structured Graph Transformation Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Initial conflicts for transformation rules with nested application conditions
• Analysis of graph transformation systems: native vs translation-based techniques
• Resilience of well-structured graph transformation systems
• Lessons Learned from Building a Graph Transformation System

Uses Software

• VAMPIRE
• TPTP
• Mace4
• Augur 2
• GROOVE

This page was built for publication: Development of Correct Graph Transformation Systems

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