Modern programmable blockchains have built-in support for smart contracts, ie ‍programs
that are stored on the blockchain and whose state is subject to consensus. After a smart …

We study the problem of automatically analyzing the worst-case resource usage of
procedures with several arguments. Existing automatic analyses based on amortization or …

We study the problem of automatically analyzing the worst-case resource usage of
procedures with several arguments. Existing automatic analyses based on amortization, or …

Establishing quantitative bounds on the execution cost of programs is essential in many
areas of computer science such as complexity analysis, compiler optimizations, security and …

We consider the problem of expected cost analysis over nondeterministic probabilistic
programs, which aims at automated methods for analyzing the resource-usage of such …

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 …

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 …

In this paper we present a combination framework for the automated polynomial complexity
analysis of term rewrite systems. The framework covers both derivational and runtime …

We study the problem of developing efficient approaches for proving worst-case bounds of
non-deterministic recursive programs. Ranking functions are sound and complete for …

We consider the problem of developing automated techniques for solving recurrence
relations to aid the expected-runtime analysis of programs. The motivation is that several …