Search
Now showing items 1-10 of 102
Soft typing: An approach to type checking for dynamically typed languages
(1991)
In an effort to avoid improper use of program functions, modern programming languages employ some kind of preventative type system. These type systems can be classified as either static or dynamic. Static type systems ...
Krylov-secant methods for solving large-scale systems of coupled nonlinear parabolic equations
(1997)
This dissertation centers on two major aspects dictating the computational time of applications based on the solution of systems of coupled nonlinear parabolic equations: nonlinear and linear iterations. The former aspect ...
Lazy release consistency for distributed shared memory
(1995)
A software distributed shared memory (DSM) system allows shared memory parallel programs to execute on networks of workstations. This thesis presents a new class of protocols that has lower communication requirements than ...
A theory of photometric stereo for a general class of reflectance maps
(1990)
Photometric stereo is an image processing technique for 2$1\over 2$ dimensional surface reconstruction from local shading. The classical theory of photometric stereo has been developed only for surfaces that reflect in a ...
In search of optimal human-expert system explanations: Empirical studies of human-human and human-expert system interactions
(1993)
In this project explanations were studied along a continuum ranging from human-human interactions to human-expert system interactions with the goal of identifying features of successful expert system explanations. The ...
Register allocation via graph coloring
(1992)
Chaitin and his colleagues at IBM in Yorktown Heights built the first global register allocator based on graph coloring. This thesis describes a series of improvements and extensions to the Yorktown allocator. There are ...
Combining analyses, combining optimizations
(1995)
This thesis presents a framework for describing optimizations. It shows how to combine two such frameworks and how to reason about the properties of the resulting framework. The structure of the framework provides insight ...
Universal domains for sequential computation
(1995)
Classical recursion theory asserts that all conventional programming languages are equally expressive because they can define all partial recursive functions over the natural numbers. However, most real programming languages ...
Distributed system fault tolerance using message logging and checkpointing
(1990)
Fault tolerance can allow processes executing in a computer system to survive failures within the system. This thesis addresses the theory and practice of transparent fault-tolerance methods using message logging and ...
Hierarchical attribute grammars: Dialects, applications and evaluation algorithms
(1992)
Although attribute grammars have been applied successfully to the specification of many different phases of analysis and transformation of complex language processing systems, including type checking, data flow analysis, ...