Alejandro Aguirre

Orcid: 0000-0001-6746-2734

Affiliations:
  • Aarhus University: Aarhus, Denmark
  • IMDEA Software, Madrid, Spain (former)


According to our database1, Alejandro Aguirre authored at least 19 papers between 2017 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic.
Proc. ACM Program. Lang., January, 2024

Modelling Probabilistic FPC in Guarded Type Theory.
CoRR, 2024

Approximate Relational Reasoning for Higher-Order Probabilistic Programs.
CoRR, 2024

Tachis: Higher-Order Separation Logic with Credits for Expected Costs.
CoRR, 2024

Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs.
CoRR, 2024

Almost-Sure Termination by Guarded Refinement.
CoRR, 2024

2023
Step-Indexed Logical Relations for Countable Nondeterminism and Probabilistic Choice.
Proc. ACM Program. Lang., January, 2023

2022
Weakest preconditions in fibrations.
Math. Struct. Comput. Sci., April, 2022

Symbolic Synthesis of Indifferentiability Attacks.
Proceedings of the ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022, 2022

2021
Higher-order probabilistic adversarial computations: categorical semantics and program logics.
Proc. ACM Program. Lang., 2021

A pre-expectation calculus for probabilistic sensitivity.
Proc. ACM Program. Lang., 2021

2020
Relational logics for higher-order effectful programs.
PhD thesis, 2020

Weakest Preconditions in Fibrations.
Proceedings of the 36th Conference on the Mathematical Foundations of Programming Semantics, 2020

2019
Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization.
Proc. ACM Program. Lang., 2019

Kantorovich Continuity of Probabilistic Programs.
CoRR, 2019

2018
Formal verification of higher-order probabilistic programs.
CoRR, 2018

Almost Sure Productivity.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus.
Proceedings of the Programming Languages and Systems, 2018

2017
A relational logic for higher-order programs.
Proc. ACM Program. Lang., 2017


  Loading...