TY - GEN
T1 - A new method of software security checking based on similar feature tree
AU - Ren, Jiadong
AU - Meng, Lili
AU - Hu, Changzhen
AU - Wang, Kunsheng
PY - 2009
Y1 - 2009
N2 - In order to optimize the fault feature database(FFD) and to improve the checking efficiency of software fault, in this paper, a novel method of software security checking based on similar feature tree(SFT) is proposed. All of fault feature patterns in FFD are considered as nodes of SFT. SFT is a special binary tree in which the left child of each node is a super-pattern of the node and the right child is a brother-pattern of the node. An improved K-modes clustering algorithm and association rules are used to construct SFT. According to the characteristics of association rules, if a fault feature which is obtained by program slicing from software procedure can't successfully matches to root of SFT, then it matches to the right child of the root. Otherwise the fault feature matches to the left child of the root. This process is iterated according to "even left not right" rule until leaf node in right sub-tree or no node can be successfully matched in left sub-tree. Finally, the checking result is given by SFT. Experimental results show that our method has higher efficiency of software fault checking.
AB - In order to optimize the fault feature database(FFD) and to improve the checking efficiency of software fault, in this paper, a novel method of software security checking based on similar feature tree(SFT) is proposed. All of fault feature patterns in FFD are considered as nodes of SFT. SFT is a special binary tree in which the left child of each node is a super-pattern of the node and the right child is a brother-pattern of the node. An improved K-modes clustering algorithm and association rules are used to construct SFT. According to the characteristics of association rules, if a fault feature which is obtained by program slicing from software procedure can't successfully matches to root of SFT, then it matches to the right child of the root. Otherwise the fault feature matches to the left child of the root. This process is iterated according to "even left not right" rule until leaf node in right sub-tree or no node can be successfully matched in left sub-tree. Finally, the checking result is given by SFT. Experimental results show that our method has higher efficiency of software fault checking.
KW - K-modes
KW - Software fault
KW - Software security checking
UR - http://www.scopus.com/inward/record.url?scp=77952777559&partnerID=8YFLogxK
U2 - 10.1109/ICISE.2009.96
DO - 10.1109/ICISE.2009.96
M3 - Conference contribution
AN - SCOPUS:77952777559
SN - 9780769538877
T3 - 2009 1st International Conference on Information Science and Engineering, ICISE 2009
SP - 1553
EP - 1556
BT - 2009 1st International Conference on Information Science and Engineering, ICISE 2009
T2 - 1st International Conference on Information Science and Engineering, ICISE2009
Y2 - 26 December 2009 through 28 December 2009
ER -