next up previous
Next: About this document Up: The Omega Calculator Previous: 5.1 Current limitations


D. C. Cooper. Programs for mechanical program verification. In B. Meltzer and D. Michie, editors, Machine Intelligence 6, pages 43--59. American Elsevier, New York, 1971.

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.

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

Wayne Kelly and William Pugh. A framework for unifying reordering transformations. Technical Report CS-TR-3193, Dept. of Computer Science, University of Maryland, College Park, April 1993.

Wayne Kelly and William Pugh. Determining schedules based on performance estimation. Parallel Processing Letters, 4(3):205--219, September 1994.

Wayne Kelly and William Pugh. Finding legal reordering transformations using mappings. In Lecture Notes in Computer Science 892: Seventh International Workshop on Languages and Compilers for Parallel Computing, Ithaca, NY, August 1994. Springer-Verlag.

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.

Robert E. Shostak. On the sup-inf method for proving presburger formulas. Journal of the ACM, 24(4):529--543, October 1977.

Robert E. Shostak. A practical decision procedure for arithmetic with function symbols. Journal of the ACM, 26(2):351--360, April 1979.

Web Accessibility