home > publications > Graph Rewriting

Publications tagged "Graph Rewriting"

Automation CPS Certification Complexity Analysis Constraint Systems Functional Programming Graph Rewriting Haskell Higher-Order ICC ICCT Imperative Imperative Programming Interpretations Invariance Memoization OCaml Path Orders Predicative Recursion Probabilistic Program Analysis Runtime Complexity Analysis Sized-Types TCT Term Rewriting Termination Types
Show all.. Download:

2016

  • M. Avanzini and G. Moser. “Complexity of Acyclic Term Graph Rewriting”. Proceedings of the 1th International Conference on Formal Structures for Computation and Deduction, volume 52 of Leibnitz International Proceedings in Informatics, pages 10:1–10:18, 2016. Leibnitz Zentrum für Informatik. © Creative Commons License - ND.

2013

2010

  • M. Avanzini and G. Moser. “Complexity Analysis by Graph Rewriting”. (Preprint). Proceedings of the 10th International Symposium on Functional and Logic Programming, volume 6009 of Lecture Notes in Computer Science, pages 257–271, 2010. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.

  • M. Avanzini and G.Moser. “Closing the Gap Between Runtime Complexity and Polytime Computability”. Proceedings of the 21st International Conference on Rewriting Techniques and Applications, volume 6 of Leibnitz International Proceedings in Informatics, pages 33–48, 2010. Leibnitz Zentrum für Informatik. © Creative Commons License - ND.