Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICCSW.2013.119
URN: urn:nbn:de:0030-drops-42809
URL: https://drops.dagstuhl.de/opus/volltexte/2013/4280/
Wood, Tim ; Drossopoulou, Sophia
Refactoring Boundary
| pdf-format: |
|
Abstract
We argue that the limit of the propagation of the heap effects of a source code modification is determined by the aliasing structure of method parameters in a trace of the method calls that cross a boundary which partitions the heap. Further, that this aliasing structure is sufficient to uniquely determine the state of the part of the heap which has not been affected. And we give a definition of what it means for a part of the heap to be unaffected by a source code modification. This can be used to determine the correctness of a refactoring.
BibTeX - Entry
@InProceedings{wood_et_al:OASIcs:2013:4280,
author = {Tim Wood and Sophia Drossopoulou},
title = {{Refactoring Boundary}},
booktitle = {2013 Imperial College Computing Student Workshop},
pages = {119--127},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-939897-63-7},
ISSN = {2190-6807},
year = {2013},
volume = {35},
editor = {Andrew V. Jones and Nicholas Ng},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4280},
URN = {urn:nbn:de:0030-drops-42809},
doi = {10.4230/OASIcs.ICCSW.2013.119},
annote = {Keywords: Refactoring, Object Oriented}
}
| Keywords: | Refactoring, Object Oriented | |
| Seminar: | 2013 Imperial College Computing Student Workshop | |
| Issue date: | 2013 | |
| Date of publication: | 14.10.2013 |
