Anna Corazza
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Anna Corazza has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Sergio Di Martino
Università degli Studi di Napoli Federico II, Italy
14 shared publications - Giuseppe Scanniello
University of Salerno
8 shared publications - Valerio Maggio
Fondazione Bruno Kessler, Trento, Italy
8 shared publications - Anita Alicante
Università degli Studi di Napoli Federico II
6 shared publications - Carmine Gravino
University of Salerno
5 shared publications R. De Mori
Univ. of Avignon, Avignon, France
4 shared publications
Latest Publications
- 15 February 2024
- Published by Wiley in Journal of Software: Evolution and Process
- Vol. 36 (8)
Regression test prioritization leveraging source code similarity with tree kernels
Regression test prioritization (RTP) is an active research field, aiming at re‐ordering the tests in a test suite to maximize the rate at which faults are detected. A number of RTP strategies have been proposed, leveraging different factors to reorder tests. Some techniques include an analysis of changed source code, to assign higher priority to tests stressing modified parts of the codebase. Still, most of these change‐based solutions focus on simple text‐level comparisons among versions. We believe that measuring source code changes in a more refined way, capable of discriminating between mere textual changes (e.g., renaming of a local variable) and more structural changes (e.g., changes in the control flow), could lead to significant benefits in RTP, under the assumption that major structural changes are also more likely to introduce faults. To this end, we propose two novel RTP techniques that leverage tree kernels (TK), a class of similarity functions largely used in Natural Language Processing on tree‐structured data. In particular, we apply TKs to abstract syntax trees of source code, to more precisely quantify the extent of structural changes in the source code, and prioritize tests accordingly. We assessed the effectiveness of the proposals by conducting an empirical study on five real‐world Java projects, also used in a number of RTP‐related papers. We automatically generated, for each considered pair of software versions (i.e., old version, new version) in the evolution of the involved projects, 100 variations with artificially injected faults, leading to over 5k different software evolution scenarios overall. We compared the proposed prioritization approaches against well‐known prioritization techniques, evaluating both their effectiveness and their execution times. Our findings show that leveraging more refined code change analysis techniques to quantify the extent of changes in source code can lead to relevant improvements in prioritization effectiveness, while typically introducing negligible overheads due to their execution.
- 15 February 2024
- Published by Wiley in Journal of Software: Evolution and Process
- Vol. 36 (8)
Regression test prioritization leveraging source code similarity with tree kernels
Regression test prioritization (RTP) is an active research field, aiming at re‐ordering the tests in a test suite to maximize the rate at which faults are detected. A number of RTP strategies have been proposed, leveraging different factors to reorder tests. Some techniques include an analysis of changed source code, to assign higher priority to tests stressing modified parts of the codebase. Still, most of these change‐based solutions focus on simple text‐level comparisons among versions. We believe that measuring source code changes in a more refined way, capable of discriminating between mere textual changes (e.g., renaming of a local variable) and more structural changes (e.g., changes in the control flow), could lead to significant benefits in RTP, under the assumption that major structural changes are also more likely to introduce faults. To this end, we propose two novel RTP techniques that leverage tree kernels (TK), a class of similarity functions largely used in Natural Language Processing on tree‐structured data. In particular, we apply TKs to abstract syntax trees of source code, to more precisely quantify the extent of structural changes in the source code, and prioritize tests accordingly. We assessed the effectiveness of the proposals by conducting an empirical study on five real‐world Java projects, also used in a number of RTP‐related papers. We automatically generated, for each considered pair of software versions (i.e., old version, new version) in the evolution of the involved projects, 100 variations with artificially injected faults, leading to over 5k different software evolution scenarios overall. We compared the proposed prioritization approaches against well‐known prioritization techniques, evaluating both their effectiveness and their execution times. Our findings show that leveraging more refined code change analysis techniques to quantify the extent of changes in source code can lead to relevant improvements in prioritization effectiveness, while typically introducing negligible overheads due to their execution.
- 2 December 2020
- Published by Springer Nature
- p. 272-285
Inspecting Code Churns to Prioritize Test Cases
- 2 December 2020
- Published by Springer Nature
- p. 272-285
Inspecting Code Churns to Prioritize Test Cases
- Open Access
- 12 October 2018
- Published by MDPI AG in Information
- Vol. 9 (10) , 252
Integration of Context Information through Probabilistic Ontological Knowledge into Image Classification
The use of ontological knowledge to improve classification results is a promising line of research. The availability of a probabilistic ontology raises the possibility of combining the probabilities coming from the ontology with the ones produced by a multi-class classifier that detects particular objects in an image. This combination not only provides the relations existing between the different segments, but can also improve the classification accuracy. In fact, it is known that the contextual information can often give information that suggests the correct class. This paper proposes a possible model that implements this integration, and the experimental assessment shows the effectiveness of the integration, especially when the classifier’s accuracy is relatively low. To assess the performance of the proposed model, we designed and implemented a simulated classifier that allows a priori decisions of its performance with sufficient precision.
- 12 October 2018
- Published by MDPI AG in Information
- Vol. 9 (10) , 252
Open AccessIntegration of Context Information through Probabilistic Ontological Knowledge into Image Classification
The use of ontological knowledge to improve classification results is a promising line of research. The availability of a probabilistic ontology raises the possibility of combining the probabilities coming from the ontology with the ones produced by a multi-class classifier that detects particular objects in an image. This combination not only provides the relations existing between the different segments, but can also improve the classification accuracy. In fact, it is known that the contextual information can often give information that suggests the correct class. This paper proposes a possible model that implements this integration, and the experimental assessment shows the effectiveness of the integration, especially when the classifier’s accuracy is relatively low. To assess the performance of the proposed model, we designed and implemented a simulated classifier that allows a priori decisions of its performance with sufficient precision.
- 7 November 2016
- Published by Springer Nature in Software Quality Journal
- Vol. 26 (2) , 751-777
Coherence of comments and method implementations: a dataset and an empirical investigation
- 7 November 2016
- Published by Springer Nature in Software Quality Journal
- Vol. 26 (2) , 751-777
Coherence of comments and method implementations: a dataset and an empirical investigation
- Open Access
- 1 January 2016
- Published by OpenEdition
- p. 100-104
A New Dataset for Source Code Comment Coherence
Source code comments provide useful insights on a codebase and on the intent behind design decisions and goals. Often, the information provided in the comment of a method and in its corresponding implementation may be not coherent with each other (i.e., the comment does not properly describe the implementation). Several could be the motivations for this issue (e.g., comment and source code do not evolve coherently). In this paper, we present the results of a manual assessment on the coherence between comments and implementations of 3, 636 methods, gathered from 4 Java open-source software. The results of this assessment has been collected in a dataset that we made publicly available on the web. We also sketch here the protocol to create this dataset.
- 1 January 2016
- Published by OpenEdition
- p. 100-104
Open AccessA New Dataset for Source Code Comment Coherence
Source code comments provide useful insights on a codebase and on the intent behind design decisions and goals. Often, the information provided in the comment of a method and in its corresponding implementation may be not coherent with each other (i.e., the comment does not properly describe the implementation). Several could be the motivations for this issue (e.g., comment and source code do not evolve coherently). In this paper, we present the results of a manual assessment on the coherence between comments and implementations of 3, 636 methods, gathered from 4 Java open-source software. The results of this assessment has been collected in a dataset that we made publicly available on the web. We also sketch here the protocol to create this dataset.
- Open Access
- 1 January 2016
- Published by OpenEdition
- p. 129-134
Topic Modelling with Word Embeddings
This work aims at evaluating and comparing two different frameworks for the unsupervised topic modelling of the CompWHoB Corpus, namely our political-linguistic dataset. The first approach is represented by the application of the latent DirichLet Allocation (henceforth LDA), defining the evaluation of this model as baseline of comparison. The second framework employs Word2Vec technique to learn the word vector representations to be later used to topic-model our data. Compared to the previously defined LDA baseline, results show that the use of Word2Vec word embeddings significantly improves topic modelling performance but only when an accurate and task-oriented linguistic pre-processing step is carried out.
- 1 January 2016
- Published by OpenEdition
- p. 129-134
Open AccessTopic Modelling with Word Embeddings
This work aims at evaluating and comparing two different frameworks for the unsupervised topic modelling of the CompWHoB Corpus, namely our political-linguistic dataset. The first approach is represented by the application of the latent DirichLet Allocation (henceforth LDA), defining the evaluation of this model as baseline of comparison. The second framework employs Word2Vec technique to learn the word vector representations to be later used to topic-model our data. Compared to the previously defined LDA baseline, results show that the use of Word2Vec word embeddings significantly improves topic modelling performance but only when an accurate and task-oriented linguistic pre-processing step is carried out.
- Open Access
- 1 January 2016
- Published by OpenEdition
- p. 29-33
Relation mining from clinical records
We propose a system to extract entities and relations from a set of clinical records in Italian based on two preceding works (Alicante et al., 2016b) and (Alicante et al., 2016a). This approach does not require annotated data and is based on existing domain lexical resources and unsupervised machine learning techniques.
- 1 January 2016
- Published by OpenEdition
- p. 29-33
Open AccessRelation mining from clinical records
We propose a system to extract entities and relations from a set of clinical records in Italian based on two preceding works (Alicante et al., 2016b) and (Alicante et al., 2016a). This approach does not require annotated data and is based on existing domain lexical resources and unsupervised machine learning techniques.
- Open Access
- 1 January 2016
- Published by OpenEdition
- p. 34-39
Twitter Sentiment Polarity Classification using Barrier Features
English. A crucial point for the applicability of sentiment analysis over Twitter is represented by the degree of manual intervention necessary to adapt the approach to the considered domain. In this work we propose a new sentiment polarity classifier exploiting barrier features, originally introduced for the classification of textual data. Empirical tests on SemEval2014 competition data sets show that such approach overcomes performance of baseline systems in nearly all cases.
- 1 January 2016
- Published by OpenEdition
- p. 34-39
Open AccessTwitter Sentiment Polarity Classification using Barrier Features
English. A crucial point for the applicability of sentiment analysis over Twitter is represented by the degree of manual intervention necessary to adapt the approach to the considered domain. In this work we propose a new sentiment polarity classifier exploiting barrier features, originally introduced for the classification of textual data. Empirical tests on SemEval2014 competition data sets show that such approach overcomes performance of baseline systems in nearly all cases.
- 1 January 2016
- Published by Inderscience Publishers in International Journal of Grid and Utility Computing
- Vol. 7 (4) , 245
A distributed architecture to integrate ontological knowledge into information extraction
In this work we propose a solution for the problem of the entities and relations extraction from textual documents to build an index for a semantically oriented search engine. The approach we propose is based on the integration of statistical classifiers and ontological constraints through Markov random fields. Owing to the high computational complexity of the approach, the architecture of our system is distributed and exploits parallelisation to lower processing time. In the experimental assessment we show how the proposed system can be effectively applied to a large data set, namely BioNLP-ST 2013. While the experimental results provided in the paper refer to a biomedical application, the approach is very general and can be ported to different domains.
- 1 January 2016
- Published by Inderscience Publishers in International Journal of Grid and Utility Computing
- Vol. 7 (4) , 245
A distributed architecture to integrate ontological knowledge into information extraction
In this work we propose a solution for the problem of the entities and relations extraction from textual documents to build an index for a semantically oriented search engine. The approach we propose is based on the integration of statistical classifiers and ontological constraints through Markov random fields. Owing to the high computational complexity of the approach, the architecture of our system is distributed and exploits parallelisation to lower processing time. In the experimental assessment we show how the proposed system can be effectively applied to a large data set, namely BioNLP-ST 2013. While the experimental results provided in the paper refer to a biomedical application, the approach is very general and can be ported to different domains.
- 21 March 2015
- Published by Springer Nature in Empirical Software Engineering
- Vol. 21 (1) , 72-103
Weighing lexical information for software clustering in the context of architecture recovery
- 21 March 2015
- Published by Springer Nature in Empirical Software Engineering
- Vol. 21 (1) , 72-103
Weighing lexical information for software clustering in the context of architecture recovery