Program Synthesis, which is the task of discovering programs that realize user intent, can be
useful in several scenarios: enabling people with no programming background to develop …

This paper presents a new approach for automatically deriving worst-case resource bounds
for C programs. The described technique combines ideas from amortized analysis and …

We present a novel approach to proving the absence of timing channels. The idea is to
partition the program's execution traces in such a way that each partition component is …

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 …

We present a novel static analysis for inferring precise complexity bounds of imperative and
recursive programs. The analysis operates on cost equations. Therefore, it permits uniform …

We present the first scalable bound analysis that achieves amortized complexity analysis. In
contrast to earlier work, our bound analysis is not based on general purpose reasoners such …

The automatic determination of the quantitative resource consumption of programs is a
classic research topic which has many applications in software development. Recently, we …

Compositional recurrence analysis (CRA) is a static-analysis method based on a
combination of symbolic analysis and abstract interpretation. This paper addresses the …

This article presents resource-guided synthesis, a technique for synthesizing recursive
programs that satisfy both a functional specification and a symbolic resource bound. The …