Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Abstract. We show how to extend a coordination language with support for aspect oriented programming. The main challenge is how to properly deal with the trapping of actions before...
Chris Hankin, Flemming Nielson, Hanne Riis Nielson...
: In previous work we showed how to verify a compiler for a small language with exceptions. In this article we show how to calculate, as opposed to an abstract machine for this lan...
There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support ef...