article

Analysing graph transformation systems through constraint handling rules

Authors:

Thom FrÜhwirthAuthors Info & Claims

Theory and Practice of Logic Programming, Volume 11, Issue 1

Pages 65 - 109

https://doi.org/10.1017/S1471068410000438

Published: 01 January 2011 Publication History

Abstract

Graph transformation systems (GTS) and constraint handling rules (CHR) are non-deterministic rule-based state transition systems. CHR is well known for its powerful confluence and program equivalence analyses, for which we provide the basis in this work to apply them to GTS. We give a sound and complete embedding of GTS in CHR, investigate confluence of an embedded GTS and provide a program equivalence analysis for GTS via the embedding. The results confirm the suitability of CHR-based program analyses for other formalisms embedded in CHR.

References

[1]

ABDENNADHER, S. AND FRÜHWIRTH, T. 1999. Operational equivalence of CHR programs and constraints. In Principles and Practice of Constraint Programming, CP 1999, J. Jaffar, Ed. Lecture Notes in Computer Science, vol. 1713. Springer-Verlag, 43-57.

Digital Library

[2]

ABDENNADHER, S. AND FRÜHWIRTH, T. 2003. Integration and optimization of rule-based constraint solvers. In Logic Based Program Synthesis and Transformation, 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers, M. Bruynooghe, Ed. Lecture Notes in Computer Science, vol. 3018. Springer-Verlag, 198- 213.

[3]

ABDENNADHER, S., FRÜHWIRTH, T. AND MEUSS, H. 1999. Confluence and semantics of constraint simplification rules. Constraints 4, 2, 133-165.

Digital Library

[4]

ABDENNADHER, S. AND MARTE, M. 2000. University course timetabling using Constraint Handling Rules. In Special Issue on Constraint Handling Rules, C. Holzbaur and T. FrÜhwirth, Eds. Journal of Applied Artificial Intelligence, vol. 14(4). Taylor & Francis, 311-325.

[5]

ABDENNADHER, S. AND SOBHI, I. 2007. Generation of rule-based constraint solvers: Combined approach. In Logic-Based Program Synthesis and Transformation, 17th International Symposium, LOPSTR 2007, Kongens Lyngby, Denmark, August 23-24, 2007, Revised Selected Papers, A. King, Ed. Lecture Notes in Computer Science, vol. 4915. Springer-Verlag, 106- 120.

Digital Library

[6]

BAADER, F. AND NIPKOW, T. 1998. Term Rewriting and All That. Cambridge University Press, New York.

Digital Library

[7]

BAKEWELL, A., PLUMP, D. AND RUNCIMAN, C. 2003. Specifying pointer structures by graph reduction. In Applications of Graph Transformations with Industrial Relevance, Second International Workshop, AGTIVE 2003, Revised Selected and Invited Papers, J. L. Pfaltz, M. Nagl and B. Böhlen, Eds. Lecture Notes in Computer Science, vol. 3062. Springer-Verlag, Charlottesville, VA, 30-44.

[8]

BARRANCO-MENDOZA, A. 2005. Stochastic and Heuristic Modelling for Analysis of the Growth of Pre-Invasive Lesions and for a Multidisciplinary Approach to Early Cancer Diagnosis. PhD thesis, Simon Fraser University, Burnaby, Canada.

Digital Library

[9]

BAVARIAN, M. AND DAHL, V. 2006. Constraint based methods for biological sequence analysis. Journal of Universal Computer Science 12, 11, 1500-1520.

[10]

BETZ, H. 2007. Relating coloured Petri nets to Constraint Handling Rules. In CHR '07 (Porto, Portugal), K. Djelloul, G. J. Duck and M. Sulzmann, Eds. 33-47.

[11]

BETZ, H. AND FRÜHWIRTH, T. 2005. A Linear-Logic Semantics for Constraint Handling Rules. In Principles and Practice of Constraint Programming, 11th International Conference, CP 2005, P. van Beek, Ed. Lecture Notes in Computer Science, vol. 3709. Springer-Verlag, Sitges, Spain, 137-151.

