Mechanized proofs of adversarial complexity and application to universal composability
In this paper we enhance the EasyCrypt proof assistant to reason about computational
complexity of adversaries. The key technical tool is a Hoare logic for reasoning about …
complexity of adversaries. The key technical tool is a Hoare logic for reasoning about …
The next 700 relational program logics
K Maillard, C Hriţcu, E Rivas… - Proceedings of the ACM on …, 2019 - dl.acm.org
We propose the first framework for defining relational program logics for arbitrary monadic
effects. The framework is embedded within a relational dependent type theory and is highly …
effects. The framework is embedded within a relational dependent type theory and is highly …
Raising expectations: automating expected cost analysis with types
D Wang, DM Kahn, J Hoffmann - Proceedings of the ACM on …, 2020 - dl.acm.org
This article presents a type-based analysis for deriving upper bounds on the expected
execution cost of probabilistic programs. The analysis is naturally compositional, parametric …
execution cost of probabilistic programs. The analysis is naturally compositional, parametric …
Effectful program distancing
U Dal Lago, F Gavazzo - Proceedings of the ACM on Programming …, 2022 - dl.acm.org
Semantics is traditionally concerned with program equivalence, in which all pairs of
programs which are not equivalent are treated the same, and simply dubbed as …
programs which are not equivalent are treated the same, and simply dubbed as …
Automatic amortized resource analysis with the quantum physicist's method
DM Kahn, J Hoffmann - Proceedings of the ACM on Programming …, 2021 - dl.acm.org
We present a novel method for working with the physicist's method of amortized resource
analysis, which we call the quantum physicist's method. These principles allow for more …
analysis, which we call the quantum physicist's method. These principles allow for more …
Differential cost analysis with simultaneous potentials and anti-potentials
We present a novel approach to differential cost analysis that, given a program revision,
attempts to statically bound the difference in resource usage, or cost, between the two …
attempts to statically bound the difference in resource usage, or cost, between the two …
A relational program logic with data abstraction and dynamic framing
Dedicated to Tony Hoare. In a paper published in 1972, Hoare articulated the fundamental
notions of hiding invariants and simulations. Hiding: invariants on encapsulated data …
notions of hiding invariants and simulations. Hiding: invariants on encapsulated data …
[HTML][HTML] Schematic Program Proofs with Abstract Execution: Theory and Applications
D Steinhöfel, R Hähnle - Journal of Automated Reasoning, 2024 - Springer
Abstract We propose Abstract Execution, a static verification framework based on symbolic
execution and dynamic frames for proving properties of schematic programs. Since a …
execution and dynamic frames for proving properties of schematic programs. Since a …
Relational cost analysis for functional-imperative programs
Relational cost analysis aims at formally establishing bounds on the difference in the
evaluation costs of two programs. As a particular case, one can also use relational cost …
evaluation costs of two programs. As a particular case, one can also use relational cost …
Relational cost analysis in a functional-imperative setting
Relational cost analysis aims at formally establishing bounds on the difference in the
evaluation costs of two programs. As a particular case, one can also use relational cost …
evaluation costs of two programs. As a particular case, one can also use relational cost …