Anna Corazza

Anna Corazza


Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2011
Verified
Conference Paper
Closed access
ACAnna Corazza
Anna Corazza
Sergio Di MartinoSergio Di Martino
Sergio Di Martino
VMValerio Maggio
Valerio Maggio
GSGiuseppe Scanniello
Giuseppe Scanniello
Developers have a lot of freedom in writing comments as well as in choosing identifiers and method names. These are intentional in nature and provide a different relevance of information to understand what a software system implements, and in particular the role of each source file. In this paper we investigate the effectiveness of exploiting lexical information for software system clustering. In particular we explore the contribution of the combined use of six different dictionaries, corresponding to the six parts of the source code where programmers introduce lexical information, namely: class, attribute, method and parameter names, comments, and source code statements. Their relevance has been weighted by means of a probabilistic model, whose parameters have been estimated by the Expectation-Maximization algorithm. To group source files accordingly we used a hierarchical clustering algorithm. The investigation has been conducted on a dataset of 13 open source Java software systems.

6 December 2011 in Empirical Software Engineering
Verified
Journal Article
Open access
PDF file
ACAnna Corazza
Anna Corazza
Sergio Di MartinoSergio Di Martino
Sergio Di Martino
FFF. Ferrucci
F. Ferrucci
CGC. Gravino
C. Gravino
FSF. Sarro
F. Sarro
EME. Mendes
E. Mendes
Recent studies have reported that Support Vector Regression (SVR) has the potential as a technique for software development effort estimation. However, its prediction accuracy is heavily influenced by the setting of parameters that needs to be done when employing it. No general guidelines are available to select these parameters, whose choice also depends on the characteristics of the dataset being used. This motivated the work described in (Corazza et al. 2010), extended herein. In order to automatically select suitable SVR parameters we proposed an approach based on the use of the meta-heuristics Tabu Search (TS). We designed TS to search for the parameters of both the support vector algorithm and of the employed kernel function, namely RBF. We empirically assessed the effectiveness of the approach using different types of datasets (single and cross-company datasets, Web and not Web projects) from the PROMISE repository and from the Tukutuku database. A total of 21 datasets were employed to perform a 10-fold or a leave-one-out cross-validation, depending on the size of the dataset. Several benchmarks were taken into account to assess both the effectiveness of TS to set SVR parameters and the prediction accuracy of the proposed approach with respect to widely used effort estimation techniques. The use of TS allowed us to automatically obtain suitable parameters’ choices required to run SVR. Moreover, the combination of TS and SVR significantly outperformed all the other techniques. The proposed approach represents a suitable technique for software development effort estimation.

1 September 2012
Verified
Conference Paper
Closed access
ACAnna Corazza
Anna Corazza
Sergio Di MartinoSergio Di Martino
Sergio Di Martino
VMValerio Maggio
Valerio Maggio
Information Retrieval (IR) techniques are being exploited by an increasing number of tools supporting Software Maintenance activities. Indeed the lexical information embedded in the source code can be valuable for tasks such as concept location, clustering or recovery of traceability links. The application of such IR-based techniques relies on the consistency of the lexicon available in the different artifacts, and their effectiveness can worsen if programmers introduce abbreviations (e.g: rect) and/or do not strictly follow naming conventions such as Camel Case (e.g: UTFtoASCII). In this paper we propose an approach to automatically split identifiers in their composing words, and expand abbreviations. The solution is based on a graph model and performs in linear time with respect to the size of the dictionary, taking advantage of an approximate string matching technique. The proposed technique exploits a number of different dictionaries, referring to increasingly broader contexts, in order to achieve a disambiguation strategy based on the knowledge gathered from the most appropriate domain. The approach has been compared to other splitting and expansion techniques, using freely available oracles for the identifiers extracted from 24 C/C++ and Java open source systems. Results show an improvement in both splitting and expanding performance, in addition to a strong enhancement in the computational efficiency.

12 September 2010
Verified
Conference Paper
Open access
PDF file
ACAnna Corazza
Anna Corazza
Sergio Di MartinoSergio Di Martino
Sergio Di Martino
FFF. Ferrucci
F. Ferrucci
CGC. Gravino
C. Gravino
FSF. Sarro
F. Sarro
EME. Mendes
E. Mendes

1 March 2010
Verified
Conference Paper
Closed access
ACAnna Corazza
Anna Corazza
Sergio Di MartinoSergio Di Martino
Sergio Di Martino
GSGiuseppe Scanniello
Giuseppe Scanniello
In this paper we present a clustering based approach to partition software systems into meaningful subsystems. In particular, the approach uses lexical information extracted from four zones in Java classes, which may provide a different contribution towards software systems partitioning. To automatically weigh these zones, we introduced a probabilistic model, and applied the Expectation-Maximization (EM) algorithm. To group classes according to the considered lexical information, we customized the well-known K-Medoids algorithm. To assess the approach and the implemented supporting system, we have conducted a case study on six open source software systems.

7 November 2016 in Software Quality Journal
Verified
Journal Article
Closed access
PDF file
ACAnna Corazza
Anna Corazza
VMValerio Maggio
Valerio Maggio
GSGiuseppe Scanniello
Giuseppe Scanniello