Bio of Martin Avanzini
I am a researcher at INRIA Sophia Antipolis Méditerranée within the FoCUS research team. I graduated from the University of Innsbruck, where I was a member of the Computational Logic and Computation with Bounded Resources groups. My thesis was concerned with the automated complexity analysis of rewrite sytems and supervised by Georg Moser. I spend two years at the University of Bologna, working with Ugo Dal Lago on the complexity analysis of higher-order rewrite systems.
I am an enthusiastic functional programmer, have a look at my software page.
Affiliations
- INRIA Sophia Antipolis Méditerranée 2018 – now
Chargé de Recherche. - Universities of Bologna and Innsbruck 2014 – 2017
FWF (Austrian science fund) Schrödinger Fellow. - University of Innsbruck 2008 – 2014
Research Assistant.
Higher Education
- PhD Degree in Computer Science. 2013
Institute of Computer Science, University of Innsbruck, Austria. Thesis Verifying Polytime Computability Automatically, supervised by Georg Moser. - Master’s Degree in Computer Science. 2009
Institute of Computer Science, University of Innsbruck, Austria. Master Thesis Automation of Polynomial Path Orders, supervised by Georg Moser. - Bachelor’s Degree in Computer Science. 2007
Institute of Computer Science, University of Innsbruck, Austria. Bachelor Thesis Termination Analysis for Scheme using S-Expression Rewrite Systems, supervised by Nao Hirokawa and Scheme Programs with Polynomially Bounded Evaluation Length supervised by Georg Moser. - Diploma Höhere Technische Lehranstalt. 2001
Civil Engineering, Htl Trenkwalderstraße, Innsbruck, Austria.
Awards
Proposed for the Heinz Zemanek Price. October, 2016
The Heinz Zemanek price is awarded every 3 years by the Austrian Computer Society (OCG) to young researchers for outstanding PhD dissertations. I was nominated by the University of Innsbruck for this price, and also passed the final selection (8 persons) from the OCG.Kurt Gödel Medal. August, 2014
Our Tyrolean Complexity tool was distinguished with the prestigious Kurt Gödel Medal as best tool for the complexity analysis of term rewrite systems at the FLoC Olympic Games, held during the Vienna Summer of Logic.European Summer School in Logics, Languages and Computation. August, 2008
My work received second place in Springer best paper awards.
Scientific Activities
Reviewer.
Reviewer for the Deutsche Forschungsgemeinschaft (DFG).Secretary.
IFIP Working Group 1.6 on Rewriting.Organiser. 2020
21st International Workshop on Logic and Computational Complexity, Saarbrücken, Germany (Virtual).Invited speaker. 2019
10th International Workshop on Higher-Order Rewriting, Dortmund, Germany.PC member. 2019
Workshop on Developments in Implicit Computational Complexity and Foundational and Practical Aspects of Resource Analysis 2019, Prague, Czech Republic.Guest editor. 2018
Special issue on DICE (TCS, Elsevier).Organiser. 2017
9th Workshop on Developments in Implicit Computational Complexity, Thessaloniki, Greece.PC member. 2017
17th International Workshop on Logic and Computational Complexity, Reykjavik, Iceland.PC member. 2014
5th Workshop on Developments in Implicit Computational Complexity, Grenoble, France.Invited speaker. 2013
15th International Workshop on Logic and Computational Complexity, Torino, Italy.Invited speaker. 2013
3rd Workshop on Proof Theory and Rewriting, Kanazawa, Japan.
Scholarships and Projects
Site Leader. January, 2020 – December, 2024
Probabilistic Programming Semantics. ANR PRC Project 2019 (DS0705) 2014 (project number ANR-19-CE48-0014). INRIA, IRIF, LIPN, I2M.Project member. June, 2015 – June, 2020
Concurrent, Resourceful and Effectful COmputation, by Geometry of Interaction. Multilateral research project with members from France, Italy and Japan. University of Bologna / INRIA Sophia-Antipolis.Project member. October, 2014 – September, 2019
Expanding Logical Ideas for Complexity Analysis. ANR Digital Foundations (DS0705) 2014 (project number ANR-14-CE25-0005). INRIA (Focus, Carte), Paris 6 (LIP6), Paris 7 (IRIF), Paris 13 (LIPN), Paris Paris-Est Créteil (LACL), ENS Lyon (Plume).Principle investigator. April, 2014 – May, 2017
Higher-Order Complexity Analysis of Rewrite Systems. FWF Schrödinger Fellowship (project number J-3563). University of Bologna / University of Innsbruck.Research assistant. December, 2013 – March, 2014
Improving Certifiers for Termination Proofs. FWF standalone project (project number P22767). University of Innsbruck.Research assistant. November, 2012 – May, 2013
Structural and Computational Proof Theory. Bilateral research project between ANR and FWF (project number I608-N18). University of Innsbruck.Principal investigator. November, 2011 – October, 2012
Automated Complexity Analysis. Doctoral fellowship (project number NWF-2011/2/Mip7). University of Innsbruck.Research assistant. October, 2008 – August, 2011
Derivational Complexity Analysis. FWF standalone project (project number P20133). University of Innsbruck.
Software Development
The following gives a short list of most important software projects that I was involved in. If not mentioned otherwise, I am (among) the main developer(s). Details can be found at my software page.
IsaFoR/CeTA: A formally verified tool for checking termination, confluence and complexity proofs. I have contributed the formalisation of dependency tuples.
Expected Cost Analysis for Imperative Programs (eco-imp): Expected Cost Analysis for Imperative Programs.
GUBS: A constraint solver for polynomial inequalities.
Higher Order Complexity Analysis (HOCA): Frontend for analysing the runtime complexity of OCaml programs through first-order tools.
Higher Order Sized-Type Analysis (HOSA): Complexity analyser of higher-order programs through sized-type analysis and program instrumentation.
Implicit Computational Complexity Tool (ICCT): Analyses the complexity of functions defined through rewrite systems.
Tyrolean Complexity Tool (TCT): Full-fledged runtime complexity analyser.