Proceedings of the 34th Annual Computer Security Applications Conference 2018
DOI: 10.1145/3274694.3274718
|View full text |Cite
|
Sign up to set email alerts
|

A Heuristic Framework to Detect Concurrency Vulnerabilities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
18
0

Year Published

2020
2020
2025
2025

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(18 citation statements)
references
References 25 publications
0
18
0
Order By: Relevance
“…Several fuzzing techniques have been designed to effectively detect concurrency bugs by prioritizing seed inputs that can trigger more concurrent code or particular interleavings [5,33,41]. Although useful, these techniques target concurrency bugs due to misuse of shared memory and are thus unlikely to detect channelrelated bugs.…”
Section: Related Workmentioning
confidence: 99%
“…Several fuzzing techniques have been designed to effectively detect concurrency bugs by prioritizing seed inputs that can trigger more concurrent code or particular interleavings [5,33,41]. Although useful, these techniques target concurrency bugs due to misuse of shared memory and are thus unlikely to detect channelrelated bugs.…”
Section: Related Workmentioning
confidence: 99%
“…Existing methods mostly are based on monitoring memory access and find concurrency errors, or through static analyze of the code fragments. DCtest [13] proposes a framework that also combines static analysis and fuzzing, with static analysis to locate and analyze sensitive concurrent parts in a program based on previously categorized features of several potential concurrency errors types, with the results fed into the fuzzers in order to trigger the suspected concurrency vulnerabilities. Others like [2][3] focus on feature customization and thus remove such potential bugs and errors.…”
Section: Related Workmentioning
confidence: 99%
“…Existing research on this topic mainly pay attention on data race condition or data hazards. For example, [12] [14] and [10]mainly combined static analysis and fuzz testing to find such concurrency vulnerabilities, using the results of static analysis of potential concurrency vulnerability to guide a coverage-based fuzzer, AFL for example, trying to trigger the suspicious vulnerabilities.…”
mentioning
confidence: 99%
“…• Use non-GNN model: Generally, the output in the first stage is in the form of a graph, so the graph needs to be encoded, converted into a vector, and then fed to the model. A series of work similar to SySeVR [94],Vuldeelocator [95]- [98], the code is segmented at the token level, the semantic information inside the slice is relatively strong, and then Word2Vec [52] is used for the slice code mikolov2013efficient Vectorized representation, which converts the slice code into a vector representation. In the modeling phase, these algorithms use LSTM or GRU and their variants Bi-LSTM, Bi-GRU and other models for modeling training, and the final results perform well on their respective artificialy synthesized data sets.…”
Section: A Vulnerability Introductionmentioning
confidence: 99%