Analysing graph transformation systems through constraint handling rules

DOI10.1017/S1471068410000438MaRDI QIDQ3087810zbMATH OpenFDO

Authors Frank Raiser, Thom Frühwirth

Publication date 17 August 2011

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S1471068410000438

zbMATH Keywords

constraint handling rulesgraph transformation systemsprogram analysis

Mathematics Subject Classification ID

Logic programming (68N17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Graph Transformation Systems in CHR
• Strong Joinability Analysis for Graph Transformation Systems in CHR
• A Transformational Approach for Proving Properties of the CHR Constraint Store
• Well-structured graph transformation systems
• Logic Programming

Cites work

• Term Rewriting and All That

Cited in

(11)

• Exploring conflict reasons for graph transformation systems
• A linear logic programming language for concurrent programming over graph structures
• Combining forward and backward propagation
• Realizing Graph Transformations by Pre- and Postconditions and Command Sequences
• Graph Transformation Systems in CHR
• scientific article; zbMATH DE number 1863175 (Why is no real title available?)
• Delaying Constraint Solving in Symbolic Graph Transformation
• Analysis of graph transformation systems: native vs translation-based techniques
• Strong Joinability Analysis for Graph Transformation Systems in CHR
• Constraint-preserving architecture transformations: A graph rewriting approach
• Constructing optimized constraint-preserving application conditions for model transformation rules

This page was built for publication: Analysing graph transformation systems through constraint handling rules

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