Sound refactorings Export

@article{citeulike:5922501, abstract = {Refactoring consists in restructuring an object-oriented program without changing its behaviour. In this paper, we present refactorings as transformation rules for programs written in a refinement language inspired on Java that allows reasoning about object-oriented programs and specifications. A set of programming laws is available for the imperative constructs of this language as well as for its object-oriented features; soundness of the laws is proved against a weakest precondition semantics. The proof that the refactoring rules preserve behaviour (semantics) is accomplished by the application of these programming laws and data simulation. As illustration of our approach to refactoring, we use our rules to restructure a program to be in accordance with a design pattern.}, author = {Corn\'{e}lio, M\'{a}rcio and Cavalcanti, Ana and Sampaio, Augusto}, citeulike-article-id = {5922501}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.scico.2009.10.001}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0167642309001300}, day = {09}, doi = {10.1016/j.scico.2009.10.001}, issn = {0167-6423}, journal = {Science of Computer Programming}, keywords = {2010, \_journal, \_qualis\_b1, refactoring, refinement, soundness}, posted-at = {2009-10-31 00:20:25}, priority = {2}, title = {Sound refactorings}, url = {http://dx.doi.org/10.1016/j.scico.2009.10.001}, year = {2010} }

TY - JOUR ID - citeulike:5922501 L3 - citeulike-article-id:5922501 N2 - Refactoring consists in restructuring an object-oriented program without changing its behaviour. In this paper, we present refactorings as transformation rules for programs written in a refinement language inspired on Java that allows reasoning about object-oriented programs and specifications. A set of programming laws is available for the imperative constructs of this language as well as for its object-oriented features; soundness of the laws is proved against a weakest precondition semantics. The proof that the refactoring rules preserve behaviour (semantics) is accomplished by the application of these programming laws and data simulation. As illustration of our approach to refactoring, we use our rules to restructure a program to be in accordance with a design pattern. JF - Science of Computer Programming SN - 0167-6423 TI - Sound refactorings KW - 2010 KW - _journal KW - _qualis_b1 KW - refactoring KW - refinement KW - soundness AU - Cornélio, Márcio AU - Cavalcanti, Ana AU - Sampaio, Augusto PY - 2010//09/ UR - http://dx.doi.org/10.1016/j.scico.2009.10.001 ER -