Precise interprocedural dataflow analysis with applications to constant propagation
作者： Mooly Sagiv , Thomas Reps , Susan Horwitz
DOI: 10.1016/0304-3975(96)00072-2
关键词:
摘要: This paper concerns interprocedural dataflow-analysis problems in which the dataflow information at a program point is represented by an environment (i.e., mapping from symbols to values), and effect of operation distributive transformer. We present efficient dynamic-programming algorithm that produces precise solutions.
core.ac.uk
acm.org
elsevier.com
springer.com 
sci-hub.se 参考文章(30)
Thomas Reps, Solving Demand Versions of Interprocedural Analysis Problems compiler construction. pp. 389- 403 ,(1994) , 10.1007/3-540-57877-3_26
Charles N. Fischer, Ronald K. Cytron, Richard J. LeBlanc, Crafting a Compiler ,(1988)
Yehoshua Sagiv, François Bancilhon, David Maier, Jeffrey D. Ullman, Magic Sets and Other Strange Ways to Implement Logic Programs. symposium on principles of database systems. pp. 1- 15 ,(1986)
Thomas W. Reps, Demand Interprocedural Program Analysis Using Logic Databases logic in databases. pp. 163- 196 ,(1995) , 10.1007/978-1-4615-2207-2_8
Radhia Cousot, Patrick Cousot, Static determination of dynamic properties of recursive procedures Formal Description of Programming Concepts. pp. 237- 277 ,(1977)
Jens Knoop, Bernhard Steffen, The Interprocedural Coincidence Theorem compiler construction. pp. 125- 140 ,(1992) , 10.1007/3-540-55984-1_13
Raghu Ramakrishnan, Applications of Logic Databases ,(1993)
Mooly Sagiv, Thomas Reps, Susan Horwitz, Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation colloquium on trees in algebra and programming. pp. 651- 665 ,(1995) , 10.1007/3-540-59293-8_226
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
Robert Giegerich, Ulrich Möncke, Invariance of Approximate Semantics with Respect to Program Transformations GI - 11. Jahrestagung in Verbindung mit Third Conference of the European Co-operation in Informatics (ECI). pp. 1- 10 ,(1981) , 10.1007/978-3-662-01089-1_1