AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.7 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

An Improved String-Searching Algorithm and Its Application in Component Security Testing

Jinfu ChenSaihua CaiLili ZhuYuchi GuoRubing Huang( )Xiaolei ZhaoYunqi Sheng
School of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang 212013, China.
Show Author Information

Abstract

Mass monitor logs are produced during the process of component security testing. In order to mine the explicit and implicit security exception information of the tested component, the log should be searched for keyword strings. However, existing string-searching algorithms are not very efficient or appropriate for the operation of searching monitor logs during component security testing. For mining abnormal information effectively in monitor logs, an improved string-searching algorithm is proposed. The main idea of this algorithm is to search for the first occurrence of a character in the main string. The character should be different and farther from the last character in the pattern string. With this algorithm, the backward moving distance of the pattern string will be increased and the matching time will be optimized. In the end, we conduct an experimental study based on our approach, the results of which show that the proposed algorithm finds strings in monitor logs 11.5% more efficiently than existing approaches.

References

[1]
Chen J. F., Lu Y. S., and Wang H. H., Component security testing approach based on extended chemical abstract machine, International Journal of Software Engineering and Knowledge Engineering, vol. 22, no. 1, pp. 59-83, 2012.
[2]
Briand L. C., Labiche Y., and Sówka M. M., Automated, contract-based user testing of commercial-off-the-shelf components, in Proc. 28th Int. Software Engineering, Shanghai, China, 2006, pp. 92-101.
[3]
Chen J. F., Wang H. H., Towey D., Mao C. Y., Huang R. H., and Zhan Y. Z., Worst-input mutation approach to web services vulnerability testing based on SOAP messages, Tsinghua Science and Technology, vol. 19, no. 5, pp. 429-441, 2014.
[4]
Mao C. Y. and Lu Y. S., Research progress in testing techniques of component-based software, Journal of Computer Research and Development, vol. 43, no. 8, pp. 1375-1382, 2006.
[5]
Chen J. F., Lu Y. S., and Xie X. D., Testing approach of component security based on fault Injection, in Proc. Int. Computational Intelligence and Security, Harbin, China, 2007, pp. 763-767.
[6]
Chen J. F., Lu Y. S., and Xie X. D., A fault injection model of component security testing, Journal of Research and Development, vol. 46, no. 7, pp. 1127-1135, 2009.
[7]
Potter B., Mcgraw G., and Allen B., Software security testing, IEEE Security & Privacy, vol. 2, no. 5, pp. 81-85, 2004.
[8]
Kuhn D. R. and Gallo A. M., Software fault interactions and implications for software testing, IEEE Transactions on Software Engineering, vol. 30, no. 6, pp. 418-421, 2004.
[9]
Wang M. G., Jie J. J., Shi T. X., and Fang X., An agent-based autonomous component model for internetware, in Int. Web Information Systems and Mining, Nanjing, China, 2010, pp. 348-351.
[10]
Inverardi P. and Wolf A. L., Formal specifications and analysis of software architectures using the chemical abstract machine model, IEEE Transactions on Software Engineering, vol. 21, no. 4, pp. 373-386, 1995.
[11]
Ju A. and Wang A., Security testing in software engineering courses, in Proc. 34th ASEE/IEEE Frontiers in Education Conference, California, USA, 2004, pp. 13-18.
[12]
Knuth D. E., Morris J. H., and Pratt V. R., Fast pattern matching in strings, SIAM Journal on Computing, vol. 6, no. 2, pp. 323-350, 1977.
[13]
Durian B., Holub J., Peltola H., and Tarhi J., Improving practical exact string matching, Information Processing Letters, vol. 110, no. 4, pp. 148-152, 2010.
[14]
Boyer R. S. and Moore J. S., A fast string-searching algorithm, Communications of the ACM, vol. 20, no. 10, pp. 762-772, 1977.
[15]
Tevatia S., Prasad R., and Rai D., An offensive algorithm for multi-pattern parameterized string matching, in Int. Control, Computing, Communication and Materials, 2013, pp. 1-5.
[16]
Faro S. and Külekci M. O., Fast multiple string matching using streaming SIMD extensions technology, in String Processing and Information Retrieval, Springer-Verlag Berlin Heidelberg, 2012.
[17]
Lecroq T., Fast exact string matching algorithms, Information Processing Letters, vol. 102, no. 6, pp. 229-235, 2007.
[18]
Sunday D. M., A very fast substring search algorithm, Communications of the ACM, vol. 33, no. 8, pp. 132-142, 1990.
[19]
Faro S. and Lecroq T., Efficient pattern matching on binary strings, in Proc. 35th Int. Current Trends in Theory and Practice  of  Computer  Science,  Spindleruv  Mlyn,  Czech Republic, 2009.
[20]
Faro S. and Külekci M. O., Fast packed string matching for short patterns, in Proc. 15th Meeting on Algorithm Engineering and Experiments, New Orleans, USA, 2013, pp. 113-121.
[21]
Faro S. and Lecroq T., The exact online string matching problem: A review of the most recent results, ACM Computing Surveys, vol. 45, no. 2, p. 13, 2013.
[22]
Le H. and Prasanna V. K., A memory-efficient and modular approach for large-scale string pattern matching, Proceedings of IEEE Conference on Computers, vol. 62, no. 5, pp. 844-857, 2013.
Tsinghua Science and Technology
Pages 281-294
Cite this article:
Chen J, Cai S, Zhu L, et al. An Improved String-Searching Algorithm and Its Application in Component Security Testing. Tsinghua Science and Technology, 2016, 21(3): 281-294. https://doi.org/10.1109/TST.2016.7488739

466

Views

9

Downloads

4

Crossref

N/A

Web of Science

6

Scopus

1

CSCD

Altmetrics

Received: 07 June 2015
Revised: 01 August 2015
Accepted: 19 February 2016
Published: 13 June 2016
© The author(s) 2016
Return