Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rebecca Saul

dblp:334/4278 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Systems and software security · 83% Malware analysis · 17%
Software engineering, system software, and programming languages
1 paper
Software testing · 100%

Topics — the 3 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Systems and software security
binary analysis
1.522024
Is Function Similarity Over-Engineered? Building a Benchmark · NeurIPS 2024
Assemblage: Automatic Binary Dataset Construction for Machine Learning · NeurIPS 2024
Systems and software security › binary analysis
binary function similarity
1.522024
Is Function Similarity Over-Engineered? Building a Benchmark · NeurIPS 2024
Assemblage: Automatic Binary Dataset Construction for Machine Learning · NeurIPS 2024
Malware analysis
malware classification
0.812024
Assemblage: Automatic Binary Dataset Construction for Machine Learning · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

machine learning · 2.3disassembly · 1.5decompilation · 1.5
YearPublicationVenuePosition
2024 Assemblage: Automatic Binary Dataset Construction for Machine Learning
abstract
Binary code is pervasive, and binary analysis is a key task in reverse engineering, malware classification, and vulnerability discovery. Unfortunately, while there exist large corpuses of malicious binaries, obtaining high-quality corpuses of benign binaries for modern systems has proven challenging (e.g., due to licensing issues). Consequently, machine learning based pipelines for binary analysis utilize either costly commercial corpuses (e.g., VirusTotal) or open-source binaries (e.g., coreutils) available in limited quantities. To address these issues, we present Assemblage: an extensible cloud-based distributed system that crawls, configures, and builds Windows PE binaries to obtain high-quality binary corpuses suitable for training state-of-the-art models in binary analysis. We have run Assemblage on AWS over the past year, producing 890k Windows PE and 428k Linux ELF binaries across 29 configurations. Assemblage is designed to be both reproducible and extensible, enabling users to publish "recipes" for their datasets, and facilitating the extraction of a wide array of features. We evaluated Assemblage by using its data to train modern learning-based pipelines for compiler provenance and binary function similarity. Our results illustrate the practical need for robust corpuses of high-quality Windows PE binaries in training modern learning-based binary analyses.
Chang Liu 0188, Rebecca Saul, Yihao Sun 0003, Edward Raff, Maya Fuchs, Townsend Southard Pantano, James Holt, Kristopher K. Micinski
NeurIPS2
2024 Is Function Similarity Over-Engineered? Building a Benchmark
abstract
Binary analysis is a core component of many critical security tasks, including reverse engineering, malware analysis, and vulnerability detection. Manual analysis is often time-consuming, but identifying commonly-used or previously-seen functions can reduce the time it takes to understand a new file. However, given the complexity of assembly, and the NP-hard nature of determining function equivalence, this task is extremely difficult. Common approaches often use sophisticated disassembly and decompilation tools, graph analysis, and other expensive pre-processing steps to perform function similarity searches over some corpus. In this work, we identify a number of discrepancies between the current research environment and the underlying application need. To remedy this, we build a new benchmark, REFuSe-Bench, for binary function similarity detection consisting of high-quality datasets and tests that better reflect real-world use cases. In doing so, we address issues like data duplication and accurate labeling, experiment with real malware, and perform the first serious evaluation of ML binary function similarity models on Windows data. Our benchmark reveals that a new, simple baseline — one which looks at only the raw bytes of a function, and requires no disassembly or other pre-processing --- is able to achieve state-of-the-art performance in multiple settings. Our findings challenge conventional assumptions that complex models with highly-engineered features are being used to their full potential, and demonstrate that simpler approaches can provide significant value.
Rebecca Saul, Chang Liu 0188, Noah Fleischmann, Richard Zak, Kristopher K. Micinski, Edward Raff, James Holt
NeurIPS1