A fast algorithm to locate concepts in execution traces

Authors:
Soumaya Medini;Philippe Galinier;Massimiliano Di Penta;Yann-Gaël Guéhéneuc;Giuliano Antoniol
Affiliations:
DGIGL, école Polytechnique de Montréal, Canada;DGIGL, école Polytechnique de Montréal, Canada;RCOST, University of Sannio, Italy;DGIGL, école Polytechnique de Montréal, Canada;DGIGL, école Polytechnique de Montréal, Canada
Venue:
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
Year:
2011

Citing 20
Cited 1

Introduction to algorithms

Introduction to algorithms
Program Concept Recognition and Transformation

IEEE Transactions on Software Engineering - Special issue on software maintenance
Software reconnaissance: mapping program features to code

Journal of Software Maintenance: Research and Practice
The concept assignment problem in program understanding

ICSE '93 Proceedings of the 15th international conference on Software Engineering
Extracting concepts from file names: a new file clustering criterion

Proceedings of the 20th international conference on Software engineering
Modern Information Retrieval

Modern Information Retrieval
Case Study of Feature Location Using Dependence Graph

IWPC '00 Proceedings of the 8th International Workshop on Program Comprehension
Aspect Mining through the Formal Concept Analysis of Execution Traces

WCRE '04 Proceedings of the 11th Working Conference on Reverse Engineering
An Information Retrieval Approach to Concept Location in Source Code

WCRE '04 Proceedings of the 11th Working Conference on Reverse Engineering
Feature Identification: A Novel Approach and a Case Study

ICSM '05 Proceedings of the 21st IEEE International Conference on Software Maintenance
Towards Employing Use-Cases and Dynamic Analysis to Comprehend Mozilla

ICSM '05 Proceedings of the 21st IEEE International Conference on Software Maintenance
On the Automatic Modularization of Software Systems Using the Bunch Tool

IEEE Transactions on Software Engineering
The Conceptual Coupling Metrics for Object-Oriented Systems

ICSM '06 Proceedings of the 22nd IEEE International Conference on Software Maintenance
Feature Identification: An Epidemiological Metaphor

IEEE Transactions on Software Engineering
Feature Location Using Probabilistic Ranking of Methods Based on Execution Scenarios and Information Retrieval

IEEE Transactions on Software Engineering
Using the Conceptual Cohesion of Classes for Fault Prediction in Object-Oriented Systems

IEEE Transactions on Software Engineering
CERBERUS: Tracing Requirements to Source Code Using Information Retrieval, Dynamic Analysis, and Program Analysis

ICPC '08 Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension
Concept Location with Genetic Algorithms: A Comparison of Four Distributed Architectures

SSBSE '10 Proceedings of the 2nd International Symposium on Search Based Software Engineering
Identification of behavioural and creational design motifs through dynamic analysis

Journal of Software Maintenance and Evolution: Research and Practice
A Heuristic-Based Approach to Identify Concepts in Execution Traces

CSMR '10 Proceedings of the 2010 14th European Conference on Software Maintenance and Reengineering

Stride: search-based deterministic replay in polynomial time via bounded linkage

Proceedings of the 34th International Conference on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The identification of cohesive segments in execution traces is an important step in concept location which, in turns, is of paramount importance for many program-comprehension activities. In this paper, we reformulate concept location as a trace segmentation problem solved via dynamic programming. Differently to approaches based on genetic algorithms, dynamic programming can compute an exact solution with better performance than previous approaches, even on long traces. We describe the new problem formulation and the algorithmic details of our approach. We then compare the performances of dynamic programming with those of a genetic algorithm, showing that dynamic programming reduces dramatically the time required to segment traces, without sacrificing precision and recall; even slightly improving them.