Improving the results of static analyses of programs by local decreasing iterations
- 1 January 1992
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Static analysis of arithmetical congruencesInternational Journal of Computer Mathematics, 1989
- Introducing symbolic problem solving techniques in the dependence testing phases of a vectorizerPublished by Association for Computing Machinery (ACM) ,1988
- Automatic translation of FORTRAN programs to vector formACM Transactions on Programming Languages and Systems, 1987
- The theory of strictness analysis for higher order functionsPublished by Springer Nature ,1986
- The theory and practice of transforming call-by-need into call-by-valuePublished by Springer Nature ,1980
- Constructive versions of Tarski’s fixed point theoremsPacific Journal of Mathematics, 1979
- Affine relationships among variables of a programActa Informatica, 1976
- Global Data Flow Analysis and Iterative AlgorithmsJournal of the ACM, 1976
- A synthesizer of inductive assertionsIEEE Transactions on Software Engineering, 1975