Interprocedural Abstract Interpretation of Block Structured Languages with Nested Procedures, Aliasing and Recursivity

@inproceedings{Bourdoncle1990InterproceduralAI,
  title={Interprocedural Abstract Interpretation of Block Structured Languages with Nested Procedures, Aliasing and Recursivity},
  author={François Bourdoncle},
  booktitle={PLILP},
  year={1990}
}
We are now going to abstract the Call and Return primitives. Let (g, r) be the current abstract stack. We use the following notations: g = ~ P , c , h , ~ , ~ / r = {(gi, ui)}iEl , , = r(g) E ~ ~ [ . ] The abstract store v = v[p] thus corresponds to the current generalized control point g, and p is the set of locations accessible to procedure P. In order to deal with the locations created during procedure calls, we will use the function A +t,_,u + : SVal [p-] --+ S--V-~[# +] which takes and… CONTINUE READING

References

Publications referenced by this paper.

Patrick Cousot and Nicolas Halbwachs : " Automatic discovery of linear constraints among variables of a program "

  • Alan J. Demers, Anne Neirynck
  • 1981

Similar Papers

Loading similar papers…