Static analyses of congruence properties on rational numbers

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

Volumn 1302 LNCS, Issue , 1997, Pages 278-292

  Granger, Philippe ^a  

^a ENSTA PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ANALYSIS FRAMEWORKS; CONGRUENCE ANALYSIS; INTEGER NUMBERS; RATIONAL NUMBERS; REAL-VALUED VARIABLES;

STATIC ANALYSIS;

EID: 85011706801     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0032748     Document Type: Conference Paper

References (18)

1. R. Allen, K. Kennedy, Automatic Translation of FORTRAN Programs to Vector Form, ACM Transactions on Programming Languages and Systems, Vol. 9, No. 4, pp. 491-542, 1987.
2. P. Cousot, R. Cousot, Static Determination of Dynamic Properties of Programs, Proceedings of the 2nd International Symposium on Programming, Dunod, Paris, pp. 106-130, 1976.
3. P. Cousot, R. Cousot, Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints, Conf. Rec. of the 4th ACM Symposium on Principles of Programming Languages, pp. 238-252, 1977.
4. P. Cousot, R. Cousot, Systematic Design of Program Analysis Frameworks, Conf. Rec. of the 6th ACM Symposium on Principles of Programming Languages, pp. 269-282, 1979.
5. P. Cousot, N. Halbwachs, Automatic Discovery of Linear Restraints among Variables of a Program, Conf. Rec. of the 5th ACM Symposium on Principles of Programming Languages, pp. 84-97, 1978.
6. A. Deutsch, A Storeless Model of Aliasing and its Abstractions using Finite Representations of Right-Regular Equivalence Relations, Proceedings of the IEEE 1992 International Conference on Computer Languages, Oakland, CA, pp. 2-13, 1992.
7. N. Jacobson, Basic Algebra, W. H. Freeman and Company, 1985.
8. P. Granger, Static Analysis of Arithmetical Congruences, International Journal of Computer Mathematics, Vol. 30, pp. 165-190, 1989.
9. P. Granger, Static Analysis of Linear Congruence Equalities among Variables of a Program, TAPSOFT’91, Proceedings of the International Joint conference on Theory and Practice of Software Development, Brighton, U.K., Vol. 1 (CAAP’91), Springer-Verlag Lecture Notes in Computer Science, Vol. 493, pp. 169-192, 1991.
10. P. Granger, Analyses Sémantiques de Congruence, Thèse de Doctorat, École Polytechnique, 1991.
11. P. Granger, Improving the Results of Static Analyses of Programs by Local Decreasing Iterations (Extended Abstract), Proc. of Foundations of Software Technology and Theoretical Computer Science, 12th Conference, Springer-Verlag Lecture Notes in Computer Science 652, pp. 68-79, 1992.
12. M. Karr, Affine Relationships among Variables of a Program, Acta Informatica, Vol. 6, pp. 133-151, 1976.
13. G. A. Kildall, A Unified Approach to Global Program Optimization, Conf. Rec. of the ACM Symposium on Principles of Programming Languages, pp. 194-206, 1973.
14. A. Lichnewsky, F. Thomasset, Introducing Symbolic Problems Solving Techniques in the Dependence Phases of a Vectorizer, Proceedings of the 2nd ACM International Conference on Supercomputing, Saint-Malo, France, pp. 396-406, 1988.
15. F. Masdupuy, Using Abstract Interpretation to Detect Array Data Dependencies, Proceedings of the International Symposium on Supercomputing, Fukuoka, Japan, pp. 19-27, 1991.
16. F. Masdupuy, Semantic Analysis of Interval Congruences, Proc. of Formal Methods in Programming and Their Applications, Springer-Verlag Lecture Notes in Computer Science 735, pp.142-155, 1993.
17. N. Mercouroff, An Algorithm for Analyzing Communicating Processes, Proceedings of Mathematical Foundations of Programming Semantics, Pittsburgh, PA, Springer-Verlag Lecture Notes in Computer Science, Vol. 598, pp. 312-325, 1991.
18. A. Mycroft, The Theory and Practice of Transforming Call-by-need into Call-by-value, Proceedings of the 4th International Symposium on Programming, Springer-Verlag Lecture Notes in Computer Science, Vol. 83, pp. 269-281, 1980.