We develop a weakest-precondition-style calculus à la Dijkstra for reasoning about
amortized expected runtimes of randomized algorithms with access to dynamic memory …

Verified Textbook Algorithms | SpringerLink Skip to main content Advertisement Springer
Nature Link Account Menu Find a journal Publish with us Track your research Search Cart 1.Home …

Probabilistic programs often trade accuracy for efficiency, and thus may, with a small
probability, return an incorrect result. It is important to obtain precise bounds for the …

There are two approaches to automatically deriving symbolic worst-case resource bounds
for programs: static analysis of the source code and data-driven analysis of cost …

We present a machine-checked extension of the program logic Iris with time credits and time
receipts, two dual means of reasoning about time. Whereas time credits are used to …

We present a Separation Logic with space credits for reasoning about heap space in a
sequential call-by-value lambda-calculus equipped with garbage collection and mutable …

We present Tachis, a higher-order separation logic to reason about the expected cost of
probabilistic programs. Inspired by the uses of time credits for reasoning about the running …

We present Cameleer, an automated deductive verification tool for OCaml. We leverage on
the recently proposed GOSPEL (Generic OCaml SPEcification Language) to attach rigorous …

Almost-sure termination is an important correctness property for probabilistic programs, and
a number of program logics have been developed for establishing it. However, these logics …

This paper presents λ-amor, a new type-theoretic framework for amortized cost analysis of
higher-order functional programs and shows that existing type systems for cost analysis can …