Refactoring module structure

Lovei, Laszlo; Hoch, Csaba; Köllö, Hanna; Nagy, Tamás; Víg, Anikó Nagyné; Horpácsi, Dániel; Kitlei, Róbert; Király, Roland

doi:10.1145/1411273.1411285

Cited by 14 publications

(14 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the source code representation and the additional semantic information in the RefactorErl graph model module and function clustering [7] can be performed.…”

Section: Further Source Code Analysis With Refactorerlmentioning

confidence: 99%

Static Analysis Based Support for Program Comprehension in Erlang

Tóth¹,

Bozó²,

Kőszegi³

2011

Acta Electrotechnica Et Informatica

View full text Add to dashboard Cite

Program comprehension is important process in software maintenance, considering the lifetime of an industrial software. The first task for a developer is to understand the structure and the behaviour of the program without considering the type of the changerefactoring, bugfix -must be performed on the source code. Understanding and debugging the source code is not straightforward in case of a dynamically typed functional programming language, like Erlang. Thus RefactorErl supports code comprehension through a Semantic Query Language that helps the developers to query semantic relationships in their software product.

show abstract

“…Based on the source code representation and the additional semantic information in the RefactorErl graph model module and function clustering [7] can be performed.…”

Section: Further Source Code Analysis With Refactorerlmentioning

confidence: 99%

Static Analysis Based Support for Program Comprehension in Erlang

Tóth¹,

Bozó²,

Kőszegi³

2011

Acta Electrotechnica Et Informatica

View full text Add to dashboard Cite

show abstract

“…The work most closely related to ours is the Erlang refactoring tool, RefactorErl [7], developed by researchers at the Eötvös Loránd University in Budapest, Hungary. Like Wrangler, RefactorErl is also a general refactoring tool for Erlang.…”

Section: Related Workmentioning

confidence: 99%

Refactoring Support for Modularity Maintenance in Erlang

Thompson

2010

2010 10th IEEE Working Conference on Source Code Analysis and Manipulation

View full text Add to dashboard Cite

Low coupling between modules and high cohesion inside each module are key features of good software architecture. Systems written in modern programming languages generally start with some reasonably well-designed module structure, however with continuous feature additions, modifications and bug fixes, software modularity gradually deteriorates. So, there is a need for incremental improvements to modularity to avoid the situation when the structure of the system becomes too complex to maintain.We demonstrate how Wrangler, a general-purpose refactoring tool for Erlang, can be used to maintain and improve the modularity of programs written in Erlang without dramatically changing the existing module structure. We identify a set of "modularity smells" and show how they can be detected by Wrangler and removed by way of a variety of refactorings implemented in Wrangler. Validation of the approach and usefulness of the tool are demonstrated by case studies.

show abstract

“…The algorithm [4,6,7], which I present here is also based upon the analysis of the semantic graph built from the source code (which, in this case, is naturally based on the measurements of structural complexity), but at this stage we can define default complexity measures, and these defaults are compared to the actual measured values of the code, and so the differences can be indicated.…”

Section: Introductionmentioning

confidence: 99%

“…

AbstractIn this paper I am going to present how to create an analyzer that reveals inadequate programming style or overcomplicated erlang [8, 9] program constructs during the whole lifecycle of the code using complexity measures describing the program.The algorithm [4,6,7], which I present here is also based upon the analysis of the semantic graph built from the source code (which, in this case, is naturally based on the measurements of structural complexity), but at this stage we can define default complexity measures, and these defaults are compared to the actual measured values of the code, and so the differences can be indicated.The impact analysis of the transformations is theoretical but based on conclusions, as these statements are proven by running tests and interpreting the results on the implemented analyzing prototype.On the other hand I show the algorithm measuring code complexity in Erlang programs, that provides automatic code transformations based on these measures. I created a script language that can calculate the structural complexity of Erlang source codes, and based on the resulting outcome providing the descriptions of transformational steps.

…”

mentioning

confidence: 99%

Results of metric based transformations

Király¹,

Collage²

2015

Proceedings of the 9th International Conference on Applied Informatics, Volume 2

Self Cite

View full text Add to dashboard Cite

In this paper I am going to present how to create an analyzer that reveals inadequate programming style or overcomplicated erlang [8, 9] program constructs during the whole lifecycle of the code using complexity measures describing the program.The algorithm [4,6,7], which I present here is also based upon the analysis of the semantic graph built from the source code (which, in this case, is naturally based on the measurements of structural complexity), but at this stage we can define default complexity measures, and these defaults are compared to the actual measured values of the code, and so the differences can be indicated.The impact analysis of the transformations is theoretical but based on conclusions, as these statements are proven by running tests and interpreting the results on the implemented analyzing prototype.On the other hand I show the algorithm measuring code complexity in Erlang programs, that provides automatic code transformations based on these measures. I created a script language that can calculate the structural complexity of Erlang source codes, and based on the resulting outcome providing the descriptions of transformational steps. With the help of this language we can describe automatic code transformations based on code complexity measurements.I define the syntax [5] of the language that can describe those series of steps in these automatic code refactoring that are complexity measurement [2, 3] based, and present the principle of operation of the analyzer and runtime providing algorithm. Besides the introduction of the syntax and use cases, I present the results we can achieve using this language.After defining and implementing the language [12,13,14], I create several scripts solving source code transformational problems that are based on complexity measures, and present their run-time results, proving their usability.The transformation scripts created by me were applied on the source code of large programs, too. In this paper I present the results I measured during *

show abstract

Refactoring module structure

Cited by 14 publications

References 2 publications

Static Analysis Based Support for Program Comprehension in Erlang

Static Analysis Based Support for Program Comprehension in Erlang

Refactoring Support for Modularity Maintenance in Erlang

Results of metric based transformations

Contact Info

Product

Resources

About