Precise interprocedural analysis through linear algebra
- 1 January 2004
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 39 (1) , 330-341
- https://doi.org/10.1145/982962.964029
Abstract
We apply linear algebra techniques to precise interproceduraldataflow analysis. Specifically, we describe analyses that determinefor each program point identities that are valid among theprogram variables whenever control reaches that program point.Our analyses fully interpret assignment statements with affine expressionson the right hand side while considering other assignmentsas non-deterministic and ignoring conditions at branches.Under this abstraction, the analysis computes the set...Keywords
This publication has 10 references indexed in Scilit:
- Discovering affine equalities using random interpretationPublished by Association for Computing Machinery (ACM) ,2003
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretationTheoretical Computer Science, 2002
- Precise interprocedural dataflow analysis with applications to constant propagationTheoretical Computer Science, 1996
- Precise interprocedural dataflow analysis via graph reachabilityPublished by Association for Computing Machinery (ACM) ,1995
- A generalization of the differential approach to recursive query evaluationThe Journal of Logic Programming, 1987
- Countable nondeterminism and random assignmentJournal of the ACM, 1986
- Finite Differencing of Computable ExpressionsACM Transactions on Programming Languages and Systems, 1982
- Automatic discovery of linear restraints among variables of a programPublished by Association for Computing Machinery (ACM) ,1978
- Static determination of dynamic properties of generalized type unionsPublished by Association for Computing Machinery (ACM) ,1977
- Affine relationships among variables of a programActa Informatica, 1976