1

Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth

Polynomial Invariant Generation for Non-deterministic Recursive Programs

Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis

Modular Verification for Almost-Sure Termination of Probabilistic Programs

Cost Analysis of Nondeterministic Probabilistic Programs

Probabilistic Smart Contracts: Secure Randomness on the Blockchain

Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving

The Treewidth of Smart Contracts

Efficient Parameterized Algorithms for Data Packing

Ergodic Mean-payoff Games for the Analysis of Attacks in Cryptocurrencies