2020

• Martin Avanzini, Ugo Dal Lago and Akihisa Yamada. “On probabilistic term rewriting”. Sci. Comput. Program. 185 (2020)

2018

• Martin Avanzini and Ugo Dal Lago. “On sharing, memoization, and polynomial time”. Inf. Comput. 261: 3–22 (2018)

• Martin Avanzini, Ugo Dal Lago and Akihisa Yamada. “On Probabilistic Term Rewriting”. Functional and Logic Programming - 14th International Symposium, FLOPS 2018, Nagoya, Japan, May 9-11, 2018, Proceedings, volume 10818 of Lecture Notes in Computer Science, pages 132–148, (2018). Springer.

2016

• Martin Avanzini and Georg Moser. “A Combination Framework for Complexity”. Inf. Comput. 248: 22–55 (2016)

• Martin Avanzini, Georg Moser and Michael Schaper. “TcT: Tyrolean Complexity Tool”. Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, volume 9636 of Lecture Notes in Computer Science, pages 407–423, (2016). Springer.

2015

• M. Avanzini, U. Dal Lago and G. Moser. “Higher-Order Complexity Analysis: Harnessing First-Order Tools.”. 6th International Workshop on Developments in Implicit Complexity, (2015).

• Martin Avanzini, Ugo Dal Lago and Georg Moser. “Analysing the complexity of functional programs: higher-order meets first-order”. Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, ICFP 2015, Vancouver, BC, Canada, September 1-3, 2015, pages 152–164, (2015). ACM.

• Martin Avanzini, Naohi Eguchi and Georg Moser. “A new order-theoretic characterisation of the polytime computable functions”. Theor. Comput. Sci. 585: 3–24 (2015)

• Martin Avanzini, Christian Sternagel and René Thiemann. “Certification of Complexity Proofs using CeTA”. 26th International Conference on Rewriting Techniques and Applications, RTA 2015, June 29 to July 1, 2015, Warsaw, Poland, volume 36 of LIPIcs, pages 23–39, (2015). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

2014

• M. Avanzini and N. Eguchi. “A New Term Rewriting Characterisation of ETIME functions”. 5th International Workshop on Developments in Implicit Complexity (DICE), (2014).

• M. Avanzini and B. Felgenhauer. “Type Introduction for Runtime Complexity Analysis”. 14th Workshop on Termination (WST), (2014).

2013

• Martin Avanzini and Georg Moser. “Polynomial Path Orders”. Log. Methods Comput. Sci. 9 (4) (2013) © cc.

• Martin Avanzini and Georg Moser. “A Combination Framework for Complexity”. 24th International Conference on Rewriting Techniques and Applications, RTA 2013, June 24-26, 2013, Eindhoven, The Netherlands, volume 21 of LIPIcs, pages 55–70, (2013). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. © cc.

• Martin Avanzini and Georg Moser. “Tyrolean Complexity Tool: Features and Usage”. 24th International Conference on Rewriting Techniques and Applications, RTA 2013, June 24-26, 2013, Eindhoven, The Netherlands, volume 21 of LIPIcs, pages 71–80, (2013). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

• M. Avanzini, M. Schaper and G. Moser. “Small Polynomial Path Orders in TcT”. 12th Workshop on Termination (WST), pages 3–7, (2013).

• M. Avanzini. “Verifying Polytime Computability Automatically”. PhD thesis, University of Innsbruck, 2013.

• B. Felgenhauer, M. Avanzini and C. Sternagel. “A Haskell Library for Term Rewriting”. 1st Workshop on Haskell and Rewriting Techniques (HART), (2013).

2012

• Martin Avanzini, Naohi Eguchi and Georg Moser. “A New Order-Theoretic Characterisation of the Polytime Computable Functions”. Programming Languages and Systems - 10th Asian Symposium, APLAS 2012, Kyoto, Japan, December 11-13, 2012. Proceedings, volume 7705 of Lecture Notes in Computer Science, pages 280–295, (2012). Springer.

• M. Avanzini, N. Eguchi and G. Moser. “On a Correspondence between Predicative Recursion and Register Machines”. 12th Workshop on Termination (WST), pages 15–19, (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.

2010

• M. Avanzini and N. Eguchi. “A New Path Order for Exponential Time”. 11th Workshop on Termination (WST), (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, July 11-13, 2010, Edinburgh, Scottland, UK, volume 6 of LIPIcs, pages 33–48, (2010). 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.

• M. Avanzini and G. Moser. “Polynomial Path Orders and the Rules of Predicative Recursion with Parameter Substitution”. 11th Workshop on Termination (WST), pages 16–20, (2009).

• 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.