2019

• M. Avanzini and M. Schaper and G. Moser. “Modular Runtime Complexity Analysis of Probabilistic While Programs”. Proceedings of the Workshop on Developments in Implicit Computational complExity and Workshop on Foundational and Practical Aspects of Resource Analysis 2019, 2019.

2017

• M. Avanzini and U. Dal Lago. “Automating Size Type Inference and Complexity Analysis”. Proceedings of the 8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, 2017.

• M. Avanzini and U. Dal Lago. “Automating Sized-Type Inference for Complexity Analysis”. Proceedings of the ACM on Programming Languages 1, 2017. Association for Computing Machinery. © Creative Commons License - ND.

• M. Avanzini and M. Schaper. “GUBS Upper Bound Solver”. Proceedings of the 17th International Workshop on Developments in Implicit Complexity, 2017.

2016

• M. Avanzini and G. Moser. “A Combination Framework for Complexity”. Information and Computation 248:22–55, 2016. Elsevier. © Elsevier.

• M. Avanzini and G. Moser and M. Schaper. “TcT: Tyrolean Complexity Tool”. (Preprint). Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 9636 of Lecture Notes in Computer Science, pages 407–423, 2016. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.

2015

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

• M. Avanzini and U. Dal Lago and G. Moser. “Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order”. Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, pages 152–164, 2015. Association for Computing Machinery. © Association for Computing Machinery.

• M. Avanzini and N. Eguchi and G. Moser. “A new Order-theoretic Characterisation of the Polytime Computable Functions”. Theoretical Computer Science 585:3–24, 2015. Elsevier. © Elsevier.

2014

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

2013

• M. Avanzini and G. Moser. “Polynomial Path Orders”. Logical Methods in Computer Science 9 (4), 2013. Leibnitz Zentrum für Informatik. © Creative Commons License - ND.

• M. Avanzini and G.Moser. “A Combination Framework for Complexity”. Proceedings of the 24th International Conference on Rewriting Techniques and Applications, volume 21 of Leibnitz International Proceedings in Informatics, pages 55–70, 2013. Leibnitz Zentrum für Informatik. © Creative Commons License - ND.

• M. Avanzini and G.Moser. “Tyrolean Complexity Tool: Features and Usage”. Proceedings of the 24th International Conference on Rewriting Techniques and Applications, volume 21 of Leibnitz International Proceedings in Informatics, pages 71–80, 2013. Leibnitz Zentrum für Informatik. © Creative Commons License - ND.

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

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

2010

• M. Avanzini and N. Eguchi. “A New Path Order for Exponential Time”. Proceedings of the 11th Workshop on Termination, 2010.

• M. 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, 2010. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.

2009

• M. Avanzini and G.Moser. “Dependency Pairs and Polynomial Path Orders”. (Preprint). Proceedings of the 20th International Conference on Rewriting Techniques and Applications, volume 5595 of Lecture Notes in Computer Science, pages 48–62, 2009. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.

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

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

2008

• M. Avanzini and G. Moser and A. Schnabl. “Automated Implicit Computational Complexity Analysis (System Description)”. (Preprint). Proceedings of the 4th International Joint Conference on Automated Reasoning, volume 5195 of Lecture Notes in Computer Science, pages 132-138, 2008. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.