We stand with Ukraine  

Martin Avanzini

Orcid: 0000-0002-6445-8833

According to our database1, Martin Avanzini authored at least 40 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs.
[BibTeX]
[DOI]
Martin Avanzini
,
Gilles Barthe
,
Benjamin Grégoire
,
Georg Moser
,
Gabriele Vanoni
Proc. ACM Program. Lang., 2024

Comprehensive Kernel Safety in the Spectre Era: Mitigations and Performance Evaluation (Extended Version).
[BibTeX]
[DOI]
Davide Davoli
,
Martin Avanzini
,
Tamara Rezk
CoRR, 2024

A quantitative probabilistic relational Hoare logic.
[BibTeX]
[DOI]
Martin Avanzini
,
Gilles Barthe
,
Davide Davoli
,
Benjamin Grégoire
CoRR, 2024

On Kernel's Safety in the Spectre Era (Extended Version).
[BibTeX]
[DOI]
Davide Davoli
,
Martin Avanzini
,
Tamara Rezk
CoRR, 2024

On the Hardness of Analyzing Quantum Programs Quantitatively.
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
,
Romain Péchoux
,
Simon Perdrix
Proceedings of the Programming Languages and Systems, 2024

On Kernel's Safety in the Spectre Era (And KASLR is Formally Dead).
[BibTeX]
[DOI]
Davide Davoli
,
Martin Avanzini
,
Tamara Rezk
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Automated Expected Value Analysis of Recursive Programs.
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
,
Michael Schaper
Proc. ACM Program. Lang., 2023

2022
Quantum Expectation Transformers for Cost Analysis.
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
,
Romain Péchoux
,
Simon Perdrix
,
Vladimir Zamdzhiev
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021
On continuation-passing transformations and expected cost analysis.
[BibTeX]
[DOI]
Martin Avanzini
,
Gilles Barthe
,
Ugo Dal Lago
Proc. ACM Program. Lang., 2021

2020
On probabilistic term rewriting.
[BibTeX]
[DOI]
Martin Avanzini
,
Ugo Dal Lago
,
Akihisa Yamada
Sci. Comput. Program., 2020

A modular cost analysis for probabilistic programs.
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
,
Michael Schaper
Proc. ACM Program. Lang., 2020

2019
Modular Runtime Complexity Analysis of Probabilistic While Programs.
[BibTeX]
[DOI]
Martin Avanzini
,
Michael Schaper
,
Georg Moser
CoRR, 2019

Type-Based Complexity Analysis of Probabilistic Functional Programs.
[BibTeX]
[DOI]
Martin Avanzini
,
Ugo Dal Lago
,
Alexis Ghyselen
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018
On sharing, memoization, and polynomial time.
[BibTeX]
[DOI]
Martin Avanzini
,
Ugo Dal Lago
Inf. Comput., 2018

2017
Automating sized-type inference for complexity analysis.
[BibTeX]
[DOI]
Martin Avanzini
,
Ugo Dal Lago
Proc. ACM Program. Lang., 2017

GUBS Upper Bound Solver (Extended Abstract).
[BibTeX]
[DOI]
Martin Avanzini
,
Michael Schaper
Proceedings of the Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, 2017

Automating Sized Type Inference for Complexity Analysis (Technical Report).
[BibTeX]
[DOI]
Martin Avanzini
,
Ugo Dal Lago
CoRR, 2017

Automated Sized-Type Inference and Complexity Analysis.
[BibTeX]
[DOI]
Martin Avanzini
,
Ugo Dal Lago
Proceedings of the Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, 2017

2016
A combination framework for complexity.
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
Inf. Comput., 2016

TcT: Tyrolean Complexity Tool.
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
,
Michael Schaper
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Complexity of Acyclic Term Graph Rewriting.
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

2015
A new order-theoretic characterisation of the polytime computable functions.
[BibTeX]
[DOI]
Martin Avanzini
,
Naohi Eguchi
,
Georg Moser
Theor. Comput. Sci., 2015

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version).
[BibTeX]
[DOI]
Martin Avanzini
,
Ugo Dal Lago
,
Georg Moser
CoRR, 2015

On Sharing, Memoization, and Polynomial Time (Long Version).
[BibTeX]
[DOI]
Martin Avanzini
,
Ugo Dal Lago
CoRR, 2015

Certification of Complexity Proofs using CeTA.
[BibTeX]
[DOI]
Martin Avanzini
,
Christian Sternagel
,
René Thiemann
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Analysing the complexity of functional programs: higher-order meets first-order.
[BibTeX]
[DOI]
Martin Avanzini
,
Ugo Dal Lago
,
Georg Moser
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

2013
A Haskell Library for Term Rewriting.
[BibTeX]
[DOI]
Bertram Felgenhauer
,
Martin Avanzini
,
Christian Sternagel
CoRR, 2013

Polynomial Path Orders.
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
Log. Methods Comput. Sci., 2013

A New Term Rewriting Characterisation of ETIME functions.
[BibTeX]
[DOI]
Martin Avanzini
,
Naohi Eguchi
CoRR, 2013

Tyrolean Complexity Tool: Features and Usage.
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

2012
Polynomial Path Orders: A Maximal Model
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
CoRR, 2012

2011
A Path Order for Rewrite Systems that Compute Exponential Time Functions.
[BibTeX]
[DOI]
Martin Avanzini
,
Naohi Eguchi
,
Georg Moser
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

2010
A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)
[BibTeX]
[DOI]
Martin Avanzini
,
Naohi Eguchi
,
Georg Moser
CoRR, 2010

Efficient Implementation of Rewriting Revisited Technical Report
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
CoRR, 2010

Closing the Gap Between Runtime Complexity and Polytime Computability.
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Complexity Analysis by Graph Rewriting.
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009
Dependency Pairs and Polynomial Path Orders.
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

POP* and Semantic Labeling Using SAT.
[BibTeX]
[DOI]
Martin Avanzini
Proceedings of the Interfaces: Explorations in Logic, Language and Computation, 2009

2008
Complexity Analysis by Rewriting.
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
Proceedings of the Functional and Logic Programming, 9th International Symposium, 2008

Automated Implicit Computational Complexity Analysis (System Description).
[BibTeX]
[DOI]
Martin Avanzini
,
Georg Moser
,
Andreas Schnabl
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008


  Loading...