MétaCan
Menu
Back to cohort
Record W2594091530

Automatic prediction of the severity of bugs using stack traces

2016· article· en· W2594091530 on OpenAlexaff
Korosh Koochekian Sabor, Mohammad Hamdaqa, Abdelwahab Hamou‐Lhadj

Bibliographic record

VenuePolyPublie (École Polytechnique de Montréal) · 2016
Typearticle
Languageen
FieldComputer Science
TopicSoftware Engineering Research
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer scienceSoftware bugStack (abstract data type)CrashEclipseData miningFunction (biology)Process (computing)Software regressionMachine learningProgramming languageSoftwareSoftware qualitySoftware development
DOInot available

Abstract

fetched live from OpenAlex

The severity of a bug is a measure of how a defect affects the functionality of a system. Developers refer to the severity of the reported bugs to prioritize the handling of bug reports. The process of assigning a severity level to a bug is performed manually, often by inexperienced users, making it time consuming and error prone. Existing techniques for automatically predicting the severity of bugs rely on text mining and information retrieval algorithms applied to the description of the bugs. The problem is that the description tends to be too informal and not quite reliable. In this paper, we show how information found in stack traces (a more formal source of data containing the history of function calls to the function in which the crash happened) can be used to automatically predict the severity of bugs. Our experiments with Eclipse bug reports submitted between 2001 to 2015 show that stack traces are a better feature for predicting the severity of bugs than the bug description.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.013
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.014
Threshold uncertainty score0.027

Distilled classifier scores by category (both heads)

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

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.016
GPT teacher head0.238
Teacher spread0.223 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations12
Published2016
Admission routes1
Has abstractyes

Explore more

Same venuePolyPublie (École Polytechnique de Montréal)Same topicSoftware Engineering ResearchFrench-language works237,207