next up previous contents
Next: About this document Up: The Omega Library Interface Previous: 6.9 Reclaiming memory used


D. C. Cooper. Theorem proving in arithmetic with multiplication. In B. Meltzer and D. Michie, editors, Machine Intelligence 7, pages 91--99. American Elsevier, New York, 1972.

P. Downey. Undeciability of presburger arithmetic with a single monadic predicate letter. Technical Report 18-72, Center for Research in Computing Technology, Havard Univ., 1972.

G. Kreisel and J. L. Krevine. Elements of Mathematical Logic. North-Holland Pub. Co., 1967.

Wayne Kelly, William Pugh, and Evan Rosser. Code generation for multiple mappings. In The 5th Symposium on the Frontiers of Massively Parallel Computation, pages 332--341, McLean, Virginia, February 1995.

Wayne Kelly, William Pugh, Evan Rosser, and Tatiana Shpeisman. Transitive closure of infinite graphs and its applications. In Eighth Annual Workshop on Programming Languages and Compilers for Parallel Computing, Columbus, OH, August 1995.

D. Oppen. A upper bound on the complexity of presburger arithmetic. Journal of Computer and System Sciences, 16(3):323--332, July 1978.

William Pugh and David Wonnacott. An exact method for analysis of value-based array data dependences. In Lecture Notes in Computer Science 768: Sixth Annual Workshop on Programming Languages and Compilers for Parallel Computing, Portland, OR, August 1993. Springer-Verlag.

William Pugh and David Wonnacott. Nonlinear array dependence analysis. Technical Report CS-TR-3372, Dept. of Computer Science, University of Maryland, College Park, November 1994.