An empirical study on classification methods for alarms from a bug-finding static C analyzer

DOI10.1016/j.ipl.2006.11.004zbMath1184.68158OpenAlexW2149462209MaRDI QIDQ845982

Hosik Choi, Jaehwang Kim, Yongdai Kim, Kwangkeun Yi

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.004

zbMATH Keywords

static analysisabstract interpretationprogram correctnessclassification methodsstatistical post analysis

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items (1)

Learning analysis strategies for Octagon and context sensitivity from labeled data generated by static analyses

Cites Work

• Greedy function approximation: A gradient boosting machine.
• Bagging predictors
• An extensive comparison of recent classification tools applied to microarray data
• Systematic design of program transformation frameworks by abstract interpretation
• The elements of statistical learning. Data mining, inference, and prediction
• Random forests
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An empirical study on classification methods for alarms from a bug-finding static C analyzer