Showing cs.LOShow all
3 papers · 1 filter
cs.LO2026
On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic
Ugo Dal Lago, Guido Fiorillo, Paolo Pistone
The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually -complete. For this reason, a gr…
cs.LO2025
On The Metric Nature of (Differential) Logical Relations
Ugo Dal Lago, Naohiko Hoshino, Paolo Pistone
Differential logical relations are a method to measure distances between higher-order programs. They differ from standard methods based on program metrics in that differences betwe…
cs.LO2023
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories
Melissa Antonelli, Ugo Dal Lago, Davide Davoli +2
We consider a minimal extension of the language of arithmetic, such that the bounded formulas provably total in a suitably-defined theory à la Buss (expressed in this new language)…