Zobrazeno 1 - 10 of 22 pro vyhledávání: '"Martin Avanzini"'
1
Akademický článek
GUBS Upper Bound Solver (Extended Abstract)
Autor: Martin Avanzini, Michael Schaper
Publikováno v: Electronic Proceedings in Theoretical Computer Science, Vol 248, Iss Proc. DICE-FOPARA 2017, Pp 17-23 (2017)
In this extended abstract we present the GUBS Upper Bound Solver. GUBS is a dedicated constraint solver over the naturals for inequalities formed over uninterpreted function symbols and standard arithmetic operations. GUBS now forms the backbone of H
Externí odkaz: https://doaj.org/article/02e2232b6c16421b8d470efa3200beeb
Zobrazit plný text záznamu
2
Akademický článek
Automated Sized-Type Inference and Complexity Analysis
Autor: Martin Avanzini, Ugo Dal Lago
Publikováno v: Electronic Proceedings in Theoretical Computer Science, Vol 248, Iss Proc. DICE-FOPARA 2017, Pp 7-16 (2017)
This paper introduces a new methodology for the complexity analysis of higher-order functional programs, which is based on three components: a powerful type system for size analysis and a sound type inference procedure for it, a ticking monadic trans
Externí odkaz: https://doaj.org/article/2bd3633deb6b47e98e17ed87d3aedc8d
Zobrazit plný text záznamu
3
Akademický článek
Polynomial Path Orders
Autor: Martin Avanzini, Georg Moser
Publikováno v: Logical Methods in Computer Science, Vol Volume 9, Issue 4 (2013)
This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP*, that is applicable in
Externí odkaz: https://doaj.org/article/e6cb83b19c4a4d35b8ee8ea70db5ce6c
Zobrazit plný text záznamu
4
Quantum Expectation Transformers for Cost Analysis
Autor: Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev
Publikováno v: Symposium on Logic In Computer Science LICS ’22
Symposium on Logic In Computer Science LICS ’22, Aug 2022, Haifa, Israel
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
HAL
International audience; We introduce a new kind of expectation transformer for a mixed classical-quantum programming language. Our semantic approach relies on a new notion of a cost structure, which we introduce and which can be seen as a specialisat
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41fb91fb2d6c7499b4eebaf2933c92b4
https://inria.hal.science/hal-03540366/file/AVGQ.pdf
Zobrazit plný text záznamu
6
On continuation-passing transformations and expected cost analysis
Autor: Gilles Barthe, Ugo Dal Lago, Martin Avanzini
Publikováno v: Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, ACM, 2021, 5 (ICFP), pp.1-30. ⟨10.1145/3473592⟩
Proceedings of the ACM on Programming Languages, 2021, 5 (ICFP), pp.1-30. ⟨10.1145/3473592⟩
We define a continuation-passing style (CPS) translation for a typed λ-calculus with probabilistic choice, unbounded recursion, and a tick operator — for modeling cost. The target language is a (non-probabilistic) λ-calculus, enriched with a type
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21331374856188c1e6783a65bcec02c5
Zobrazit plný text záznamu
7
A Modular Cost Analysis for Probabilistic Programs
Autor: Michael Schaper, Martin Avanzini, Georg Moser
Publikováno v: Proceedings of OOPSLA 2020
OOPSLA 2020-Conference on Object-oriented Programming, Systems, Languages, and Applications part of SPLASH 2020
OOPSLA 2020-Conference on Object-oriented Programming, Systems, Languages, and Applications part of SPLASH 2020, Nov 2020, Chicago / Online, United States
We present a novel methodology for the automated resource analysis of non-deterministic, probabilistic imperative programs, which gives rise to a modular approach . Program fragments are analysed in full independence. Moreover, the established result
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::024753ab323945dbfaf8f8be330f1317
https://inria.hal.science/hal-03013544/file/paper.pdf
Zobrazit plný text záznamu
8
Automating sized-type inference for complexity analysis
Autor: Martin Avanzini, Ugo Dal Lago
Publikováno v: Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, ACM, 2017, 1 (ICFP), pp.1-29. ⟨10.1145/3110287⟩
Proceedings of the ACM on Programming Languages, 2017, 1 (ICFP), pp.1-29. ⟨10.1145/3110287⟩
This paper introduces a new methodology for the complexity analysis of higher-order functional programs, which is based on three ingredients: a powerful type system for size analysis and a sound type inference procedure for it, a ticking monadic tran
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::062b3fbecff462ac01e252797a2e3413
https://doi.org/10.1145/3110287
Zobrazit plný text záznamu
9
On probabilistic term rewriting
Autor: Akihisa Yamada, Ugo Dal Lago, Martin Avanzini
Publikováno v: Science of Computer Programming
Science of Computer Programming, Elsevier, 2020, 185, pp.102338. ⟨10.1016/j.scico.2019.102338⟩
Functional and Logic Programming-14th International Symposium, Proceedings
Functional and Logic Programming-14th International Symposium, Proceedings, May 2018, Nagoya, Japan
Functional and Logic Programming ISBN: 9783319906850
FLOPS
Science of Computer Programming, 2020, 185, pp.102338. ⟨10.1016/j.scico.2019.102338⟩
We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite systems a
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7cbbbca1e102724c2f2ab4e39f97b66c
https://hal.inria.fr/hal-02381877
Zobrazit plný text záznamu
10
Type-Based Complexity Analysis of Probabilistic Functional Programs
Autor: Martin Avanzini, Ugo Dal Lago, Alexis Ghyselen
Publikováno v: LICS 2019-34th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS 2019-34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1-13, ⟨10.1109/LICS.2019.8785725⟩
LICS
We show that complexity analysis of probabilistic higher-order functional programs can be carried out compositionally by way of a type system. The introduced type system is a significant extension of refinement types. On the one hand, the presence of
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b24c96249e61b5914898271bc25410c5
https://hal.inria.fr/hal-02381829/document
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje