CONTROL FLOW ANALYSIS USING DEDUCTIVE REACHING DEFINITIONS

摘要

In an illustrative embodiment a computer-implemented process for deductivereachingdefinition analysis receives a control flow graph to form a set of receivedblocks and edges,performs traditional reaching definitions to produce bit-vectors OUT(b),GEN(b) and KILL(b) foreach block in the set of received blocks and receives impossibility indicatorsfor a set ofdefinitions that are impossible on specific edges. The computer-implementedprocess furtherperforms deduction operations using a combination of the bit-vectors andimpossibilityindicators to deduce that additional definitions cannot reach certain blocksto create resultingreachability information and provides the resulting reachability informationas a result to arequestor.