The search for efficient algorithms for register allocation dates back to the time of the first
Fortran compiler for the IBM 704. Since then, many variants of the problem have been …

NP-complete problems form an extensive equivalence class of combinatorial problems for
which no nonenumerative algorithms are known. Our first result shows that determining a …

… Sethi's “teddy bear book” is one of the popular undergraduate texts on comparative
programming languages. Like the first edition [1], this second edition is intended for use in a …

The problem of evaluating arithmetic expressions on a machine with N ≥ 1 general purpose
registers is considered. It is initially assumed that no algebraic laws apply to the operators …

Sequencing to minimize mean finishing time (or mean time in system) is not only desirable
to the user, but it also tends to minimize at each point in time the storage required to hold …

The main theorem allows an elegant algorithm to be refined into an efficient one. The
elegant algorithm for constructing a finite automaton from a regular expression is based on ‘…

Let G be a directed graph such that for each vertex v in G, the successors of v are ordered
Let C be any equivalence relation on the vertices of G. The congruence closure C* of C is the …

We will consider types as somehow being or generating constraints on expressions in a
language. A consistent type discipline will ensure that any expression satisfying the constraints …

Given a sequence $n_1 , \cdots ,n_m $ of positive integers, what is the smallest number of
additions needed to compute all m integers starting with 1? This generalization of the addition …

Consider a directed acyclic graph (dag) D with n nodes and e edges. D represents a task
system; a node corresponds to a task, and an edge $(x,y)$ means that task x must be finished …