Abstract. We introduce a generalised notion of a real-time speci cation language (\GPLC-Automata") that can be translated directly into real-time programs. In order to describ...
Currently compilers contain a large number of optimisations which are based on a set of heuristics that are not guaranteed to be effective to improve the performance metrics. In th...
Abstract. In seeking suitable Runge-Kutta methods for differential algebraic equations, we consider singly-implicit methods to which are appended diagonally-implicit stages. Metho...
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...