Proceedings of the 13th International Conference on Software Technologies 2018
DOI: 10.5220/0006837900670078
|View full text |Cite
|
Sign up to set email alerts
|

Automated Selection of Software Refactorings that Improve Performance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Finally, Moesus et al [8] present a technique for ranking potential refactorings (such as using Java's StringBuilder to concatenate strings instead of the plus operator) based on estimating performance improvements. Their approach estimates the benefit of a given refactoring by combining the estimate execution frequency of a piece of code and the approximate performance improvement achievable by implementing the refactoring.…”
Section: Concurrency Analysismentioning
confidence: 99%
“…Finally, Moesus et al [8] present a technique for ranking potential refactorings (such as using Java's StringBuilder to concatenate strings instead of the plus operator) based on estimating performance improvements. Their approach estimates the benefit of a given refactoring by combining the estimate execution frequency of a piece of code and the approximate performance improvement achievable by implementing the refactoring.…”
Section: Concurrency Analysismentioning
confidence: 99%