作者: Akash Lal , Thomas Reps , Gogul Balakrishnan
DOI: 10.1007/11513988_44
关键词: Data flow diagram 、 Theoretical computer science 、 Call site 、 Reachability problem 、 Set (abstract data type) 、 Local variable 、 Computer science 、 Dataflow 、 Generalization 、 Node (networking)
摘要: Recent work on weighted-pushdown systems shows how to generalize interprocedural-dataflow analysis answer “stack-qualified queries”, which the question “what dataflow values hold at a program node for particular set of calling contexts?” The generalization, however, does not account precise handling local variables. Extended-weighted-pushdown address this issue, and provide answers stack-qualified queries in presence variables as well.