Skip to main content
Conference ProceedingsOPEN ACCESS

Static analysis of linear congruence equalities among variables of a program

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 493 LNCS 169-192
DOI: 10.1007/3-540-53982-4_10
95Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper is dedicated to the presentation of a new static analysis of programs conceived for discovering linear congruence equations satisfied by integer valued variables (or more generally by any set of integer values abstracted from a program). This analysis generalizes both P. Granger's arithmetical congruence analysis and M. Karr's affine equation analysis. An example shows that it can provide valuable results for automatic vectorization.

Author supplied keywords

Cite

CITATION STYLE

APA

Granger, P. (1991). Static analysis of linear congruence equalities among variables of a program. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 493 LNCS, pp. 169–192). Springer Verlag. https://doi.org/10.1007/3-540-53982-4_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free