Static program analysis is a cornerstone in verifying, optimising, and debugging modern software systems. By evaluating code without executing it, these techniques enable early detection of defects, ...

In this paper we develop a discretized version of the dynamic programming algorithm and study its convergence and stability properties. We show that the computed value function converges quadratically ...

In this module the student will learn the very basics of algorithms through three examples: insertion sort (sort an array in ascending/descending order); binary search: search whether an element is ...