2021 IEEE/ACM 43rd International Conference on Software Engineering (ICSE) 2021
DOI: 10.1109/icse43902.2021.00071
|View full text |Cite
|
Sign up to set email alerts
|

Fuzzing Symbolic Expressions

Abstract: Recent years have witnessed a wide array of results in software testing, exploring different approaches and methodologies ranging from fuzzers to symbolic engines, with a full spectrum of instances in between such as concolic execution and hybrid fuzzing. A key ingredient of many of these tools is Satisfiability Modulo Theories (SMT) solvers, which are used to reason over symbolic expressions collected during the analysis. In this paper, we investigate whether techniques borrowed from the fuzzing domain can be… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
2
2

Relationship

1
6

Authors

Journals

citations
Cited by 18 publications
(3 citation statements)
references
References 29 publications
0
3
0
Order By: Relevance
“…Magic values involve multi-byte comparisons, while traditional structure-blind mutators treat the input as a byte stream, making it highly improbable to match all the involved bytes. Potential solutions include using specialized feedback for partial progress in comparisons [2,27] employing concolic execution for white-box fuzzing [12,50], or techniques that extract comparison operands to replace input segments [4,40]. Checksums, often used for validation in binary formats, pose even greater difficulty.…”
Section: Modern Fuzzing Advancementsmentioning
confidence: 99%
“…Magic values involve multi-byte comparisons, while traditional structure-blind mutators treat the input as a byte stream, making it highly improbable to match all the involved bytes. Potential solutions include using specialized feedback for partial progress in comparisons [2,27] employing concolic execution for white-box fuzzing [12,50], or techniques that extract comparison operands to replace input segments [4,40]. Checksums, often used for validation in binary formats, pose even greater difficulty.…”
Section: Modern Fuzzing Advancementsmentioning
confidence: 99%
“…It pays more attention to the mutation methods, such as input structurebased mutation [6] and generation strategy based on deep learning [47]. e white-box fuzzing consists in constructing test cases based on the internal logic of the programs and maximizing the code coverage by using dynamic symbol execution [48,49] and taint analysis [50]. SAGE [51] is one of the representative tools.…”
Section: Related Workmentioning
confidence: 99%
“…Droidscope and TaintDroid [44,19] are among the first approaches to have adopted this technique. Subsequent works built upon and improved TaintDroid [34,43,42] by using, e.g., concolic execution [14,12,11]. Unfortunately, a challenge is how to generate the right executions that will reach a function.…”
Section: Background and Related Workmentioning
confidence: 99%