MétaCan
Menu
Back to cohort
Record W2810463508 · doi:10.1109/mtv.2017.19

Dynamic Exerciser Template Weighting in x86 Processor Verification

2017· article· en· W2810463508 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 institutionsAdvanced Micro Devices (Canada)
Fundersnot available
KeywordsComputer sciencex86TemplateWeightingFunctional verificationEmbedded systemComputer engineeringTheoretical computer scienceFormal verificationSoftwareOperating systemProgramming language

Abstract

fetched live from OpenAlex

Modern digital designs are becoming increasingly complex, which makes their verification a harder process. In modern processors, Random ISA level verification is used to run many diverse stimulus programs to verify a wide variety of desired properties. Random verification uses Exercisers to randomly generate functional ISA level stimulus using predefined templates. The number of simulation slots that are assigned to each template is determined by their assigned weights which reflect the importance of the template, and is currently determined by expert engineers. In this paper, we present a tool to dynamically assign a proper weight to each template based on its ability to successfully generate stimulus programs and its potential of capturing defects in the current phase of the design. The tool is integrated to the verification of a state of the art x86 processor and it was able to hit four new and unique bugs, as well as achieving 40% reduction in the rate of failed to generate stimulus programs while maintaining pass rate and number of signatures hit unchanged.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.738
Threshold uncertainty score0.320

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.021
GPT teacher head0.303
Teacher spread0.281 · 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