default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Avanzini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Martin Avanzini, Gilles Barthe
, Benjamin Grégoire, Georg Moser, Gabriele Vanoni:
Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs. Proc. ACM Program. Lang. 8(OOPSLA1): 784-809 (2024)- [c22]Davide Davoli, Martin Avanzini, Tamara Rezk:
On Kernel's Safety in the Spectre Era (And KASLR is Formally Dead). CCS 2024: 1091-1105 - [c21]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix:
On the Hardness of Analyzing Quantum Programs Quantitatively. ESOP (2) 2024: 31-58 - [i19]Davide Davoli, Martin Avanzini, Tamara Rezk:
On Kernel's Safety in the Spectre Era (Extended Version). CoRR abs/2406.07278 (2024) - [i18]Martin Avanzini, Gilles Barthe, Davide Davoli, Benjamin Grégoire:
A quantitative probabilistic relational Hoare logic. CoRR abs/2407.17127 (2024) - [i17]Davide Davoli, Martin Avanzini, Tamara Rezk:
Comprehensive Kernel Safety in the Spectre Era: Mitigations and Performance Evaluation (Extended Version). CoRR abs/2411.18094 (2024) - 2023
- [j9]Martin Avanzini, Georg Moser, Michael Schaper:
Automated Expected Value Analysis of Recursive Programs. Proc. ACM Program. Lang. 7(PLDI): 1050-1072 (2023) - [i16]Martin Avanzini, Georg Moser, Michael Schaper:
Automated Expected Value Analysis of Recursive Programs. CoRR abs/2304.01284 (2023) - [i15]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix:
On the Hardness of Analyzing Quantum Programs Quantitatively. CoRR abs/2312.13657 (2023) - 2022
- [c20]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev:
Quantum Expectation Transformers for Cost Analysis. LICS 2022: 10:1-10:13 - [i14]Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev:
Quantum Expectation Transformers for Cost Analysis. CoRR abs/2201.09361 (2022) - 2021
- [j8]Martin Avanzini, Gilles Barthe, Ugo Dal Lago:
On continuation-passing transformations and expected cost analysis. Proc. ACM Program. Lang. 5(ICFP): 1-30 (2021) - 2020
- [j7]Martin Avanzini, Georg Moser, Michael Schaper:
A modular cost analysis for probabilistic programs. Proc. ACM Program. Lang. 4(OOPSLA): 172:1-172:30 (2020) - [j6]Martin Avanzini, Ugo Dal Lago, Akihisa Yamada:
On probabilistic term rewriting. Sci. Comput. Program. 185 (2020)
2010 – 2019
- 2019
- [c19]Martin Avanzini, Ugo Dal Lago, Alexis Ghyselen:
Type-Based Complexity Analysis of Probabilistic Functional Programs. LICS 2019: 1-13 - [i13]Martin Avanzini, Michael Schaper, Georg Moser:
Modular Runtime Complexity Analysis of Probabilistic While Programs. CoRR abs/1908.11343 (2019) - 2018
- [j5]Martin Avanzini, Ugo Dal Lago:
On sharing, memoization, and polynomial time. Inf. Comput. 261: 3-22 (2018) - [c18]Martin Avanzini, Ugo Dal Lago, Akihisa Yamada:
On Probabilistic Term Rewriting. FLOPS 2018: 132-148 - [i12]Martin Avanzini, Ugo Dal Lago, Akihisa Yamada:
On Probabilistic Term Rewriting. CoRR abs/1802.09774 (2018) - 2017
- [j4]Martin Avanzini, Ugo Dal Lago:
Automating sized-type inference for complexity analysis. Proc. ACM Program. Lang. 1(ICFP): 43:1-43:29 (2017) - [c17]Martin Avanzini, Ugo Dal Lago:
Automated Sized-Type Inference and Complexity Analysis. DICE-FOPARA@ETAPS 2017: 7-16 - [c16]Martin Avanzini, Michael Schaper:
GUBS Upper Bound Solver (Extended Abstract). DICE-FOPARA@ETAPS 2017: 17-23 - [i11]Martin Avanzini, Ugo Dal Lago:
Automating Sized Type Inference for Complexity Analysis (Technical Report). CoRR abs/1706.09169 (2017) - 2016
- [j3]Martin Avanzini, Georg Moser:
A combination framework for complexity. Inf. Comput. 248: 22-55 (2016) - [c15]Martin Avanzini, Georg Moser:
Complexity of Acyclic Term Graph Rewriting. FSCD 2016: 10:1-10:18 - [c14]Martin Avanzini, Georg Moser, Michael Schaper:
TcT: Tyrolean Complexity Tool. TACAS 2016: 407-423 - 2015
- [j2]Martin Avanzini, Naohi Eguchi, Georg Moser:
A new order-theoretic characterisation of the polytime computable functions. Theor. Comput. Sci. 585: 3-24 (2015) - [c13]Martin Avanzini, Ugo Dal Lago, Georg Moser:
Analysing the complexity of functional programs: higher-order meets first-order. ICFP 2015: 152-164 - [c12]Martin Avanzini, Christian Sternagel, René Thiemann:
Certification of Complexity Proofs using CeTA. RTA 2015: 23-39 - [c11]Martin Avanzini, Ugo Dal Lago:
On Sharing, Memoization, and Polynomial Time. STACS 2015: 62-75 - [i10]Martin Avanzini, Ugo Dal Lago:
On Sharing, Memoization, and Polynomial Time (Long Version). CoRR abs/1501.00894 (2015) - [i9]Martin Avanzini, Ugo Dal Lago, Georg Moser:
Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version). CoRR abs/1506.05043 (2015) - 2013
- [j1]Martin Avanzini, Georg Moser:
Polynomial Path Orders. Log. Methods Comput. Sci. 9(4) (2013) - [c10]Martin Avanzini, Georg Moser:
A Combination Framework for Complexity. RTA 2013: 55-70 - [c9]Martin Avanzini, Georg Moser:
Tyrolean Complexity Tool: Features and Usage. RTA 2013: 71-80 - [i8]Martin Avanzini, Georg Moser:
A Combination Framework for Complexity. CoRR abs/1302.0973 (2013) - [i7]Bertram Felgenhauer, Martin Avanzini, Christian Sternagel:
A Haskell Library for Term Rewriting. CoRR abs/1307.2328 (2013) - [i6]Martin Avanzini, Naohi Eguchi:
A New Term Rewriting Characterisation of ETIME functions. CoRR abs/1312.7284 (2013) - 2012
- [c8]Martin Avanzini, Naohi Eguchi, Georg Moser:
A New Order-Theoretic Characterisation of the Polytime Computable Functions. APLAS 2012: 280-295 - [i5]Martin Avanzini, Naohi Eguchi, Georg Moser:
A New Order-theoretic Characterisation of the Polytime Computable Functions. CoRR abs/1201.2553 (2012) - [i4]Martin Avanzini, Georg Moser:
Polynomial Path Orders: A Maximal Model. CoRR abs/1209.3793 (2012) - 2011
- [c7]Martin Avanzini, Naohi Eguchi, Georg Moser:
A Path Order for Rewrite Systems that Compute Exponential Time Functions. RTA 2011: 123-138 - 2010
- [c6]Martin Avanzini, Georg Moser:
Complexity Analysis by Graph Rewriting. FLOPS 2010: 257-271 - [c5]Martin Avanzini, Georg Moser:
Closing the Gap Between Runtime Complexity and Polytime Computability. RTA 2010: 33-48 - [i3]Martin Avanzini, Georg Moser:
Efficient Implementation of Rewriting Revisited Technical Report. CoRR abs/1001.5404 (2010) - [i2]Martin Avanzini, Naohi Eguchi, Georg Moser:
A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report). CoRR abs/1010.1128 (2010)
2000 – 2009
- 2009
- [c4]Martin Avanzini:
POP* and Semantic Labeling Using SAT. ESSLLI Student Sessions 2009: 155-166 - [c3]Martin Avanzini, Georg Moser:
Dependency Pairs and Polynomial Path Orders. RTA 2009: 48-62 - [i1]Martin Avanzini, Georg Moser:
Dependency Pairs and Polynomial Path Orders. CoRR abs/0904.0981 (2009) - 2008
- [c2]Martin Avanzini, Georg Moser, Andreas Schnabl:
Automated Implicit Computational Complexity Analysis (System Description). IJCAR 2008: 132-138 - [c1]Martin Avanzini, Georg Moser:
Complexity Analysis by Rewriting. FLOPS 2008: 130-146
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-02 18:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