[12]

BLOSTEIN, D., FAHMY, H., AND GRBAVEC, A. 1995. Practical use of graph rewriting. In Fifth Workshop on Graph Grammars and Their Application To Computer Science, J. E. Cuny, H. Ehrig, G. Engels and G. Rozenberg, Eds. Lecture Notes in Computer Science, vol. 1073. Springer-Verlag, 38-55.

Digital Library

[13]

DAHL, V. AND MAHARSHAK, E. 2009. DNA replication as a model for computational linguistics. In IWINAC '09: Proceedings of the Third International Work-Conference on the Interplay Between Natural and Artificial Computation, J. M. Mira, J. M. Ferrández, J. R. Álvarez, F. de la Paz and F. J. Toledo, Eds. Lecture Notes in Computer Science, vol. 5601. Springer-Verlag, 346-355.

Digital Library

[14]

DUCK, G. J., STUCKEY, P. J., AND BRAND, S. 2006. ACD term rewriting. In ICLP '06 (Seattle, Washington), S. Etalle and M. Truszczynski, Eds. Lecture Notes in Computer Science, vol. 4079. Springer-Verlag, 117-131.

Digital Library

[15]

DUCK, G. J., STUCKEY, P. J., AND SULZMANN, M. 2007. Observable confluence for constraint handling rules. In Logic Programming, 23rd International Conference, ICLP 2007, V. Dahl and I. Niemelä, Eds. Lecture Notes in Computer Science, vol. 4670. Springer-Verlag, Porto, Portugal, 224-239.

Digital Library

[16]

EHRIG, H., EHRIG, K., PRANGE, U. AND TAENTZER, G. 2006. Fundamentals of Algebraic Graph Transformation. Springer-Verlag.

[17]

EHRIG, H. AND KÖNIG, B. 2004. Deriving bisimulation congruences in the DPO approach to graph rewriting. In Foundations of Software Science and Computation Structures, 7th International Conference, FOSSACS 2004, I. Walukiewicz, Ed. Lecture Notes in Computer Science, vol. 2987. Springer-Verlag, Barcelona, Spain, 151-166.

[18]

FRÜHWIRTH, T. 2000. Proving termination of constraint solver programs. In Selected Papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Constraints, K. R. Apt, A. C. Kakas, E. Monfroy and F. Rossi, Eds. Lecture Notes in Computer Science, vol. 1865. Springer-Verlag, 298-317.

Digital Library

[19]

FRÜHWIRTH, T. 2005. Parallelizing union-find in constraint handling rules using confluence analysis. In Logic Programming, 21st International Conference, ICLP 2005, M. Gabbrielli and G. Gupta, Eds. Lecture Notes in Computer Science, vol. 3668. Springer-Verlag, 113-127.

Digital Library

[20]

FRÜHWIRTH, T. 2009. Constraint Handling Rules. Cambridge University Press.

Digital Library

[21]

HUET, G. 1980. Confluent reductions: Abstract properties and applications to term rewriting systems: Abstract properties and applications to term rewriting systems. Journal of the ACM 27, 4, 797-821.

Digital Library

[22]

KREOWSKI, H.-J. AND VALIENTE, G. 2000. Redundancy and subsumption in high-level replacement systems. In TAGT'98: Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations, H. G. Ehrig, G. Engels, H.-J. Kreowski and G. Rozenberg, Eds. Lecture Notes in Computer Science, vol. 1765. Springer-Verlag, 215-227.

Digital Library

[23]

LAM, E. S. AND SULZMANN, M. 2006. Towards Agent Programming in CHR. In CHR '06: Proc. 3rd Workshop on Constraint Handling Rules, T. Schrijvers and T. Frühwirth, Eds. K. U. Leuven, Tech. Rep. CW 452, 17-31.

[24]

