A Framework to Compare Alert Ranking Algorithms

Allier, Simon; Hora, Andre; Anquetil, Nicolas; Ducasse, Stephane

Document type :

Communication dans un congrès avec actes

Title :

A Framework to Compare Alert Ranking Algorithms

Author(s) :

Allier, Simon [Auteur correspondant]
Analyses and Languages Constructs for Object-Oriented Application Evolution [RMOD]
Hora, Andre [Auteur]
Analyses and Languages Constructs for Object-Oriented Application Evolution [RMOD]
Anquetil, Nicolas [Auteur]

Analyses and Languages Constructs for Object-Oriented Application Evolution [RMOD]
Ducasse, Stephane [Auteur]

Analyses and Languages Constructs for Object-Oriented Application Evolution [RMOD]

Conference title :

19th Working Conference on Reverse Engineering

City :

Kingston

Country :

Canada

Start date of the conference :

2012-10-15

Book title :

19th Working Conference on Reverse Engineering (WCRE 2012)

Publication date :

2012-10-15

HAL domain(s) :

Informatique [cs]/Génie logiciel [cs.SE]

English abstract : [en]

To improve software quality, rule checkers statically check if a software contains violations of good programming practices. On a real sized system, the alerts (rule violations detected by the tool) may be numbered by the ...
Show more >To improve software quality, rule checkers statically check if a software contains violations of good programming practices. On a real sized system, the alerts (rule violations detected by the tool) may be numbered by the thousands. Unfor- tunately, these tools generate a high proportion of "false alerts", which in the context of a specific software, should not be fixed. Huge numbers of false alerts may render impossible the finding and correction of "true alerts" and dissuade developers from using these tools. In order to overcome this problem, the literature provides different ranking methods that aim at computing the probability of an alert being a "true one". In this paper, we propose a framework for comparing these ranking algorithms and identify the best approach to rank alerts. We have selected six algorithms described in literature. For comparison, we use a benchmark covering two programming languages (Java and Smalltalk) and three rule checkers (FindBug, PMD, SmallLint). Results show that the best ranking methods are based on the history of past alerts and their location. We could not identify any significant advantage in using statistical tools such as linear regression or Bayesian networks or ad-hoc methods.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :

Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL

Files

https://hal.archives-ouvertes.fr/hal-00747817/document
Open access
Access the document

https://hal.archives-ouvertes.fr/hal-00747817/document
Open access
Access the document

document
Open access
Access the document

wcre2012.pdf
Open access
Access the document

document
Open access
Access the document

wcre2012.pdf
Open access
Access the document

A Framework to Compare Alert Ranking Algorithms BibTeX CSV Excel RIS

Files

A Framework to Compare Alert Ranking Algorithms

BibTeX

CSV

Excel

RIS