Control flow analysis using deductive reaching definitions
作者： Allan H. Kielstra , Patrick R. Doyle , Pramod Ramarao
DOI:
关键词:
摘要: A computer-implemented process for deductive reaching definition analysis receives a control flow graph to form set of received blocks and edges, performs traditional definitions produce bit-vectors OUT(b), GEN(b) KILL(b) each block in the impossibility indicators that are impossible on specific edges. The further deduction operations using combination deduce additional cannot reach certain create resulting reachability information provides as result requestor. related system program product is also provided.
lens.org 参考文章(25)
Tibor Gyimóthy, Rudolf Ferenc, Attila Bicsák, Ákos Kiss, Constructing control flows graphs of binary executable programs at post-link time ,(2003)
Ronnie Ira Chaiken, David Mitford Gillies, Assigning free register to unmaterialized predicate in inverse predicate expression obtained for branch reversal in predicated execution system ,(2004)
Hirohisa Tanaka, Junko Sayama, Akira Tanaka, Optimization apparatus which removes transfer instructions by a global analysis of equivalence relations ,(1997)
David Binkley, Interprocedural Constant Propagation using Dependence Graphs and a Data-Flow Model compiler construction. pp. 374- 388 ,(1994) , 10.1007/3-540-57877-3_25
Tin-Fook Ngai, Peinan Zhang, Buqi Cheng, Zhaohui Du, Method and system for intermediate representation of source code ,(2008)
Allan H. Kielstra, Generating object code that uses calculated contents for a variable determined from a predicate ,(2010)
Motohiro Kawahito, Optimization of a target program ,(2007)
John R. Allen, Inferring Function Calls In An Ambiguous Language Computer Program ,(2004)
Girish B. Chafle, Sunil Chandra, Vijay Mann, Sugata Ghosal, Mangala G. Nanda, System and method for orchestrating composite web services in constrained data flow environments ,(2004)