Study on Software Vulnerability Dynamic Discovering System

Guang Jun Song; Chun Lan Zhao; Ming Li

doi:10.4028/www.scientific.net/AMM.151.673

Paper Titles

Research and Implementation on Face Recognition Algorithm
p.657

Method of Fault Character Extraction for Diesel Engine Based on Multivariate Time Series
p.661

The Preparation of a Novel Environmentally Friendly Green Antimicrobial Packaging Film
p.665

A Synthetic Encryption Scheme on Attribute Granularity in the ODB Model
p.668

Study on Software Vulnerability Dynamic Discovering System
p.673

Restudy on the Sampling Distribution of Coefficient of Variation for a Normal Population
p.678

A Fast Orthoimage Mosaic Method for Application of Grid
p.685

Selecting Problem from Design Contradiction Set Found in QFD
p.690

A Decision Making Approach for Selecting Inventive Principles from Contradiction Matrix
p.695

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 151Study on Software Vulnerability Dynamic...

Study on Software Vulnerability Dynamic Discovering System

Abstract:

Developed a new system model of software vulnerability discovering, which was based on fuzzing, feature matching of API sequences and data mining. Overcame the disadvantages of old techniques, this new method effectively improves the detection of potential unknown security vulnerabilities in software. Besides, this method is more automated and performs better in finding new security vulnerabilities.

You might also be interested in these eBooks

New Trends in Mechatronics and Materials Engineering

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 151)

Pages:

673-677

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.151.673

Citation:

Cite this paper

Online since:

January 2012

Authors:

Guang Jun Song, Chun Lan Zhao, Ming Li

Keywords:

Data Mining (DM), Fuzzing, Software Vulnerability, Vulnerability Detection

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Forrest S, Hofmeyr S.A., Somayaji A., Longstaff T.A. A sense of self for UNIX processes, Proceedings of the 1996 IEEE Symposium on Security and Privacy, 1996, 120-128.

DOI: 10.1109/secpri.1996.502675

Google Scholar

[2] Lee W, Stolfo S J. Data mining approaches for intrusion detection[C]. Proc of the 7th USENIX Security Symp. San Antonio：USENIX，1998：6-9.

Google Scholar

[3] Lane T. Hidden Markov models for human/computer interface modeling[C]. Procof the International AI Society. Proc of the IJCAI- 99 Workshop on Learning about Users. Stockholm：International AI Society，1999：35- 44.

Google Scholar

[4] Sekar R, Bendre M, Dhurjati D, et al. A fast automaton–based method for detecting anomalous program behaviors[C]/IEEE Computer Society. Oakland：IEEE，2000：144-155.

DOI: 10.1109/secpri.2001.924295

Google Scholar

[5] Ghosh AK, Schwartzbard A, A study in using neural networks for anomaly and misuse detection, Proceedings of USENIX security symposium, 1999, 51-62.

Google Scholar

[6] Zhang C L, Jiang J, Mohamed K. Intrusion detection using hierar-chical neural networks[J]. Pattern Recognition Letters，2005，26(6): 779- 791.

Google Scholar

[7] Han S J, Cho S B. Evolutionary neural networks for anomaly detection based on the behavior of a program[J]. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 2006, 36(3): 559- 570.

DOI: 10.1109/tsmcb.2005.860136

Google Scholar

[8] R. Agrawal, and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Databases(VLDB'94), Sep. (1994).

Google Scholar

[9] J. Han, J. Pei, and Y. Yin. Mining. Frequent patterns without candidate generation. In Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'00), pp.1-12, May (2000).

DOI: 10.1145/335191.335372

Google Scholar

[10] M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New Algorithms for Fast Discovery of Association Rules. Proc. 3rd Int. Conf. on Knowledge Discovery and Data Mining (KDD'97, Newport Beach, CA), 283–296. AAAI Press, Menlo Park, CA, USA (1997).

DOI: 10.1007/978-1-4615-5669-5_1

Google Scholar

[11] Christian Borgelt. Keeping Things Simple: Finding Frequent Item Sets by Recursive Elimination Workshop Open Source Data Mining Software (OSDM'05, Chicago, IL), 66-70. ACM Press, New York, NY, USA (2005).

DOI: 10.1145/1133905.1133914

Google Scholar