activity
20172026
most citedFormal verification of higher-order probabilistic programs

28 citations · 61 across the 6 of their papers we have counts for

collaborators

8 papers

cs.DC2026★ 1 cited

A task-based data-flow methodology for programming heterogeneous systems with multiple accelerator APIs

Aleix Boné, Alejandro Aguirre, David Álvarez +2

Heterogeneous nodes that combine multi-core CPUs with diverse accelerators are rapidly becoming the norm in both high-performance computing (HPC) and AI infrastructures. Exploiting…

cs.LO2023★ 21 cited

Asynchronous Probabilistic Couplings in Higher-Order Separation Logic

Simon Oddershede Gregersen, Alejandro Aguirre, Philipp G. Haselwarter +2

Probabilistic couplings are the foundation for many probabilistic relational program logics and arise when relating random sampling statements across two programs. In relational pr…

cs.LO2021

Higher-order probabilistic adversarial computations: Categorical semantics and program logics

Alejandro Aguirre, Gilles Barthe, Marco Gaboardi +3

Adversarial computations are a widely studied class of computations where resource-bounded probabilistic adversaries have access to oracles, i.e., probabilistic procedures with pri…

cs.LO2019

A Pre-Expectation Calculus for Probabilistic Sensitivity

Alejandro Aguirre, Gilles Barthe, Justin Hsu +3

Sensitivity properties describe how changes to the input of a program affect the output, typically by upper bounding the distance between the outputs of two runs by a monotone func…

cs.LO2018★ 28 cited

Formal verification of higher-order probabilistic programs

Tetsuya Sato, Alejandro Aguirre, Gilles Barthe +3

Probabilistic programming provides a convenient lingua franca for writing succinct and rigorous descriptions of probabilistic models and inference tasks. Several probabilistic prog…

cs.PL2018★ 1 cited

Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus

Alejandro Aguirre, Gilles Barthe, Lars Birkedal +3

We extend the simply-typed guarded -calculus with discrete probabilities and endow it with a program logic for reasoning about relational properties of guarded probabilistic com…

cs.PL2018

Almost Sure Productivity

Alejandro Aguirre, Gilles Barthe, Justin Hsu +1

We define Almost Sure Productivity (ASP), a probabilistic generalization of the productivity condition for coinductively defined structures. Intuitively, a probabilistic coinductiv…

cs.PL2017★ 10 cited

A Relational Logic for Higher-Order Programs

Alejandro Aguirre, Gilles Barthe, Marco Gaboardi +2

Relational program verification is a variant of program verification where one can reason about two programs and as a special case about two executions of a single program on diffe…