Worst-case input generation aims to automatically generate inputs that
e...
The goal of automatic resource bound analysis is to statically infer sym...
We present a novel method for working with the physicist's method of
amo...
Probabilistic programming languages aim to describe and automate Bayesia...
In this article, we present a semantics-level adaption of the Optional
S...
Session types guarantee that message-passing processes adhere to predefi...
Being a fully automated technique for resource analysis, automatic amort...
This article presents liquid resource types, a technique for automatical...
This article presents a type-based analysis for deriving upper bounds on...
Automatic amortized resource analysis (AARA) is a type-based technique f...
Automatic amortized resource analysis (AARA) is a type-based technique f...
For probabilistic programs, it is usually not possible to automatically
...
This article presents resource-guided synthesis, a technique for synthes...
Programming digital contracts comes with unique challenges, which includ...
We study the problem of parametric parallel complexity analysis of
concu...
We propose a novel type system for verifying that programs correctly
imp...
While there exist several successful techniques for supporting programme...
This paper presents a new static analysis for deriving upper bounds on t...