Combining termination proofs in model transformation systems

DOI10.1017/S0960129512000369zbMATH Open1342.68175MaRDI QIDQ5740376FDOQ5740376

Authors: Dénes Bisztray, R. Heckel 

Publication date: 26 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Recommendations

• Towards verifying model transformations
• scientific article; zbMATH DE number 1538014
• Transformational methodology for proving termination of logic programs
• On the Specification and Verification of Model Transformations
• Combining Model Checking and Deduction
• Towards a systematic method for proving termination of graph transformation systems
• A framework for model transformation verification
• scientific article; zbMATH DE number 408817
• Modeling and proving Grafcets with transition systems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Fundamentals of algebraic graph transformation
• Title not available (Why is that?)
• Finitary \(\mathcal{M}\)-adhesive categories
• Termination Analysis of Model Transformations by Petri Nets
• Combining termination criteria by isolating deletion

Cited In (6)

• Termination Analysis of Model Transformations by Petri Nets
• Termination and expressiveness of execution strategies for networks of bidirectional model transformations
• Finding a universal execution strategy for model transformation networks
• Fundamental Approaches to Software Engineering
• Combining termination criteria by isolating deletion
• Diagrammatic Representation and Inference

This page was built for publication: Combining termination proofs in model transformation systems

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