# LSV Seminar

The LSV seminar takes place on Tuesday at 11:00 AM. The usual location is the conference room at Pavillon des Jardins (venue).
If you wish to be informed by e-mail about upcoming seminars, please contact Stéphane Le Roux and Matthias Fuegger.

The seminar is open to public and does not require any form of registration.

## Past Seminars

### Runtime Analysis of Randomized Algorithms: A Dijkstra Déjà Vu

- Date
- Wednesday, March 29 2017 at 10:00AM
- Place
- Salle de Conférence (Pavillon des Jardins)
- Speaker
- Joost-Pieter Katoen (RWTH Aachen)

Randomization is an important tool in algorithm design for obtaining
efficient solutions; e.g., random pivot selection in quicksort lowers
the expected runtime (ER) to O(n log n). Reasoning about the ER of
randomized algorithms is subtle and full of nuances, as:

- they may have diverging runs but have a finite ER;
- they may almost surely terminate but have an infinite ER;
- running two finite-ER algorithms in sequence may yield an infinite ER.

ER analysis of randomized algorithms is typically done using classical
probability theory, mostly with arguments relying on random variable
expectations or martingales. These analyses partially follow an ad-hoc
reasoning and take non-trivial relationships between random variables
for granted.

In this talk, I'll present a formal verification approach towards the ER
analysis using a weakest-precondition approach à la Dijkstra. It allows
e.g. to prove the positive almost-sure termination: does a program
terminate with probability one in finite expected time? We show proof
rules for loops prove the soundness w.r.t a simple operational mode and
argue that our approach conservatively extends Nielson's approach for
deterministic programs.