Recent work on weighted-pushdown systems shows how to generalize interprocedural-dataflow analysis to answer "stack-qualified queries", which answer the question "what dataflow values hold at a program node for a particular set of calling contexts?" The generalization, however, does not account for precise handling of local variables. Extended-weighted-pushdown systems address this issue, and provide answers to stack-qualified queries in the presence of local variables as well. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Lal, A., Reps, T., & Balakrishnan, G. (2005). Extended weighted pushdown systems. In Lecture Notes in Computer Science (Vol. 3576, pp. 434–448). Springer Verlag. https://doi.org/10.1007/11513988_44
Mendeley helps you to discover research relevant for your work.