| A relational logic for higher-order programs A Aguirre, G Barthe, M Gaboardi, D Garg, PY Strub Proceedings of the ACM on Programming Languages 1 (ICFP), 1-29, 2017 | 74 | 2017 |
| Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, bayesian inference, and optimization T Sato, A Aguirre, G Barthe, M Gaboardi, D Garg, J Hsu Proceedings of the ACM on Programming Languages 3 (POPL), 1-30, 2019 | 43 | 2019 |
| A pre-expectation calculus for probabilistic sensitivity A Aguirre, G Barthe, J Hsu, BL Kaminski, JP Katoen, C Matheja Proceedings of the ACM on Programming Languages 5 (POPL), 1-28, 2021 | 29 | 2021 |
| Relational reasoning for markov chains in a probabilistic guarded lambda calculus A Aguirre, G Barthe, L Birkedal, A Bizjak, M Gaboardi, D Garg Programming Languages and Systems: 27th European Symposium on Programming …, 2018 | 24 | 2018 |
| Higher-order probabilistic adversarial computations: categorical semantics and program logics A Aguirre, G Barthe, M Gaboardi, D Garg, S Katsumata, T Sato Proceedings of the ACM on Programming Languages 5 (ICFP), 1-30, 2021 | 20 | 2021 |
| Weakest preconditions in fibrations A Aguirre, S Katsumata Electronic Notes in Theoretical Computer Science 352, 5-27, 2020 | 19 | 2020 |
| Asynchronous probabilistic couplings in higher-order separation logic SO Gregersen, A Aguirre, PG Haselwarter, J Tassarotti, L Birkedal Proceedings of the ACM on Programming Languages 8 (POPL), 753-784, 2024 | 17 | 2024 |
| Step-indexed logical relations for countable nondeterminism and probabilistic choice A Aguirre, L Birkedal Proceedings of the ACM on Programming Languages 7 (POPL), 33-60, 2023 | 12 | 2023 |
| Towards a provably correct encoding from F* to SMT A Aguirre Master's thesis, Université Paris 7, 2016 | 10 | 2016 |
| Weakest preconditions in fibrations A Aguirre, S Katsumata, S Kura Mathematical Structures in Computer Science 32 (4), 472-510, 2022 | 6 | 2022 |
| Error credits: Resourceful reasoning about error bounds for higher-order probabilistic programs A Aguirre, PG Haselwarter, M De Medeiros, KH Li, SO Gregersen, ... Proceedings of the ACM on Programming Languages 8 (ICFP), 284-316, 2024 | 5 | 2024 |
| Kantorovich continuity of probabilistic programs A Aguirre, G Barthe, J Hsu, BL Kaminski, JP Katoen, C Matheja arXiv preprint arXiv:1901.06540, 2019 | 3 | 2019 |
| From F* to SMT A Aguirre, C Hritcu, C Keller, N Swamy Talk at 1st International Workshop on Hammers for Type Theories (HaTT), 2016 | 3 | 2016 |
| Modelling Recursion and Probabilistic Choice in Guarded Type Theory P Stassen, RE Møgelberg, MA Zwart, A Aguirre, L Birkedal Proceedings of the ACM on Programming Languages 9 (POPL), 1417-1445, 2025 | 2 | 2025 |
| Tachis: Higher-Order Separation Logic with Credits for Expected Costs PG Haselwarter, KH Li, M de Medeiros, SO Gregersen, A Aguirre, ... Proceedings of the ACM on Programming Languages 8 (OOPSLA2), 1189-1218, 2024 | 2 | 2024 |
| Almost-Sure Termination by Guarded Refinement SO Gregersen, A Aguirre, PG Haselwarter, J Tassarotti, L Birkedal Proceedings of the ACM on Programming Languages 8 (ICFP), 203-233, 2024 | 2 | 2024 |
| Almost Sure Productivity A Aguirre, G Barthe, J Hsu, A Silva arXiv preprint arXiv:1802.06283, 2018 | 2 | 2018 |
| Approximate Relational Reasoning for Higher-Order Probabilistic Programs PG Haselwarter, KH Li, A Aguirre, SO Gregersen, J Tassarotti, L Birkedal Proceedings of the ACM on Programming Languages 9 (POPL), 1196-1226, 2025 | 1 | 2025 |
| Modelling Probabilistic FPC in Guarded Type Theory P Stassen, RE Møgelberg, M Zwart, A Aguirre, L Birkedal CoRR, 2024 | 1 | 2024 |
| Symbolic Synthesis of Indifferentiability Attacks I Rakotonirina, M Ambrona, A Aguirre, G Barthe Proceedings of the 2022 ACM on Asia Conference on Computer and …, 2022 | 1 | 2022 |
Gilles BartheMPI-SP and IMDEA Software InstituteVahvistettu sähköpostiosoite verkkotunnuksessa mpi-sp.org
