home > publications > Graph Rewriting

Publications tagged "Graph Rewriting"

Automation CPS Certification Complexity Analysis Constraint Systems Cryptography EasyCrypt Expectation Transformers Formalization Functional Programming Graph Rewriting Hardness Haskell Higher-Order ICC ICCT Imperative Imperative Programming Interpretations Invariance Isabelle/HOL Layout-Randomization Memoization OCaml Path Orders Predicative Recursion Probabilistic Program Analysis Quantum Relational Logic Rewriting Runtime Complexity Analysis Security Sized-Types TCT Term Rewriting Termination Types
Show all.. Download:

2016

  • Martin Avanzini and Georg Moser. “Complexity of Acyclic Term Graph Rewriting”. 1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016, Porto, Portugal, June 22-26, 2016, volume 52 of LIPIcs, pages 10:1–10:18, (2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

2013

2010

  • Martin Avanzini and Georg Moser. “Complexity Analysis by Graph Rewriting”. Functional and Logic Programming, 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010. Proceedings, volume 6009 of Lecture Notes in Computer Science, pages 257–271, (2010). Springer.

  • Martin Avanzini and Georg Moser. “Closing the Gap Between Runtime Complexity and Polytime Computability”. Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010, Edinburgh, Scottland, UK, July 11-13, 2010, volume 6 of LIPIcs, pages 33–48, (2010). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.