TU Darmstadt / ULB / TUbiblio

Hidden Truths in Dead Software Paths

Eichberg, Michael ; Hermann, Ben ; Mezini, Mira ; Glanz, Leonid (2015)
Hidden Truths in Dead Software Paths.
Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering. New York, NY, USA
Conference or Workshop Item, Bibliographie

Abstract

Approaches and techniques for statically finding a multitude of issues in source code have been developed in the past. A core property of these approaches is that they are usually targeted towards finding only a very specific kind of issue and that the effort to develop such an analysis is significant. This strictly limits the number of kinds of issues that can be detected. In this paper, we discuss a generic approach based on the detection of infeasible paths in code that can discover a wide range of code smells ranging from useless code that hinders comprehension to real bugs. Code issues are identified by calculating the difference between the control-flow graph that contains all technically possible edges and the corresponding graph recorded while performing a more precise analysis using abstract interpretation. We have evaluated the approach using the Java Development Kit as well as the Qualitas Corpus (a curated collection of over 100 Java Applications) and were able to find thousands of issues across a wide range of categories.

Item Type: Conference or Workshop Item
Erschienen: 2015
Creators: Eichberg, Michael ; Hermann, Ben ; Mezini, Mira ; Glanz, Leonid
Type of entry: Bibliographie
Title: Hidden Truths in Dead Software Paths
Language: English
Date: 2015
Place of Publication: New York, NY, USA
Publisher: ACM
Series: ESEC/FSE 2015
Event Title: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering
Event Location: New York, NY, USA
URL / URN: http://doi.acm.org/10.1145/2786805.2786865
Abstract:

Approaches and techniques for statically finding a multitude of issues in source code have been developed in the past. A core property of these approaches is that they are usually targeted towards finding only a very specific kind of issue and that the effort to develop such an analysis is significant. This strictly limits the number of kinds of issues that can be detected. In this paper, we discuss a generic approach based on the detection of infeasible paths in code that can discover a wide range of code smells ranging from useless code that hinders comprehension to real bugs. Code issues are identified by calculating the difference between the control-flow graph that contains all technically possible edges and the corresponding graph recorded while performing a more precise analysis using abstract interpretation. We have evaluated the approach using the Java Development Kit as well as the Qualitas Corpus (a curated collection of over 100 Java Applications) and were able to find thousands of issues across a wide range of categories.

Uncontrolled Keywords: Abstract Interpretation, Finding Bugs, Infeasible Paths, Java, Scalable Analysis
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Software Technology
Zentrale Einrichtungen
20 Department of Computer Science > EC SPRIDE
Date Deposited: 10 Sep 2015 14:09
Last Modified: 12 Jan 2019 21:18
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details