Follow

Submissions from 2001

Polynomial time array dataflow analysis, Robert Seater and David Wonnacott

Using accessory functions to generalize dynamic dispatch in single-dispatch object-oriented languages, David Wonnacott

Submissions from 2000

An Open Source Computer Science Laboratory, John P. Dougherty and T. Miller

Omega Calculator and Library (Omega Project): release 1.2, W. Kelly, W. Maslov, E. Pugh, and David Wonnacott

The Role of Decidability in First Order Separations over Classes of Finite Structures, Steven Lindell and Scott Weinstein

Extending scalar optimizations for arrays, David Wonnacott

Using time skewing to eliminate idle time due to memory bandwidth and network limitations, David Wonnacott

Submissions from 1999

Structured performability analysis of parallel applications, John P. Dougherty

Time skewing for parallel computers, David Wonnacott

Submissions from 1998

Elementary Properties of the Finite Ranks, Anuj Dawar, Kees Doets, Steven Lindell, and Scott Weinstein

Constraint-based array dependence analysis, William Pugh and David Wonnacott

Submissions from 1996

First Order Logic, Fixed Point Logic and Linear Order, Anuj Dawar, Steven Lindell, and Scott Weinstein

Generalized Implicit Definitions on Finite Structures, St Grumbach, Z. Lacroix, and Steven Lindell

Submissions from 1995

Infinitary Logic and Inductive Definability over Finite Structures, Anuj Dawar, Steven Lindell, and Scott Weinstein

Omega Library and Omega Calculator (Omega Project), W. Kelly, W. Maslov, E. Pugh, and David Wonnacott

Petit (Omega Project), W. Kelly, W. Maslov, E. Pugh, and David Wonnacott

Constant-Space Sequential Model of Computation for First-Order Logic, Steven Lindell

Going beyond integer programming with the Omega test to eliminate false data dependences, William Pugh and David Wonnacott

Non-linear array dependence analysis, William Pugh and David Wonnacott

Submissions from 1994

Experiences with constraint-based array dependence analysis, William Pugh and David Wonnacott

Static analysis of upper and lower bounds on dependences and parallelism, William Pugh and David Wonnacott

Submissions from 1993

Made-to-measure: computing a great fit, John P. Dougherty

Exact method for analysis of value-based array data dependences, William Pugh and David Wonnacott

Submissions from 1992

PDF

A Purely Logical Characterization of Circuit Uniformity, Steven Lindell

Invariant Problem for Binary String Structures and the Parallel Complexity Theory of Queries, Steven Lindell

Logspace Algorithm for Tree Canonization, Steven Lindell

Eliminating false data dependences using the Omega test, William Pugh and David Wonnacott

Submissions from 1991

Analysis of Fixed-Point Queries on Binary Trees, Steven Lindell