Polynomial constants are decidable

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2477, Issue , 2002, Pages 4-19

  Müller Olm, Markus ^a   Seidl, Helmut ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL CIRCUITS; COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; COMPUTER PROGRAMMING; GRAPHIC METHODS; INTEGER PROGRAMMING; POLYNOMIALS; STATIC ANALYSIS;

CONSTANT PROPAGATION; CONSTANT VALUES; GENERIC ALGORITHM; RING THEORY; RUNTIMES; WEAKEST PRECONDITION;

FLOW GRAPHS;

EID: 84958740430     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45789-5_4     Document Type: Conference Paper

References (20)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986.
2. K. R. Apt and G. D. Plotkin. Countable nondeterminism and random assignment. Journal of the ACM, 33(4):724–767, 1986.
3. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings 4th POPL, Los Angeles, California, 1977.
4. P. Cousot and R. Cousot. Abstract interpretation frameworks. J.L ogic Computat., 4(2):511–547, 1992.
5. J. H. Davenport, Y. Siret, and E. Tournier. Computer Algebra: Systems and Algorithms for Algebraic Computation. Academic Press, 1988.
6. E. W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976.
7. C. Fischer and R. LeBlanc. Crafting a Compiler. Benjamin/Cummings Publishing Co., Inc., Menlo Park, CA, 1988.
8. K. O. Geddes, S. R. Czapor, and G. Labahn. Algorithms for Computer Algebra. Kluwer, 1992.
9. M. S. Hecht. Flow analysis of computer programs. Elsevier North-Holland, 1977.
10. M. Karr. Affine relationships among variables of a program. Acta Informatica, 6:133–151, 1976.
11. Mathematics of Program Construction Group. Fixed-point calculus. Information Processing Letters, 53(3):131–136, 1995.
12. Y. V. Matiyasevich. Hilbert’s Tenth Problem. The MIT Press, 1993.
13. A. Melton, D. A. Schmidt, and G. E. Strecker. Galois connections and computer science applications. In D. Pitt, S. Abramsky, A. Poigne, and D. Rydeheard, editors, Category Theory and Computer Programming, LNCS 240, pages 299–312. Springer-Verlag, 1985.
14. B. Mishra. Algorithmic Algebra. Springer-Verlag, 1993.
15. S. S. Muchnick. Advanced compiler design and implementation. Morgan Kaufmann Publishers, San Francisco, California, 1997.
16. M. Müuller-Olm and O. Rüthing. The complexity of constant propagation. In D. Sands, editor, ESOP 2001, LNCS 2028, pages 190–205. Springer, 2001.
17. J. R. Reif and H. R. Lewis. Symbolic evaluation and the global value graph. In Conf.R ec.4th ACM Symposium on Principles of Programming Languages POPL’77, pages 104–118, Los Angeles, CA, January 1977.
18. M. Sagiv, T. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. Theoretical Computer Science, 167(1 2):131–170, 1996.
19. B. Steffen and J. Knoop. Finite constants: Characterizations of a new decidable set of constants. Theoretical Computer Science, 80(2):303–318, 1991.
20. F. Winkler. Polynomial Algorithms. Springer-Verlag, 1996.