home > publications > Path Orders

Publications tagged "Path Orders"

Show all.. Download:

2013

2012

2011

  • Martin Avanzini, Naohi Eguchi and Georg Moser. “A Path Order for Rewrite Systems that Compute Exponential Time Functions”. Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, RTA 2011, May 30 - June 1, 2011, Novi Sad, Serbia, volume 10 of LIPIcs, pages 123–138, (2011). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

2009

  • Martin Avanzini and Georg Moser. “Dependency Pairs and Polynomial Path Orders”. Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brası́lia, Brazil, June 29 - July 1, 2009, Proceedings, volume 5595 of Lecture Notes in Computer Science, pages 48–62, (2009). Springer.

  • Martin Avanzini. “POP* and Semantic Labeling Using SAT”. (Preprint). Interfaces: Explorations in Logic, Language and Computation, ESSLLI 2008 and ESSLLI 2009 Student Sessions. Selected Papers, volume 6211 of Lecture Notes in Computer Science, pages 155–166, (2009). Springer.

  • M. Avanzini. “Automation of Polynomial Path Orders”. Masters thesis, University of Innsbruck, 2009.

2008

  • Martin Avanzini and Georg Moser. “Complexity Analysis by Rewriting”. Functional and Logic Programming, 9th International Symposium, FLOPS 2008, Ise, Japan, April 14-16, 2008. Proceedings, volume 4989 of Lecture Notes in Computer Science, pages 130–146, (2008). Springer.

  • Martin Avanzini, Georg Moser and Andreas Schnabl. “Automated Implicit Computational Complexity Analysis (System Description)”. Automated Reasoning, 4th International Joint Conference, IJCAR 2008, Sydney, Australia, August 12-15, 2008, Proceedings, volume 5195 of Lecture Notes in Computer Science, pages 132–138, (2008). Springer.