@article{ABGMV:OOPSLA:24,
 author    = {Martin Avanzini and
                  Gilles Barthe and
                  Benjamin Gr{\'{e}}goire and
                  Georg Moser and
                  Gabriele Vanoni},
 title     = {Hopping Proofs of Expectation-Based Properties: Applications to Skiplists
                  and Security Proofs},
 year      = {2024},
 journal   = {Proc. {ACM} Program. Lang.},
 volume    = {8},
 pages     = {784--809},
 number    = {{OOPSLA1}},
 doi       = {10.1145/3649839},
 keywords  = {article}
}

@conference{AMPP:ESOP:24,
 author    = {Martin Avanzini and
                  Georg Moser and
                  Romain P{\'{e}}choux and
                  Simon Perdrix},
 title     = {On the Hardness of Analyzing Quantum Programs Quantitatively},
 year      = {2024},
 booktitle = {Programming Languages and Systems - 33rd European Symposium on Programming,
                  {ESOP} 2024, Held as Part of the European Joint Conferences on Theory
                  and Practice of Software, {ETAPS} 2024, Luxembourg City, Luxembourg,
                  April 6-11, 2024, Proceedings, Part {II}},
 series    = {Lecture Notes in Computer Science},
 volume    = {14577},
 pages     = {31--58},
 publisher = {Springer},
 doi       = {10.1007/978-3-031-57267-8\_2},
 keywords  = {conference}
}

@inproceedings{AMPP:QPL:24,
 author    = {Martin Avanzini and Georg Moser and Romain Péchoux and Simon Perdrix},
 title     = {On the Hardness of Analyzing Quantum Programs Quantitatively},
 year      = {2024},
 booktitle = {Quantum Physics and Logic 2024},
 keywords  = {workshop}
}

@conference{DAR:CCS:24,
 author    = {Davide Davoli and Martin Avanzini and Tamara Rezk},
 title     = {On Kernel's Safety in the Spectre Era (And KASLR is Formally Dead)},
 year      = {2024},
 booktitle = {31st ACM Conference on Computer and Communications Security (CCS)},
 pages     = {1--15},
 note      = {accepted},
 keywords  = {conference}
}

@article{AGM:PLDI:23,
 author    = {Martin Avanzini and
                  Georg Moser and
                  Michael Schaper},
 title     = {Automated Expected Value Analysis of Recursive Programs},
 year      = {2023},
 journal   = {Proc. {ACM} Program. Lang.},
 volume    = {7},
 pages     = {1050--1072},
 number    = {{PLDI}},
 doi       = {10.1145/3591263},
 keywords  = {article}
}

@conference{AMPPZ:LICS:22,
 author    = {Martin Avanzini and
                  Georg Moser and
                  Romain P{\'{e}}choux and
                  Simon Perdrix and
                  Vladimir Zamdzhiev},
 title     = {Quantum Expectation Transformers for Cost Analysis},
 year      = {2022},
 booktitle = {{LICS} '22: 37th Annual {ACM/IEEE} Symposium on Logic in Computer
                  Science, Haifa, Israel, August 2 - 5, 2022},
 pages     = {10:1--10:13},
 publisher = {{ACM}},
 doi       = {10.1145/3531130.3533332},
 keywords  = {conference}
}

@inproceedings{AMPPZ:QPL:22,
 author    = {Martin Avanzini and Georg Moser and Romain Péchoux and Simon Perdrix and Vladimir Zamdzhiev},
 title     = {Quantum Expectation Transformers for Cost Analysis},
 year      = {2022},
 booktitle = {Quantum Physics and Logic 2022},
 keywords  = {workshop}
}

@article{ABDL:ICFP:21,
 author    = {Martin Avanzini and
                  Gilles Barthe and
                  Ugo Dal Lago},
 title     = {On continuation-passing transformations and expected cost analysis},
 year      = {2021},
 journal   = {Proc. {ACM} Program. Lang.},
 volume    = {5},
 pages     = {1--30},
 number    = {{ICFP}},
 doi       = {10.1145/3473592},
 keywords  = {article}
}

@article{ADLY:SCP:19,
 author    = {Martin Avanzini and
                  Ugo Dal Lago and
                  Akihisa Yamada},
 title     = {On probabilistic term rewriting},
 year      = {2020},
 journal   = {Sci. Comput. Program.},
 volume    = {185},
 doi       = {10.1016/J.SCICO.2019.102338},
 keywords  = {article}
}

@article{AMS:OOPSLA:20,
 author    = {Martin Avanzini and
                  Georg Moser and
                  Michael Schaper},
 title     = {A modular cost analysis for probabilistic programs},
 year      = {2020},
 journal   = {Proc. {ACM} Program. Lang.},
 volume    = {4},
 pages     = {172:1--172:30},
 number    = {{OOPSLA}},
 doi       = {10.1145/3428240},
 keywords  = {article}
}

@conference{AGDL:LICS:19,
 author    = {Martin Avanzini and
                  Ugo Dal Lago and
                  Alexis Ghyselen},
 title     = {Type-Based Complexity Analysis of Probabilistic Functional Programs},
 year      = {2019},
 booktitle = {34th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
                  2019, Vancouver, BC, Canada, June 24-27, 2019},
 pages     = {1--13},
 publisher = {{IEEE}},
 doi       = {10.1109/LICS.2019.8785725},
 keywords  = {conference}
}

@inproceedings{ASM:DICE:19,
 author    = {M. Avanzini and M. Schaper and G. Moser},
 title     = {Modular Runtime Complexity Analysis of Probabilistic While Programs},
 year      = {2019},
 booktitle = {Workshop on Developments in Implicit Computational complExity and Workshop on Foundational and Practical Aspects of Resource Analysis 2019},
 keywords  = {workshop}
}

@article{ADL:IC:18,
 author    = {Martin Avanzini and
                  Ugo Dal Lago},
 title     = {On sharing, memoization, and polynomial time},
 year      = {2018},
 journal   = {Inf. Comput.},
 volume    = {261},
 pages     = {3--22},
 doi       = {10.1016/J.IC.2018.05.003},
 keywords  = {article}
}

@conference{ADLY:FLOPS:18,
 author    = {Martin Avanzini and
                  Ugo Dal Lago and
                  Akihisa Yamada},
 title     = {On Probabilistic Term Rewriting},
 year      = {2018},
 booktitle = {Functional and Logic Programming - 14th International Symposium, {FLOPS}
                  2018, Nagoya, Japan, May 9-11, 2018, Proceedings},
 series    = {Lecture Notes in Computer Science},
 volume    = {10818},
 pages     = {132--148},
 publisher = {Springer},
 doi       = {10.1007/978-3-319-90686-7\_9},
 keywords  = {conference}
}

@inproceedings{ADL:DICE:17,
 author    = {Martin Avanzini and
                  Ugo Dal Lago},
 title     = {Automated Sized-Type Inference and Complexity Analysis},
 year      = {2017},
 booktitle = {Proceedings 8th Workshop on Developments in Implicit Computational
                  Complexity and 5th Workshop on Foundational and Practical Aspects
                  of Resource Analysis, DICE-FOPARAETAPS 2017, Uppsala, Sweden, April
                  22-23, 2017},
 series    = {{EPTCS}},
 volume    = {248},
 pages     = {7--16},
 doi       = {10.4204/EPTCS.248.5},
 keywords  = {workshop}
}

@article{ADL:ICFP:17,
 author    = {Martin Avanzini and
                  Ugo Dal Lago},
 title     = {Automating sized-type inference for complexity analysis},
 year      = {2017},
 journal   = {Proc. {ACM} Program. Lang.},
 volume    = {1},
 pages     = {43:1--43:29},
 number    = {{ICFP}},
 doi       = {10.1145/3110287},
 keywords  = {article}
}

@inproceedings{AS:DICE:17,
 author    = {Martin Avanzini and
                  Michael Schaper},
 title     = {{GUBS} Upper Bound Solver (Extended Abstract)},
 year      = {2017},
 booktitle = {Proceedings 8th Workshop on Developments in Implicit Computational
                  Complexity and 5th Workshop on Foundational and Practical Aspects
                  of Resource Analysis, DICE-FOPARAETAPS 2017, Uppsala, Sweden, April
                  22-23, 2017},
 series    = {{EPTCS}},
 volume    = {248},
 pages     = {17--23},
 doi       = {10.4204/EPTCS.248.6},
 keywords  = {workshop}
}

@conference{AM:FSCD:16,
 author    = {Martin Avanzini and
                  Georg Moser},
 title     = {Complexity of Acyclic Term Graph Rewriting},
 year      = {2016},
 booktitle = {1st International Conference on Formal Structures for Computation
                  and Deduction, {FSCD} 2016, June 22-26, 2016, Porto, Portugal},
 series    = {LIPIcs},
 volume    = {52},
 pages     = {10:1--10:18},
 publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
 doi       = {10.4230/LIPICS.FSCD.2016.10},
 keywords  = {conference}
}

@article{AM:IC:13,
 author    = {Martin Avanzini and
                  Georg Moser},
 title     = {A Combination Framework for Complexity},
 year      = {2016},
 journal   = {Inf. Comput.},
 volume    = {248},
 pages     = {22--55},
 doi       = {10.1016/J.IC.2015.12.007},
 keywords  = {article}
}

@conference{AMS:TACAS:16,
 author    = {Martin Avanzini and
                  Georg Moser and
                  Michael Schaper},
 title     = {TcT: Tyrolean Complexity Tool},
 year      = {2016},
 booktitle = {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},
 series    = {Lecture Notes in Computer Science},
 volume    = {9636},
 pages     = {407--423},
 publisher = {Springer},
 doi       = {10.1007/978-3-662-49674-9\_24},
 keywords  = {conference}
}

@conference{AD:STACS:15,
 author    = {Martin Avanzini and
                  Ugo Dal Lago},
 title     = {On Sharing, Memoization, and Polynomial Time},
 year      = {2015},
 booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2015, March 4-7, 2015, Garching, Germany},
 series    = {LIPIcs},
 volume    = {30},
 pages     = {62--75},
 publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
 doi       = {10.4230/LIPICS.STACS.2015.62},
 keywords  = {conference}
}

@inproceedings{ADM:DICE:15,
 author    = {M. Avanzini and U. {Dal Lago} and G. Moser},
 title     = {Higher-Order Complexity Analysis: Harnessing First-Order Tools.},
 year      = {2015},
 booktitle = {6th International Workshop on Developments in Implicit Complexity},
 keywords  = {workshop}
}

@conference{ADM:ICFP:15,
 author    = {Martin Avanzini and
                  Ugo Dal Lago and
                  Georg Moser},
 title     = {Analysing the complexity of functional programs: higher-order meets
                  first-order},
 year      = {2015},
 booktitle = {Proceedings of the 20th {ACM} {SIGPLAN} International Conference on
                  Functional Programming, {ICFP} 2015, Vancouver, BC, Canada, September
                  1-3, 2015},
 pages     = {152--164},
 publisher = {{ACM}},
 doi       = {10.1145/2784731.2784753},
 keywords  = {conference}
}

@article{AEM:TCS:15,
 author    = {Martin Avanzini and
                  Naohi Eguchi and
                  Georg Moser},
 title     = {A new order-theoretic characterisation of the polytime computable
                  functions},
 year      = {2015},
 journal   = {Theor. Comput. Sci.},
 volume    = {585},
 pages     = {3--24},
 doi       = {10.1016/J.TCS.2015.03.003},
 keywords  = {article}
}

@conference{AST:RTA:15,
 author    = {Martin Avanzini and
                  Christian Sternagel and
                  Ren{\'{e}} Thiemann},
 title     = {Certification of Complexity Proofs using CeTA},
 year      = {2015},
 booktitle = {26th International Conference on Rewriting Techniques and Applications,
                  {RTA} 2015, June 29 to July 1, 2015, Warsaw, Poland},
 series    = {LIPIcs},
 volume    = {36},
 pages     = {23--39},
 publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
 doi       = {10.4230/LIPICS.RTA.2015.23},
 keywords  = {conference}
}

@inproceedings{AE:DICE:14,
 author    = {M. Avanzini and N. Eguchi},
 title     = {A New Term Rewriting Characterisation of ETIME functions},
 year      = {2014},
 booktitle = {5th International Workshop on Developments in Implicit Complexity (DICE)},
 keywords  = {workshop}
}

@inproceedings{AF:WST:14,
 author    = {M. Avanzini and B. Felgenhauer},
 title     = {Type Introduction for Runtime Complexity Analysis},
 year      = {2014},
 booktitle = {14th Workshop on Termination (WST)},
 keywords  = {workshop}
}

@article{AM:LMCS:13,
 author    = {Martin Avanzini and
                  Georg Moser},
 title     = {Polynomial Path Orders},
 year      = {2013},
 journal   = {Log. Methods Comput. Sci.},
 volume    = {9},
 number    = {4},
 doi       = {10.2168/LMCS-9(4:9)2013},
 keywords  = {article}
}

@conference{AM:RTA:13,
 author    = {Martin Avanzini and
                  Georg Moser},
 title     = {A Combination Framework for Complexity},
 year      = {2013},
 booktitle = {24th International Conference on Rewriting Techniques and Applications,
                  {RTA} 2013, June 24-26, 2013, Eindhoven, The Netherlands},
 series    = {LIPIcs},
 volume    = {21},
 pages     = {55--70},
 publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
 doi       = {10.4230/LIPICS.RTA.2013.55},
 keywords  = {conference}
}

@conference{AM:RTA:13b,
 author    = {Martin Avanzini and
                  Georg Moser},
 title     = {Tyrolean Complexity Tool: Features and Usage},
 year      = {2013},
 booktitle = {24th International Conference on Rewriting Techniques and Applications,
                  {RTA} 2013, June 24-26, 2013, Eindhoven, The Netherlands},
 series    = {LIPIcs},
 volume    = {21},
 pages     = {71--80},
 publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
 doi       = {10.4230/LIPICS.RTA.2013.71},
 keywords  = {conference}
}

@inproceedings{AMS:WST:13,
 author    = {M. Avanzini and M. Schaper and G. Moser},
 title     = {Small Polynomial Path Orders in TcT},
 year      = {2013},
 booktitle = {12th Workshop on Termination (WST)},
 pages     = {3--7},
 keywords  = {workshop}
}

@phdthesis{Avanzini:Diss:13,
 author    = {M. Avanzini},
 title     = {Verifying Polytime Computability Automatically},
 year      = {2013},
 school    = {University of Innsbruck},
 keywords  = {phdthesis}
}

@inproceedings{FAS:HART:13,
 author    = {B. Felgenhauer and M. Avanzini and C. Sternagel},
 title     = {A Haskell Library for Term Rewriting},
 year      = {2013},
 booktitle = {1st Workshop on Haskell and Rewriting Techniques (HART)},
 keywords  = {workshop}
}

@conference{AEM:APLAS:12,
 author    = {Martin Avanzini and
                  Naohi Eguchi and
                  Georg Moser},
 title     = {A New Order-Theoretic Characterisation of the Polytime Computable
                  Functions},
 year      = {2012},
 booktitle = {Programming Languages and Systems - 10th Asian Symposium, {APLAS}
                  2012, Kyoto, Japan, December 11-13, 2012. Proceedings},
 series    = {Lecture Notes in Computer Science},
 volume    = {7705},
 pages     = {280--295},
 publisher = {Springer},
 doi       = {10.1007/978-3-642-35182-2\_20},
 keywords  = {conference}
}

@inproceedings{AEM:WST:12,
 author    = {M. Avanzini and N. Eguchi and G. Moser},
 title     = {On a Correspondence between Predicative Recursion and Register Machines},
 year      = {2012},
 booktitle = {12th Workshop on Termination (WST)},
 pages     = {15--19},
 keywords  = {workshop}
}

@conference{AEM:RTA:11,
 author    = {Martin Avanzini and
                  Naohi Eguchi and
                  Georg Moser},
 title     = {A Path Order for Rewrite Systems that Compute Exponential Time Functions},
 year      = {2011},
 booktitle = {Proceedings of the 22nd International Conference on Rewriting Techniques
                  and Applications, {RTA} 2011, May 30 - June 1, 2011, Novi Sad, Serbia},
 series    = {LIPIcs},
 volume    = {10},
 pages     = {123--138},
 publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
 doi       = {10.4230/LIPICS.RTA.2011.123},
 keywords  = {conference}
}

@inproceedings{AE:WST:10,
 author    = {M. Avanzini and N. Eguchi},
 title     = {A New Path Order for Exponential Time},
 year      = {2010},
 booktitle = {11th Workshop on Termination (WST)},
 keywords  = {workshop}
}

@conference{AM:FLOPS:10,
 author    = {Martin Avanzini and
                  Georg Moser},
 title     = {Complexity Analysis by Graph Rewriting},
 year      = {2010},
 booktitle = {Functional and Logic Programming, 10th International Symposium, {FLOPS}
                  2010, Sendai, Japan, April 19-21, 2010. Proceedings},
 series    = {Lecture Notes in Computer Science},
 volume    = {6009},
 pages     = {257--271},
 publisher = {Springer},
 doi       = {10.1007/978-3-642-12251-4\_19},
 keywords  = {conference}
}

@conference{AM:RTA:10,
 author    = {Martin Avanzini and
                  Georg Moser},
 title     = {Closing the Gap Between Runtime Complexity and Polytime Computability},
 year      = {2010},
 booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques
                  and Applications, {RTA} 2010, July 11-13, 2010, Edinburgh, Scottland,
                  {UK}},
 series    = {LIPIcs},
 volume    = {6},
 pages     = {33--48},
 publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
 doi       = {10.4230/LIPICS.RTA.2010.33},
 keywords  = {conference}
}

@conference{AM:RTA:09,
 author    = {Martin Avanzini and
                  Georg Moser},
 title     = {Dependency Pairs and Polynomial Path Orders},
 year      = {2009},
 booktitle = {Rewriting Techniques and Applications, 20th International Conference,
                  {RTA} 2009, Bras{\'{\i}}lia, Brazil, June 29 - July 1, 2009, Proceedings},
 series    = {Lecture Notes in Computer Science},
 volume    = {5595},
 pages     = {48--62},
 publisher = {Springer},
 doi       = {10.1007/978-3-642-02348-4\_4},
 keywords  = {conference}
}

@inproceedings{AM:WST:09,
 author    = {M. Avanzini and G. Moser},
 title     = {Polynomial Path Orders and the Rules of Predicative Recursion with Parameter Substitution},
 year      = {2009},
 booktitle = {11th Workshop on Termination (WST)},
 pages     = {16--20},
 keywords  = {workshop}
}

@conference{Avanzini:ESSLLI:10,
 author    = {Martin Avanzini},
 title     = {POP* and Semantic Labeling Using {SAT}},
 year      = {2009},
 booktitle = {Interfaces: Explorations in Logic, Language and Computation, {ESSLLI}
                  2008 and {ESSLLI} 2009 Student Sessions. Selected Papers},
 series    = {Lecture Notes in Computer Science},
 volume    = {6211},
 pages     = {155--166},
 publisher = {Springer},
 doi       = {10.1007/978-3-642-14729-6\_12},
 keywords  = {conference}
}

@mastersthesis{Avanzini:Master:09,
 author    = {M. Avanzini},
 title     = {Automation of Polynomial Path Orders},
 year      = {2009},
 school    = {University of Innsbruck},
 keywords  = {mastersthesis}
}

@conference{AM:FLOPS:08,
 author    = {Martin Avanzini and
                  Georg Moser},
 title     = {Complexity Analysis by Rewriting},
 year      = {2008},
 booktitle = {Functional and Logic Programming, 9th International Symposium, {FLOPS}
                  2008, Ise, Japan, April 14-16, 2008. Proceedings},
 series    = {Lecture Notes in Computer Science},
 volume    = {4989},
 pages     = {130--146},
 publisher = {Springer},
 doi       = {10.1007/978-3-540-78969-7\_11},
 keywords  = {conference}
}

@conference{AMS:IJCAR:08,
 author    = {Martin Avanzini and
                  Georg Moser and
                  Andreas Schnabl},
 title     = {Automated Implicit Computational Complexity Analysis (System Description)},
 year      = {2008},
 booktitle = {Automated Reasoning, 4th International Joint Conference, {IJCAR} 2008,
                  Sydney, Australia, August 12-15, 2008, Proceedings},
 series    = {Lecture Notes in Computer Science},
 volume    = {5195},
 pages     = {132--138},
 publisher = {Springer},
 doi       = {10.1007/978-3-540-71070-7\_10},
 keywords  = {conference}
}

@misc{Avanzini:CL:07,
 author    = {M. Avanzini},
 title     = {Term Rewriting Characterizations of Complexity Classes},
 year      = {2007},
 keywords  = {misc}
}