Scaling Concolic Execution of Binary Programs for Security Applications
Explore this paper's citation graph
Summary
Three scaling techniques for concolic execution are developed that work on program binaries and do not require the presence of source code or debugging information in the binaries.
- Type
- article
- Published
- 2013-08-01
- Cited by
- 3
- References
- 116
- OpenAlex
- https://openalex.org/W1779373593
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:15202224
Keywords
Concolic testing, Symbolic execution, Computer science, Program analysis, Code (set theory)
References
- Towards Automatic Discovery of Deviations in Binary Implementations with Applications to Error Detection and Fingerprint Generation
- MACE: Model-inference-Assisted Concolic Exploration for Protocol and Vulnerability Discovery
- IntScope: Automatically Detecting Integer Overflow Vulnerability in X86 Binary Using Symbolic Execution
- Automated Whitebox Fuzz Testing
- Take Two Software Updates and See Me in the Morning: The Case for Software Security Evaluations of Medical Devices
- Automatic Protocol Format Reverse Engineering through Context-Aware Monitored Execution
- Binary Code Extraction and Interface Identification for Security Applications
- Towards Generating High Coverage Vulnerability-Based Signatures with Protocol-Level Constraint-Guided Exploration
- AEG: Automatic Exploit Generation
- Technology, Policy, Law, and Ethics Regarding U.S. Acquisition and Use of Cyberattack Capabilities
- Dynamic Test Generation to Find Integer Bugs in x86 Binary Linux Programs
- Insights from the Inside: A View of Botnet Management from Infiltration
- Discoverer: Automatic Protocol Reverse Engineering from Network Traces
- Limits of Learning-based Signature Generation with Adversaries
- Black Box Checking
- Colin de la Higuera: Grammatical inference: learning automata and grammars
- KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs
- Scalable error detection using boolean satisfiability
- Inspector Gadget: Automated Extraction of Proprietary Gadgets from Malware Binaries
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
Cited by
Related papers
- SynFuzz: Efficient Concolic Execution via Branch Condition Synthesis
- Dynamic Symbolic Execution of Higher-Order Functions
- Novel Approach to Improve Concolic Testing
- A Search Strategy Guided by Uncovered Branches for Concolic Testing
- TRANSIT: specifying protocols with concolic snippets
- MultiSE: multi-path symbolic execution using value summaries