- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Reducing remodularization complexity through modular-objective...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Reducing remodularization complexity through modular-objective decoupling Chern, Rick
Abstract
                                    This dissertation defines "modular-objective coupling", and shows that programming language designs which imply reduced modular-objective coupling reduce complexity of remodularizations--behaviour-preserving restructurings for which the only intended goals are to change program source code structure.
We explicitly distinguish between two points of view on program structure: modular structure--the structure of a program as a set of static text documents, and objective structure--the structure of a program as a dynamic computational model during execution. We define modular-objective coupling as the degree to which changes in modular structure imply changes to objective structure, for a given programming language.
We use the term remodularization to refer to any behaviour-preserving source code restructuring, for which the only intended goal is to change modular structure. We argue that programming languages with strong modular-objective coupling introduce accidental complexity into remodularizations, by requiring complex objective structure changes to achieve intended modular structure changes. Our claim is that a programming language design which implies reduced modular-objective coupling reduces remodularization complexity in the language.
To validate this claim, we first present SubjectJ, a subject-oriented programming system that extends Java. The design of Java implies strong modular-objective coupling, while SubjectJ is designed for reduced modular-objective coupling. We then perform a series of remodularization case studies comparing Java and SubjectJ. Our results suggest that remodularizations are less complex in SubjectJ.
                                    
                                                                    
Item Metadata
| Title | 
                                Reducing remodularization complexity through modular-objective decoupling                             | 
| Creator | |
| Publisher | 
                                University of British Columbia                             | 
| Date Issued | 
                                2008                             | 
| Description | 
                                This dissertation defines "modular-objective coupling", and shows that programming language designs which imply reduced modular-objective coupling reduce complexity of remodularizations--behaviour-preserving restructurings for which the only intended goals are to change program source code structure.
We explicitly distinguish between two points of view on program structure: modular structure--the structure of a program as a set of static text documents, and objective structure--the structure of a program as a dynamic computational model during execution. We define modular-objective coupling as the degree to which changes in modular structure imply changes to objective structure, for a given programming language.
We use the term remodularization to refer to any behaviour-preserving source code restructuring, for which the only intended goal is to change modular structure. We argue that programming languages with strong modular-objective coupling introduce accidental complexity into remodularizations, by requiring complex objective structure changes to achieve intended modular structure changes. Our claim is that a programming language design which implies reduced modular-objective coupling reduces remodularization complexity in the language.
To validate this claim, we first present SubjectJ, a subject-oriented programming system that extends Java. The design of Java implies strong modular-objective coupling, while SubjectJ is designed for reduced modular-objective coupling. We then perform a series of remodularization case studies comparing Java and SubjectJ. Our results suggest that remodularizations are less complex in SubjectJ.                             | 
| Extent | 
                                2958670 bytes                             | 
| Genre | |
| Type | |
| File Format | 
                                application/pdf                             | 
| Language | 
                                eng                             | 
| Date Available | 
                                2008-08-15                             | 
| Provider | 
                                Vancouver : University of British Columbia Library                             | 
| Rights | 
                                Attribution-NonCommercial-NoDerivatives 4.0 International                             | 
| DOI | 
                                10.14288/1.0051353                             | 
| URI | |
| Degree (Theses) | |
| Program (Theses) | |
| Affiliation | |
| Degree Grantor | 
                                University of British Columbia                             | 
| Graduation Date | 
                                2008-11                             | 
| Campus | |
| Scholarly Level | 
                                Graduate                             | 
| Rights URI | |
| Aggregated Source Repository | 
                                DSpace                             | 
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International