Using dependence graphs as a support to document programs

Balmas, Françoise

doi:10.1109/scam.2002.1134114

Cited by 17 publications

(11 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, dependence graphs, developed in connection with aggressive optimizing compilers [Ferrante et al 1987], have been suggested for use in a variety of alternative applications. These include, for example, program slicing [Binkley and Gallagher 1996;Tip 1995;Weiser 1984], whole program documentation [Balmas 2002], and heap variable modeling ].…”

Section: Related Workmentioning

confidence: 99%

Empirical study of optimization techniques for massive slicing

Binkley

Harman

Krinke

2007

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

This paper presents results from a study of techniques that improve the performance of graphbased interprocedural slicing of the System Dependence Graph (SDG). This is useful in "massive slicing" where slices are required for many or all of the possible set of slicing criteria. Several different techniques are considered, including forming strongly connected components, topological sorting, and removing transitive edges.Data collected from a test bed of just over 1,000,000 lines of code are presented. This data illustrates the impact on computation time of the techniques. Together, the best combination produces a 71% reduction in run-time (and a 64% reduction in memory usage). The complete set of techniques also illustrates the point at which faster computation is not viable due to prohibitive preprocessing costs.

show abstract

Section: Related Workmentioning

confidence: 99%

Empirical study of optimization techniques for massive slicing

Binkley

Harman

Krinke

2007

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

show abstract

“…In this section, we propose IRanker which is used to detect a representative set We build a dependency graph [4], [5] at source code file level. We use a directed graph to represent the dependency relationships among source files, and for any two source files A and B, if A uses any of the methods in B, then A and B have a dependency relationship and there is an edge from A to B.…”

Section: B Iranker: Ranking Important Codesmentioning

confidence: 99%

Software Internationalization and Localization: An Industrial Experience

Xia

Zhu

et al. 2013

2013 18th International Conference on Engineering of Complex Computer Systems

View full text Add to dashboard Cite

Abstract-Software internationalization and localization are important steps in distributing and deploying software to different regions of the world. Internationalization refers to the process of reengineering a system such that it could support various languages and regions without further modification. Localization refers to the process of adapting an internationalized software for a specific language or region. Due to various reasons, many large legacy systems did not consider internationalization and localization at the early stage of development. In this paper, we present our experience on, and propose a process along with tool supports for software internationalization and localization. We reengineer a large legacy commercial financial system called PAM of State Street Corporation, which is written in C/C++, containing 30 different modules, and more than 5 millions of lines of source code. We propose a source code ranker that recovers important source code to be analyzed. Based on this code, we extract general patterns of the source code that need to be reengineered for internationalization. We divide the patterns into 2 categories: convertible patterns and suspicious patterns. To locate the source code that need to be modified, we develop an automated tool I18nLocator, that consumes these patterns and outputs the locations that match the patterns. The source codes matching the convertible patterns are automatically converted, and those matching the suspicious patterns are converted by developers considering the context of the corresponding codes. For localization, we extract hard-coded strings, translate them, and store them into resource data files. Out of the 504 thousands of lines of source code that are modified using our proposed approach, we can automatically modify 79.76% of them, saving much valuable developers' time. The quality of the resultant system is also good. The number of bugs per lines of code modified found during user acceptance test and deployment to the production environment is 0.000218 bugs/LOC.

show abstract

“…For example, it has been studied as a driver of program comprehension [Balmas 2002;Deng et al 2001]. Dependence analysis has also been used to control the kinds of maintenance change that can be performed with minimal impact [Gallagher and Lyle 1991;Tonella 2003] as well as to measure the impact of such changes [Black 2001].…”

Section: Related Workmentioning

confidence: 99%

Efficient Identification of Linchpin Vertices in Dependence Clusters

Binkley

Gold

Harman

et al. 2013

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

Several authors have found evidence of large dependence clusters in the source code of a diverse range of systems, domains, and programming languages. This raises the question of how we might efficiently locate the fragments of code that give rise to large dependence clusters. We introduce an algorithm for the identification of linchpin vertices, which hold together large dependence clusters, and prove correctness properties for the algorithm's primary innovations. We also report the results of an empirical study concerning the reduction in analysis time that our algorithm yields over its predecessor using a collection of 38 programs containing almost half a million lines of code. Our empirical findings indicate improvements of almost two orders of magnitude, making it possible to process larger programs for which it would have previously been impractical.

show abstract

Using dependence graphs as a support to document programs

Cited by 17 publications

References 15 publications

Empirical study of optimization techniques for massive slicing

Empirical study of optimization techniques for massive slicing

Software Internationalization and Localization: An Industrial Experience

Efficient Identification of Linchpin Vertices in Dependence Clusters

Contact Info

Product

Resources

About