Combining termination proofs in model transformation systems
From MaRDI portal
Publication:5740376
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
Cites work
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 1437942 (Why is no real title available?)
- Combining termination criteria by isolating deletion
- Finitary \(\mathcal{M}\)-adhesive categories
- Fundamentals of algebraic graph transformation
- Termination Analysis of Model Transformations by Petri Nets
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)
