David R. Chase

Learn More
trees A tree is built out of nodes with zero or more children. A child of a node is another tree. A node with no children is called a leaf. All nodes have labels, and all nodes with the same label have the same number of children. In this paper, the number of children associated with a label A is arily(A), and a tree labelled A with children tl through t,(More)
This paper describes ways that storage allocation optimization, though “correct”, can convert a running program into one that fails. A general “safety condition” is proposed and applied to some existing and proposed storage allocation optimizations. These are shown to be unsafe or not general. Application of the safety condition yields several classes of(More)
Historically our paper was important because it demonstrated that it was possible to get useful information about linked data structures in a practical amount of time. At the time of publication, there was some interest in pointer analysis from the theoretical community, but these algorithms were generally impractical. Our paper presented a technique that(More)
In this paper (chapter) I describe several classes of garbage collection algorithms, and provide a few examples (both real and hypothetical) of each. This collection is by no means complete; Cohen [Coh81] presents an exhaustive collection, but I am more interested in describing a few representative collectors in detail and providing examples for a later(More)
We present a novel, high-resolution magnetic resonance technique, fine structure analysis (FSA) for the quantification and analysis of amorphous and quasi-amorphous biological structures. The one-dimensional technique is introduced mathematically and then applied to one simulated phantom, two physical phantoms and a set of ex vivo biological samples,(More)
  • 1