Using weakest application conditions to rank graph transformations for graph repair

DOI10.46298/LMCS-22(1:10)2026MaRDI QIDQ6840508zbMATH OpenFDO

Authors Lars G. Fritsche, Alexander Lauer, Andy Schürr, Gabriele Taentzer

Publication date 23 March 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-22(1:10)2026

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• Constructing optimized constraint-preserving application conditions for model transformation rules
• Correctness of high-level transformation systems relative to nested conditions
• Fundamentals of algebraic graph transformation
• Graph Transformations
• Graph-based specification and automated construction of ILP problems
• scientific article; zbMATH DE number 3854447 (Why is no real title available?)
• scientific article; zbMATH DE number 3633737 (Why is no real title available?)
• scientific article; zbMATH DE number 7456048 (Why is no real title available?)
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Rule-based graph repair

This page was built for publication: Using weakest application conditions to rank graph transformations for graph repair

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