Enhancing locality for recursive traversals of recursive structures

Dataaow Analysis for Recursive Structures

Recursive Assertions for Data Structures

We present an assertion language for expressing properties of data structures. Its key features are constraints over arrays, multisets and integers which allow the specification of basic assertions, and rules, which allow the recursive specification of assertions. This language can thus be used to define assertions to an arbitrary level of expressiveness, ranging from low-level properties of me...

Analysis of Parallelism in Recursive Functions on Recursive Data Structures

In functional languages, iterative operations on data collections are naturally expressed using recursive functions on recursive data structures. In this paper, we present a method to extract data parallelism from recursive functions and generate data parallel programs. As the parallel model for object programs, we use polytypic parallel skeletons. This model can express data parallel operation...

Shape Analysis and Cache Locality for Recursive Data Structures in Java

There is already a substantial amount of practical research into optimizing programs with static, sequential, array-based data structures. Numerical programs in particular tend to make heavy use of these data structures. However, not all numerical programs make heavy use of such structures, nor do many other programs we would like to be able to optimize. Another class of data structures which i...

0-1 Laws for Recursive Structures

We discuss resource-bounded measures on the class of recursive structures and prove that with respect to such measures a random recursive structure is almost surely isomorphic to the unique countable model of the extension axioms.