Title :
An Approach to Fully Recognizing Addressable Expression
Author :
Yukun Dong ; Ying Xing ; Dahai Jin ; Yunzhan Gong ; Kai Liu
Author_Institution :
State Key Lab. of Networking & Switching Tech, Beijing Univ. of Posts & Telecommun., Beijing, China
Abstract :
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.
Keywords :
C language; grammars; program diagnostics; reasoning about programs; tree data structures; type theory; AST; C addressable expressions; C program; abstract syntax tree; grammar patterns; naming rule; program complexity; real-world programs; sound static analysis; type inference rule; Abstracts; Arrays; Benchmark testing; Educational institutions; Grammar; Syntactics; addressable expression; static analysis; type inference rule;
Conference_Titel :
Quality Software (QSIC), 2013 13th International Conference on
Conference_Location :
Najing
DOI :
10.1109/QSIC.2013.64