dc.contributor.authorDing, Sun
dc.contributor.authorTan, Hee Beng Kuan
dc.contributor.authorLiu, Kaiping
dc.contributor.authorChandramohan, Mahinthan
dc.contributor.authorZhang, Hongyu
dc.description.abstractBuffer overflow vulnerability is one of the major security threats for applications written in C/C++. Among the existing approaches for detecting buffer overflow vulnerability, though flow sensitive based approaches offer higher precision but they are limited by heavy overhead and the fact that many constraints are unsolvable. We propose a novel method to efficiently detect vulnerable buffer overflows in any given control flow graph through recognizing two patterns. The proposed approach first uses syntax analysis to filter away those branches that cannot possibly comply with any of the two patterns before applying a limited symbolic evaluation for a precise matching against the patterns. The proposed approach only needs to evaluate a limited set of selected branch predicates according to the patterns and avoids the need to deal with a large number of general branch predicates. This significantly improves the scalability while not sacrificing the detection precision. Our experiments demonstrate the scalability and efficiency of the proposed method, which demonstrates its applicability.en_US
dc.subjectDRNTU::Engineering::Electrical and electronic engineering
dc.titleDetection of buffer overflow vulnerabilities in C/C++ with pattern based limited symbolic evaluationen_US
dc.typeConference Paper
dc.contributor.conferenceIEEE Annual Computer Software and Applications Conference Workshops (36th : 2012 : Izmir, Turkey)en_US
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record