LAM, E. S. AND SULZMANN, M. 2008. Finally, a comparison between Constraint Handling Rules and join-calculus. In CHR '08 (Hagenberg, Austria), T. Schrijvers, F. Raiser, and T. Frühwirth, Eds. RISC Report Series 08-10, University of Linz, Austria, 51-66.

[25]

LÖWE, M. 1993. Algebraic approach to single-pushout graph transformation. Theoretical Computer Science 109, 1&2, 181-224.

Digital Library

[26]

LÖWE, M. and MÜLLER, J. 1993. Algebraische Graphersetzung: mathematische Modellierung und Konfluenz. Tech. Rep. 93-37, Technische Universität, Berlin.

[27]

NEWMAN, M. 1942. On theories with a combinatorial definition of equivalence. Annals of Mathematics 43, 2, 223-242.

[28]

PILOZZI, P. AND DE SCHREYE, D. 2008. Termination analysis of CHR revisited. In ICLP '08, M. García de la Banda and E. Pontelli, Eds. Lecture Notes in Computer Science, vol. 5366. Springer-Verlag, 501-515.

Digital Library

[29]

PLUMP, D. 1995. On Termination of graph rewriting. In Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Proceedings, M. Nagl, Ed. Lecture Notes in Computer Science, vol. 1017. Aachen, Germany, 88-100.

Digital Library

[30]

PLUMP, D. 2005. Confluence of graph transformation revisited. In Processes, Terms and Cycles, A. Middeldorp, V. van Oostrom, F. van Raamsdonk and R. C. de Vrijer, Eds. Lecture Notes in Computer Science, vol. 3838. Springer-Verlag, 280-308.

Digital Library

[31]

PRETSCHNER, A., SLOTOSCH, O., AIGLSTORFER, E. AND KRIEBEL, S. 2004. Model-based testing for real. J. Software Tools for Technology Transfer (STTT) 5, 2-3, 140-157.

Digital Library

[32]

RAISER, F. 2007. Graph Transformation Systems in CHR. In Logic Programming, 23rd International Conference, ICLP 2007, V. Dahl and I. Niemelä, Eds. Lecture Notes in Computer Science, vol. 4670. Springer-Verlag, Porto, Portugal, 240-254.

Digital Library

[33]

RAISER, F. 2008. Semi-automatic generation of CHR solvers for global constraints. In Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, P. J. Stuckey, Ed. Lecture Notes in Computer Science, vol. 5202. Springer-Verlag, Sydney, Australia, 588-592.

Digital Library

[34]

RAISER, F. 2009. Research summary: Analysing graph transformation systems using extended methods from constraint handling rules. In Twenty-fifth International Conference on Logic Programming, ICLP, P. M. Hill and D. S. Warren, Eds. Lecture Notes in Computer Science, vol. 5649. Springer-Verlag, Pasadena, CA, 540-541.

Digital Library

[35]

RAISER, F., BETZ, H. AND FRÜHWIRTH, T. 2009. Equivalence of CHR states revisited. In Sixth International Workshop on Constraint Handling Rules (CHR), F. Raiser and J. Sneyers, Eds. K. U. Leuven, Tech. Rep. CW 555, 34-48.

[36]

RAISER, F. AND FRÜHWIRTH, T. 2009a. Operational equivalence of graph transformation systems. In Sixth International Workshop on Constraint Handling Rules (CHR), F. Raiser and J. Sneyers, Eds. K. U. Leuven, Tech. Rep. CW 555, 49-62.

[37]

RAISER, F. AND FRÜHWIRTH, T. 2009b. Strong joinability analysis for graph transformation systems in CHR. Electronic Notes in Theoretical Computer Science - Proceedings of the Fifth International Workshop on Computing with Terms and Graphs (TERMGRAPH 2009) 253, 4, 91-111.

Digital Library

[38]

RANGEL, G., LAMBERS, L., KÖNIG, B., EHRIG, H. AND BALDAN, P. 2008. Behavior preservation in model refactoring using DPO transformations with borrowed contexts. In Proceedings of ICGT '08 (International Conference on Graph Transformation). Lecture Notes in Computer Science, vol. 5214. Springer-Verlag, 242-256.

