Rule-based approach to computing module cohesion

Lakhotia, Arun

doi:10.1109/icse.1993.346057

Cited by 57 publications

(55 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, many authors continued to develop new application areas for static slicing, such as reverse engineering [Canfora et al 1994b;Simpson et al 1993], program comprehension [De Lucia et al 1996, testing [Binkley 1998;Gupta et al 1992;Harman and Danicic 1995;Hierons et al 2002Hierons et al , 1999, and software metrics [Bieman and Ott 1994;Lakhotia 1993;Ott and Thuss 1993]. Following Weiser's initial work, many authors also developed techniques for slicing, but not until comparatively recently have sufficiently mature program slicing tools been able to handle large programs written using the entirety (rather than merely a subset) of a popular programming language.…”

Section: Implications Of the Findingsmentioning

confidence: 99%

“…Slicing has been applied to reverse engineering [Canfora et al 1994b;Simpson et al 1993], program comprehension , software maintenance [Canfora et al 1994a;Gallagher 1992;Gallagher and Lyle 1991], debugging [Agrawal et al 1993;Kamkar 1993;Lyle and Weiser 1987;Weiser and Lyle 1985], testing [Binkley 1997[Binkley , 1998Gupta et al 1992;Harman and Danicic 1995;Hierons et al 1999Hierons et al , 2002, component reuse [Beck and Eichmann 1993;Cimitile et al 1995a], program integration Horwitz et al 1989], and software metrics [Bieman and Ott 1994;Lakhotia 1993;Ott and Thuss 1993]. There are several surveys of slicing techniques, applications and variations [Binkley and Gallagher 1996;Binkley and Harman 2004;De Lucia et al 2001;Tip 1995].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An empirical study of static program slice size

Binkley

Gold

Harman

2007

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

This article presents results from a study of all slices from 43 programs, ranging up to 136,000 lines of code in size. The study investigates the effect of five aspects that affect slice size. Three slicing algorithms are used to study two algorithmic aspects: calling-context treatment and slice granularity. The remaining three aspects affect the upstream dependencies considered by the slicer. These include collapsing structure fields, removal of dead code, and the influence of points-to analysis.The results show that for the most precise slicer, the average slice contains just under one-third of the program. Furthermore, ignoring calling context causes a 50% increase in slice size, and while (coarse-grained) function-level slices are 33% larger than corresponding statement-level slices, they may be useful predictors of the (finer-grained) statement-level slice size. Finally, upstream analyses have an order of magnitude less influence on slice size.

show abstract

Section: Implications Of the Findingsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An empirical study of static program slice size

Binkley

Gold

Harman

2007

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

show abstract

“…In this case, the model part of the viewpoint definition is less important. Examples of such viewpoints are the activity-based viewpoint which identifies the architectural elements according to their level of interaction with their environment, and the cohesion-based viewpoint [17] [14] which identifies a set of related architectural elements according the strength of their dependencies. The framework can easily integrate other viewpoints.…”

Section: Architectural Viewpointsmentioning

confidence: 99%

Software System Understanding via Architectural Views Extraction According to Multiple Viewpoints

Razavizadeh

Cimpan

Verjus

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Changes and evolution of software systems constantly generate new challenges for the recovery of software systems architectures. A system's architecture, together with its elements and the way they interact, constitute valuable assets for understanding the system. We believe that offering multiple architectural views of a given system, using domain and pattern knowledge enhance understanding of the software system as a whole. To correlate different sources of information and existing software system, different viewpoints are considered. Viewpoints enable one to model such information and guide the extraction algorithms to extract multiple architectural views. We propose a recursive framework, an approach that expresses different kinds of information as viewpoints to guide the extraction process. These multiple viewpoints models improve the consideration of architectural, conceptual, and structural aspects of the system.

show abstract

“…We then discuss how flow sensitivity can be introduced to make a contextsensitive, flow-sensitive algorithm. VDGAA starts by building a variable dependence graph, where nodes represent variables and edges represent dependence between them [9]. Since a variable is represented by a single node in the graph, all definitions and uses of a variable are represented by the edges coming in and out the node.…”

Section: Introductionmentioning

confidence: 99%

Design and Implementation of a Context-Sensitive, Flow-Sensitive Activity Analysis Algorithm for Automatic Differentiation

Shin

Malusare

Hovland

2008

Advances in Automatic Differentiation

View full text Add to dashboard Cite

Summary. Automatic differentiation (AD) has been expanding its role in scientific computing. While several AD tools have been actively developed and used, a wide range of problems remain to be solved. Activity analysis allows AD tools to generate derivative code for fewer variables, leading to a faster run time of the output code. This paper describes a new contextsensitive, flow-sensitive (CSFS) activity analysis, which is developed by extending an existing context-sensitive, flow-insensitive (CSFI) activity analysis. Our experiments with eight benchmarks show that the new CSFS activity analysis is more than 27 times slower but reduces 8 overestimations for the MIT General Circulation Model (MITgcm) and 1 for an ODE solver (c2) compared with the existing CSFI activity analysis implementation. Although the number of reduced overestimations looks small, the additionally identified passive variables may significantly reduce tedious human effort in maintaining a large code base such as MITgcm.

show abstract

Rule-based approach to computing module cohesion

Cited by 57 publications

References 6 publications

An empirical study of static program slice size

An empirical study of static program slice size

Software System Understanding via Architectural Views Extraction According to Multiple Viewpoints

Design and Implementation of a Context-Sensitive, Flow-Sensitive Activity Analysis Algorithm for Automatic Differentiation

Contact Info

Product

Resources

About