MétaCan
Menu
Back to cohort

Input Output Grammar Coverage in Fuzzing

2023· article· en· W4390189471 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSoftware Testing and Debugging Techniques
Canadian institutionsRoyal Military College of CanadaQueen's University
Fundersnot available
KeywordsFuzz testingComputer scienceGrammarCode coverageCode (set theory)Natural language processingData miningArtificial intelligenceProgramming languageSet (abstract data type)Software

Abstract

fetched live from OpenAlex

Fuzz testing enables the discovery of vulnerabilities, ideally providing details to help mitigate such issues and measure the extent to which code branches were tested. The inputs used during fuzz testing can usually be specified using a grammar. The complexity of the grammar of the input can be reflected in the different code branches covered during testing. The hypothesis of this research is that coverage of the input grammar can provide some prediction of the code coverage achieved during fuzz testing. In this work, grammar coverage is compared to code coverage using the LibAFL framework and the Knot DNS server as the target, comparing the well known AFL feedback against nine other feedback algorithms.A key to this approach is using the input language to build feature vectors which represent the structure and abstract the values of the input. This research demonstrated that grammar-based coverage is useful in the absence of execution data, both for fuzzing feedback and for identifying potentially erroneous output data.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.864
Threshold uncertainty score0.304

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.033
GPT teacher head0.271
Teacher spread0.238 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it