Digital Library

[39]

SNEYERS, J., VAN WEERT, P., SCHRIJVERS, T. AND DE KONINCK, L. 2010. As time goes by: Constraint Handling Rules - A survey of CHR research between 1998 and 2007. Theory and Practice of Logic Programming 10, 1, 1-47.

[40]

SULZMANN, M., SCHRIJVERS, T., AND STUCKEY, P. J. 2006. Principal type inference for GHC-style multi-parameter type classes. In APLAS '06: Proceedings of the Fourth Asian Symposium on Programming Languages and Systems (Sydney, Australia), N. Kobayashi, Ed. Lecture Notes in Computer Science, vol. 4279. Springer-Verlag, 26-43.

Digital Library

[41]

VAN WEERT, P. 2008. JCHR. URL: http://www.cs.kuleuven.be/~petervw/JCHR.

[42]

VAN WEERT, P., SNEYERS, J. AND DEMOEN, B. 2008. Aggregates for CHR through program transformation. In LOPSTR '07, Revised Selected Papers (Kongens Lyngby, Denmark), A. King, Ed. Lecture Notes in Computer Science, vol. 4915, 59-73.

Digital Library

[43]

VAN WEERT, P., SNEYERS, J., SCHRIJVERS, T. AND DEMOEN, B. 2006. Extending CHR with negation as absence. In CHR '06 (Venice, Italy), T. Schrijvers and T. Frühwirth, Eds. K. U. Leuven, Department of Computer Science, Tech. Rep. CW 452, 125-140.

[44]

VOETS, D., PILOZZI, P. AND DE SCHREYE, D. 2008. A New Approach to Termination Analysis of CHR. Tech. Rep. CW 506, K. U. Leuven, Department of Computer Science, Leuven, Belgium.

[45]

WASSERTHAL, M. 2009. An Extensible Platform for the Analysis of Graph Transformation Systems using Constraint Handling Rules. Diploma thesis, Ulm University, Ulm, Germany.

Cited By

Gall DFrühwirth T(2018)An Operational Semantics for the Cognitive Architecture ACT-R and Its Translation to Constraint Handling RulesACM Transactions on Computational Logic10.1145/321881819:3(1-42)Online publication date: 13-Sep-2018
https://dl.acm.org/doi/10.1145/3218818

Recommendations

Strong Joinability Analysis for Graph Transformation Systems in CHR

The notion of confluence is prevalent in graph transformation systems (GTS) as well as constraint handling rules (CHR). This work presents a generalized embedding of GTS in CHR that allows to consider strong derivations in confluence analyses. ...
Extending arbitrary solvers with constraint handling rules
PPDP '03: Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming

Constraint Handling Rules (CHRs) are a high-level committed choice programming language commonly used to write constraint solvers. While the semantic basis of CHRs allows them to extend arbitrary underlying constraint solvers, in practice, all current ...
Program Verification using Constraint Handling Rules and Array Constraint Generalizations^*
Special Issue on the 29th Italian Conference on Computational Logic: CILC 2014

The transformation of constraint logic programs (CLP programs) has been shown to be an effective methodology for verifying properties of imperative programs. By following this methodology, we encode the negation of a partial correctness property of an ...

Comments

Information & Contributors

Information

Published In

cover image Theory and Practice of Logic Programming

Theory and Practice of Logic Programming Volume 11, Issue 1

January 2011

138 pages

ISSN:1471-0684

Issue’s Table of Contents

Publisher

Cambridge University Press

United States

Publication History

Published: 01 January 2011

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Gall DFrühwirth T(2018)An Operational Semantics for the Cognitive Architecture ACT-R and Its Translation to Constraint Handling RulesACM Transactions on Computational Logic10.1145/321881819:3(1-42)Online publication date: 13-Sep-2018
https://dl.acm.org/doi/10.1145/3218818

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents