default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Martin Avanzini
@article{DBLP:journals/pacmpl/AvanziniBGMV24,
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},
journal = {Proc. {ACM} Program. Lang.},
volume = {8},
number = {{OOPSLA1}},
pages = {784--809},
year = {2024},
url = {https://doi.org/10.1145/3649839},
doi = {10.1145/3649839},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pacmpl/AvanziniBGMV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esop/AvanziniMPP24,
author = {Martin Avanzini and
Georg Moser and
Romain P{\'{e}}choux and
Simon Perdrix},
editor = {Stephanie Weirich},
title = {On the Hardness of Analyzing Quantum Programs Quantitatively},
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},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-57267-8\_2},
doi = {10.1007/978-3-031-57267-8\_2},
timestamp = {Sat, 08 Jun 2024 13:13:57 +0200},
biburl = {https://dblp.org/rec/conf/esop/AvanziniMPP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2406-07278,
author = {Davide Davoli and
Martin Avanzini and
Tamara Rezk},
title = {On Kernel's Safety in the Spectre Era (Extended Version)},
journal = {CoRR},
volume = {abs/2406.07278},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2406.07278},
doi = {10.48550/ARXIV.2406.07278},
eprinttype = {arXiv},
eprint = {2406.07278},
timestamp = {Mon, 08 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2406-07278.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2407-17127,
author = {Martin Avanzini and
Gilles Barthe and
Davide Davoli and
Benjamin Gr{\'{e}}goire},
title = {A quantitative probabilistic relational Hoare logic},
journal = {CoRR},
volume = {abs/2407.17127},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2407.17127},
doi = {10.48550/ARXIV.2407.17127},
eprinttype = {arXiv},
eprint = {2407.17127},
timestamp = {Mon, 19 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2407-17127.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pacmpl/AvanziniMS23,
author = {Martin Avanzini and
Georg Moser and
Michael Schaper},
title = {Automated Expected Value Analysis of Recursive Programs},
journal = {Proc. {ACM} Program. Lang.},
volume = {7},
number = {{PLDI}},
pages = {1050--1072},
year = {2023},
url = {https://doi.org/10.1145/3591263},
doi = {10.1145/3591263},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pacmpl/AvanziniMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-01284,
author = {Martin Avanzini and
Georg Moser and
Michael Schaper},
title = {Automated Expected Value Analysis of Recursive Programs},
journal = {CoRR},
volume = {abs/2304.01284},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.01284},
doi = {10.48550/ARXIV.2304.01284},
eprinttype = {arXiv},
eprint = {2304.01284},
timestamp = {Mon, 17 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-01284.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-13657,
author = {Martin Avanzini and
Georg Moser and
Romain P{\'{e}}choux and
Simon Perdrix},
title = {On the Hardness of Analyzing Quantum Programs Quantitatively},
journal = {CoRR},
volume = {abs/2312.13657},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.13657},
doi = {10.48550/ARXIV.2312.13657},
eprinttype = {arXiv},
eprint = {2312.13657},
timestamp = {Wed, 17 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-13657.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/AvanziniMPPZ22,
author = {Martin Avanzini and
Georg Moser and
Romain P{\'{e}}choux and
Simon Perdrix and
Vladimir Zamdzhiev},
editor = {Christel Baier and
Dana Fisman},
title = {Quantum Expectation Transformers for Cost Analysis},
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}},
year = {2022},
url = {https://doi.org/10.1145/3531130.3533332},
doi = {10.1145/3531130.3533332},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/AvanziniMPPZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-09361,
author = {Martin Avanzini and
Georg Moser and
Romain P{\'{e}}choux and
Simon Perdrix and
Vladimir Zamdzhiev},
title = {Quantum Expectation Transformers for Cost Analysis},
journal = {CoRR},
volume = {abs/2201.09361},
year = {2022},
url = {https://arxiv.org/abs/2201.09361},
eprinttype = {arXiv},
eprint = {2201.09361},
timestamp = {Wed, 02 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-09361.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pacmpl/AvanziniBL21,
author = {Martin Avanzini and
Gilles Barthe and
Ugo Dal Lago},
title = {On continuation-passing transformations and expected cost analysis},
journal = {Proc. {ACM} Program. Lang.},
volume = {5},
number = {{ICFP}},
pages = {1--30},
year = {2021},
url = {https://doi.org/10.1145/3473592},
doi = {10.1145/3473592},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pacmpl/AvanziniBL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pacmpl/AvanziniMS20,
author = {Martin Avanzini and
Georg Moser and
Michael Schaper},
title = {A modular cost analysis for probabilistic programs},
journal = {Proc. {ACM} Program. Lang.},
volume = {4},
number = {{OOPSLA}},
pages = {172:1--172:30},
year = {2020},
url = {https://doi.org/10.1145/3428240},
doi = {10.1145/3428240},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pacmpl/AvanziniMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scp/AvanziniLY20,
author = {Martin Avanzini and
Ugo Dal Lago and
Akihisa Yamada},
title = {On probabilistic term rewriting},
journal = {Sci. Comput. Program.},
volume = {185},
year = {2020},
url = {https://doi.org/10.1016/j.scico.2019.102338},
doi = {10.1016/J.SCICO.2019.102338},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scp/AvanziniLY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/AvanziniLG19,
author = {Martin Avanzini and
Ugo Dal Lago and
Alexis Ghyselen},
title = {Type-Based Complexity Analysis of Probabilistic Functional Programs},
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}},
year = {2019},
url = {https://doi.org/10.1109/LICS.2019.8785725},
doi = {10.1109/LICS.2019.8785725},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/AvanziniLG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-11343,
author = {Martin Avanzini and
Michael Schaper and
Georg Moser},
title = {Modular Runtime Complexity Analysis of Probabilistic While Programs},
journal = {CoRR},
volume = {abs/1908.11343},
year = {2019},
url = {http://arxiv.org/abs/1908.11343},
eprinttype = {arXiv},
eprint = {1908.11343},
timestamp = {Wed, 04 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-11343.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AvanziniL18,
author = {Martin Avanzini and
Ugo Dal Lago},
title = {On sharing, memoization, and polynomial time},
journal = {Inf. Comput.},
volume = {261},
pages = {3--22},
year = {2018},
url = {https://doi.org/10.1016/j.ic.2018.05.003},
doi = {10.1016/J.IC.2018.05.003},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/AvanziniL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/flops/AvanziniL018,
author = {Martin Avanzini and
Ugo Dal Lago and
Akihisa Yamada},
editor = {John P. Gallagher and
Martin Sulzmann},
title = {On Probabilistic Term Rewriting},
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},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-90686-7\_9},
doi = {10.1007/978-3-319-90686-7\_9},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/flops/AvanziniL018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-09774,
author = {Martin Avanzini and
Ugo Dal Lago and
Akihisa Yamada},
title = {On Probabilistic Term Rewriting},
journal = {CoRR},
volume = {abs/1802.09774},
year = {2018},
url = {http://arxiv.org/abs/1802.09774},
eprinttype = {arXiv},
eprint = {1802.09774},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-09774.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pacmpl/AvanziniL17,
author = {Martin Avanzini and
Ugo Dal Lago},
title = {Automating sized-type inference for complexity analysis},
journal = {Proc. {ACM} Program. Lang.},
volume = {1},
number = {{ICFP}},
pages = {43:1--43:29},
year = {2017},
url = {https://doi.org/10.1145/3110287},
doi = {10.1145/3110287},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pacmpl/AvanziniL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/AvanziniL17,
author = {Martin Avanzini and
Ugo Dal Lago},
editor = {Guillaume Bonfante and
Georg Moser},
title = {Automated Sized-Type Inference and Complexity Analysis},
booktitle = {Proceedings 8th Workshop on Developments in Implicit Computational
Complexity and 5th Workshop on Foundational and Practical Aspects
of Resource Analysis, DICE-FOPARA@ETAPS 2017, Uppsala, Sweden, April
22-23, 2017},
series = {{EPTCS}},
volume = {248},
pages = {7--16},
year = {2017},
url = {https://doi.org/10.4204/EPTCS.248.5},
doi = {10.4204/EPTCS.248.5},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/AvanziniL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/AvanziniS17,
author = {Martin Avanzini and
Michael Schaper},
editor = {Guillaume Bonfante and
Georg Moser},
title = {{GUBS} Upper Bound Solver (Extended Abstract)},
booktitle = {Proceedings 8th Workshop on Developments in Implicit Computational
Complexity and 5th Workshop on Foundational and Practical Aspects
of Resource Analysis, DICE-FOPARA@ETAPS 2017, Uppsala, Sweden, April
22-23, 2017},
series = {{EPTCS}},
volume = {248},
pages = {17--23},
year = {2017},
url = {https://doi.org/10.4204/EPTCS.248.6},
doi = {10.4204/EPTCS.248.6},
timestamp = {Wed, 12 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AvanziniS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AvanziniL17a,
author = {Martin Avanzini and
Ugo Dal Lago},
title = {Automating Sized Type Inference for Complexity Analysis (Technical
Report)},
journal = {CoRR},
volume = {abs/1706.09169},
year = {2017},
url = {http://arxiv.org/abs/1706.09169},
eprinttype = {arXiv},
eprint = {1706.09169},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AvanziniL17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AvanziniM16,
author = {Martin Avanzini and
Georg Moser},
title = {A combination framework for complexity},
journal = {Inf. Comput.},
volume = {248},
pages = {22--55},
year = {2016},
url = {https://doi.org/10.1016/j.ic.2015.12.007},
doi = {10.1016/J.IC.2015.12.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/AvanziniM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rta/AvanziniM16,
author = {Martin Avanzini and
Georg Moser},
editor = {Delia Kesner and
Brigitte Pientka},
title = {Complexity of Acyclic Term Graph Rewriting},
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},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FSCD.2016.10},
doi = {10.4230/LIPICS.FSCD.2016.10},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/rta/AvanziniM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tacas/AvanziniMS16,
author = {Martin Avanzini and
Georg Moser and
Michael Schaper},
editor = {Marsha Chechik and
Jean{-}Fran{\c{c}}ois Raskin},
title = {TcT: Tyrolean Complexity Tool},
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},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49674-9\_24},
doi = {10.1007/978-3-662-49674-9\_24},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/tacas/AvanziniMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AvanziniEM15,
author = {Martin Avanzini and
Naohi Eguchi and
Georg Moser},
title = {A new order-theoretic characterisation of the polytime computable
functions},
journal = {Theor. Comput. Sci.},
volume = {585},
pages = {3--24},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.03.003},
doi = {10.1016/J.TCS.2015.03.003},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AvanziniEM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icfp/AvanziniLM15,
author = {Martin Avanzini and
Ugo Dal Lago and
Georg Moser},
editor = {Kathleen Fisher and
John H. Reppy},
title = {Analysing the complexity of functional programs: higher-order meets
first-order},
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}},
year = {2015},
url = {https://doi.org/10.1145/2784731.2784753},
doi = {10.1145/2784731.2784753},
timestamp = {Wed, 23 Jun 2021 16:58:51 +0200},
biburl = {https://dblp.org/rec/conf/icfp/AvanziniLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rta/AvanziniST15,
author = {Martin Avanzini and
Christian Sternagel and
Ren{\'{e}} Thiemann},
editor = {Maribel Fern{\'{a}}ndez},
title = {Certification of Complexity Proofs using CeTA},
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},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.RTA.2015.23},
doi = {10.4230/LIPICS.RTA.2015.23},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/rta/AvanziniST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AvanziniL15,
author = {Martin Avanzini and
Ugo Dal Lago},
editor = {Ernst W. Mayr and
Nicolas Ollinger},
title = {On Sharing, Memoization, and Polynomial Time},
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},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.STACS.2015.62},
doi = {10.4230/LIPICS.STACS.2015.62},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/AvanziniL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AvanziniL15,
author = {Martin Avanzini and
Ugo Dal Lago},
title = {On Sharing, Memoization, and Polynomial Time (Long Version)},
journal = {CoRR},
volume = {abs/1501.00894},
year = {2015},
url = {http://arxiv.org/abs/1501.00894},
eprinttype = {arXiv},
eprint = {1501.00894},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AvanziniL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AvanziniLM15,
author = {Martin Avanzini and
Ugo Dal Lago and
Georg Moser},
title = {Analysing the Complexity of Functional Programs: Higher-Order Meets
First-Order (Long Version)},
journal = {CoRR},
volume = {abs/1506.05043},
year = {2015},
url = {http://arxiv.org/abs/1506.05043},
eprinttype = {arXiv},
eprint = {1506.05043},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AvanziniLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AvanziniM13,
author = {Martin Avanzini and
Georg Moser},
title = {Polynomial Path Orders},
journal = {Log. Methods Comput. Sci.},
volume = {9},
number = {4},
year = {2013},
url = {https://doi.org/10.2168/LMCS-9(4:9)2013},
doi = {10.2168/LMCS-9(4:9)2013},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AvanziniM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rta/AvanziniM13,
author = {Martin Avanzini and
Georg Moser},
editor = {Femke van Raamsdonk},
title = {A Combination Framework for Complexity},
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},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.RTA.2013.55},
doi = {10.4230/LIPICS.RTA.2013.55},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/rta/AvanziniM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rta/AvanziniM13a,
author = {Martin Avanzini and
Georg Moser},
editor = {Femke van Raamsdonk},
title = {Tyrolean Complexity Tool: Features and Usage},
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},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.RTA.2013.71},
doi = {10.4230/LIPICS.RTA.2013.71},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/rta/AvanziniM13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-0973,
author = {Martin Avanzini and
Georg Moser},
title = {A Combination Framework for Complexity},
journal = {CoRR},
volume = {abs/1302.0973},
year = {2013},
url = {http://arxiv.org/abs/1302.0973},
eprinttype = {arXiv},
eprint = {1302.0973},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-0973.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FelgenhauerAS13,
author = {Bertram Felgenhauer and
Martin Avanzini and
Christian Sternagel},
title = {A Haskell Library for Term Rewriting},
journal = {CoRR},
volume = {abs/1307.2328},
year = {2013},
url = {http://arxiv.org/abs/1307.2328},
eprinttype = {arXiv},
eprint = {1307.2328},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FelgenhauerAS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AvanziniE13,
author = {Martin Avanzini and
Naohi Eguchi},
title = {A New Term Rewriting Characterisation of {ETIME} functions},
journal = {CoRR},
volume = {abs/1312.7284},
year = {2013},
url = {http://arxiv.org/abs/1312.7284},
eprinttype = {arXiv},
eprint = {1312.7284},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AvanziniE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aplas/AvanziniEM12,
author = {Martin Avanzini and
Naohi Eguchi and
Georg Moser},
editor = {Ranjit Jhala and
Atsushi Igarashi},
title = {A New Order-Theoretic Characterisation of the Polytime Computable
Functions},
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},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35182-2\_20},
doi = {10.1007/978-3-642-35182-2\_20},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/aplas/AvanziniEM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-2553,
author = {Martin Avanzini and
Naohi Eguchi and
Georg Moser},
title = {A New Order-theoretic Characterisation of the Polytime Computable
Functions},
journal = {CoRR},
volume = {abs/1201.2553},
year = {2012},
url = {http://arxiv.org/abs/1201.2553},
eprinttype = {arXiv},
eprint = {1201.2553},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-2553.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-3793,
author = {Martin Avanzini and
Georg Moser},
title = {Polynomial Path Orders: {A} Maximal Model},
journal = {CoRR},
volume = {abs/1209.3793},
year = {2012},
url = {http://arxiv.org/abs/1209.3793},
eprinttype = {arXiv},
eprint = {1209.3793},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1209-3793.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rta/AvanziniEM11,
author = {Martin Avanzini and
Naohi Eguchi and
Georg Moser},
editor = {Manfred Schmidt{-}Schau{\ss}},
title = {A Path Order for Rewrite Systems that Compute Exponential Time Functions},
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},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.RTA.2011.123},
doi = {10.4230/LIPICS.RTA.2011.123},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/rta/AvanziniEM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/flops/AvanziniM10,
author = {Martin Avanzini and
Georg Moser},
editor = {Matthias Blume and
Naoki Kobayashi and
Germ{\'{a}}n Vidal},
title = {Complexity Analysis by Graph Rewriting},
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},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12251-4\_19},
doi = {10.1007/978-3-642-12251-4\_19},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/flops/AvanziniM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rta/AvanziniM10,
author = {Martin Avanzini and
Georg Moser},
editor = {Christopher Lynch},
title = {Closing the Gap Between Runtime Complexity and Polytime Computability},
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},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.RTA.2010.33},
doi = {10.4230/LIPICS.RTA.2010.33},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/rta/AvanziniM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-5404,
author = {Martin Avanzini and
Georg Moser},
title = {Efficient Implementation of Rewriting Revisited Technical Report},
journal = {CoRR},
volume = {abs/1001.5404},
year = {2010},
url = {http://arxiv.org/abs/1001.5404},
eprinttype = {arXiv},
eprint = {1001.5404},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-5404.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-1128,
author = {Martin Avanzini and
Naohi Eguchi and
Georg Moser},
title = {A Path Order for Rewrite Systems that Compute Exponential Time Functions
(Technical Report)},
journal = {CoRR},
volume = {abs/1010.1128},
year = {2010},
url = {http://arxiv.org/abs/1010.1128},
eprinttype = {arXiv},
eprint = {1010.1128},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-1128.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esslli/Avanzini09,
author = {Martin Avanzini},
editor = {Thomas Icard and
Reinhard Muskens},
title = {POP* and Semantic Labeling Using {SAT}},
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},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-14729-6\_12},
doi = {10.1007/978-3-642-14729-6\_12},
timestamp = {Tue, 12 Apr 2022 13:44:57 +0200},
biburl = {https://dblp.org/rec/conf/esslli/Avanzini09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rta/AvanziniM09,
author = {Martin Avanzini and
Georg Moser},
editor = {Ralf Treinen},
title = {Dependency Pairs and Polynomial Path Orders},
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},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02348-4\_4},
doi = {10.1007/978-3-642-02348-4\_4},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/rta/AvanziniM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0904-0981,
author = {Martin Avanzini and
Georg Moser},
title = {Dependency Pairs and Polynomial Path Orders},
journal = {CoRR},
volume = {abs/0904.0981},
year = {2009},
url = {http://arxiv.org/abs/0904.0981},
eprinttype = {arXiv},
eprint = {0904.0981},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0904-0981.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cade/AvanziniMS08,
author = {Martin Avanzini and
Georg Moser and
Andreas Schnabl},
editor = {Alessandro Armando and
Peter Baumgartner and
Gilles Dowek},
title = {Automated Implicit Computational Complexity Analysis (System Description)},
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},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-71070-7\_10},
doi = {10.1007/978-3-540-71070-7\_10},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/cade/AvanziniMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/flops/AvanziniM08,
author = {Martin Avanzini and
Georg Moser},
editor = {Jacques Garrigue and
Manuel V. Hermenegildo},
title = {Complexity Analysis by Rewriting},
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},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78969-7\_11},
doi = {10.1007/978-3-540-78969-7\_11},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/flops/AvanziniM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-08-20 23:00 CEST 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:
