An Approach to Fully Recognizing Addressable Expression

On account of the complexity of programs, it is a difficult work to recognize all addressable expressions, which is one of the preconditions of sound static analysis. This paper introduces an approach to recognizing all addressable expressions of C program. Firstly, we induce grammar patterns of C addressable expressions, mapping each kind of them to node of abstract syntax tree (AST), providing the corresponding naming rule and type inference rule. Then, we demonstrate an approach that recognizes C addressable expressions based on AST. In order to validate the adequacy of our approach, five real-world programs are utilized to perform experimental analysis. The result shows that our approach could recognize all kinds of addressable expressions.