Hidden Truths in Dead Software Paths

Eichberg, Michael and Hermann, Ben and Mezini, Mira and Glanz, Leonid :
Hidden Truths in Dead Software Paths.
[Online-Edition: http://doi.acm.org/10.1145/2786805.2786865]
In: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering, New York, NY, USA. In: ESEC/FSE 2015 . ACM , New York, NY, USA
[Conference or Workshop Item] , (2015)

Official URL: 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.

Item Type:	Conference or Workshop Item
Erschienen:	2015
Creators:	Eichberg, Michael and Hermann, Ben and Mezini, Mira and Glanz, Leonid
Title:	Hidden Truths in Dead Software Paths
Language:	English
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.
Series Name:	ESEC/FSE 2015
Place of Publication:	New York, NY, USA
Publisher:	ACM
Uncontrolled Keywords:	Abstract Interpretation, Finding Bugs, Infeasible Paths, Java, Scalable Analysis
Divisions:	Department of Computer Science Department of Computer Science > Software Technology Zentrale Einrichtungen Department of Computer Science > EC SPRIDE
Event Title:	Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering
Event Location:	New York, NY, USA
Date Deposited:	10 Sep 2015 14:09
Official URL:	http://doi.acm.org/10.1145/2786805.2786865
Export:

Optionen (nur für Redakteure)

View Item