Improving the results of static analyses of programs by local decreasing iterations

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

Volumn 652 LNCS, Issue , 1992, Pages 69-79

  Granger, Philippe ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ITERATIVE METHODS; MODEL CHECKING;

ABSTRACT INTERPRETATIONS; ANALYSIS FRAMEWORKS; BACKWARDS ANALYSIS; CONDITIONAL BRANCH; CONSTANT PROPAGATION; RANGE ANALYSIS; SYMBOLIC EVALUATION; THEORETIC MODEL;

STATIC ANALYSIS;

EID: 84976665103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56287-7_95     Document Type: Conference Paper

References (22)

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. G. L. Burn, C. L. Hankin, S. Abramsky, The Theory of Strictness Analysis for Higher Order Functions, Proceedings of the DIKU Workshop on Programs as Data Objects, LNCS 217, pp. 42-62, 1986.
3. 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.
4. 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. 238252, 1977.
5. P. Cousot, R. Cousot, A Constructive Characterization of the Lattices of all Retractions, Preclosure, Quasi-closure and Closure Operators on a Complete Lattice, Porlugaliae Mathematica, Vol. 38, Fasc. 1-2, pp. 185-198, 1979.
6. P. Cousot, R. Cousot, Constructive Versions of Tarski’s Fixed Point Theorem, Pacific Journal of Mathematics, Vol. 82, No. 1, pp. 43-57, 1979.
7. P. Cousot, R. Cousot, Systematic Design of Program Analysis Frameworks, Conf. Rec. of the 6th A CM Symposium on Principles of Programming Languages, pp. 269-282, 1979.
8. 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.
9. A. Deutsch, A Storeless Model of Aliasing and its Abstractions using Finite Representations of Right-Regular Equivalence Relations, Proceedings of the 4th IEEE International Conference on Computer Languages, pp. 2-13, 1992.
10. S. M. German, B. Wegbreit, A Synthesizer of Inductive Assertions, IEEE Transactions on Software Engineering, Vol. se-1, No. 1, pp. 68-75, 1975.
11. P. Granger, Static Analysis of Arithmetical Congruences, International Journal of Computer Mathematics, Vol. 30, pp. 165-190, 1989.
12. 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), LNCS 493, pp. 169-192, 1991.
13. J. B. Kam, J. D. Ullman, Global Data Flow Analysis and Iterative Algorithms, Journal of the Association for Computing Machinery, Vol. 23, No. 1, pp. 158-171, 1976.
14. M. Karr, Affine Relationships among Variables of a Program, Acta Informatica, Vol. 6, pp. 133-151, 1976.
15. 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.
16. A. Lichnewsky, F. Thomasset, Introducing Symbolic Problem 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.
17. A. Mycroft, The Theory and Practice of Transforming Call-by-need into Call-by-value, Proceedings of the 4th International Symposium on Programming, LNCS 83, pp. 269-281, 1980.
18. J. H. Reif, H. R. Lewis, Symbolic Evaluation and the Global Value Graph, Conf. Rec. of the 4th ACM Symposium on Principles of Programming Languages, pp. 104-118, 1977.
19. B. Steffen, J. Knoop, Finite Constants: Characterizations of a New Decidable Set of Constants, Proceedings of Mathematical Foundations of Computer Science 1989, LNCS 379, pp. 481-491, 1989.
20. B. Wegbreit, Property Extraction in Well-founded Property Sets, IEEE Transactions on Software Engineering, Vol. se-1, No. 3, pp. 270-285, 1975.
21. M. N. Wegman, F. K. Zadeck, Constant Propagation with Conditional Branches, Conf. Rec. of the 12th ACM Symposium on Principles of Programming Languages, pp. 291-299, 1985.
22. O. Zariski, P. Samuel, Commutative Algebra, Vol. 1, Van Nostrand, 1958.