An Effective Long String Searching Algorithm towards Component Security Testing

Jinfu Chen

doi:10.1109/CC.2016.7781726

An Effective Long String Searching Algorithm towards Component Security Testing

2016-11-01

4

PRE

AI

DOI：10.1109/CC.2016.7781726

原文链接

摘要

En 中文

In the execution of method invocation sequences to test component security, abnormal or normal information is generated and recorded in a monitor log. By searching abnormal information from monitor log, the exceptions that the component has can be determined. To facilitate the searching process, string searching methods could be employed. However, current approaches are not effective enough to search long pattern string. In order to mine the specific information with less number of matches, we proposed an improved Sunday string searching algorithm in this paper. Unlike Sunday algorithm which does not make use of the already matched characters, the proposed approach presents two ideas utilizing and recycling these characters. We take advantage of all matched characters in main string, if they are still in the matchable interval compared with pattern string, to increase the distance that pattern string moves backwards. Experimental analysis shows that, compared to Sunday algorithm, our method could greatly reduce the matching times, if the scale of character set constituting both main string and pattern string is small, or if the length of pattern string is long. Also, the proposed approach can improve the search effectiveness for abnormal information in component security testing.

Keyword:

component testing

security detection

monitor log

abnormal information

string-searching

An Effective Long String Searching Algorithm towards Component Security Testing

摘要

AI总结

期刊

机构

引用论文