DOCSLIB.ORG

Coupling, Code Reuse and Open Implementation in Reflective Systems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Coupling, Code Reuse and Open Implementation in Reflective Systems Coupling, Code Reuse and Open Implementation in Reflective Systems Youssef Hassoun A Thesis Submittrd in Ful¯lment of the Requirements of Doctor of Philosophy in the UNIVERSITY OF LONDON March, 2005 School of Computer Science and Information Systems BIRKBECK COLLEGE Abstract Little research has been conducted in investigating the implications of employ- ing reflection in object-oriented (OO) systems on software qualities such as coupling and reuse. In this thesis, we investigate the reflective capabilities of Java as a rep- resentative of mainstream OO languages and propose a behavioural reflection model, which complements the language's inextensible, introspective, structural reflection model. We show that reflective systems based on the proposed model support the principle of open implementation, and exhibit less coupling and a higher level of code reuse. Programming examples explain how the behaviour of such systems can be customised or adapted without changing their default behaviour or structure. We then show that the model is also applicable to distributed systems allowing for generic coding on the server side. We address the question of assessing coupling and code reuse qualities of reflective systems quantitatively. For this purpose, we de¯ne a dynamic cou- pling metric and a measuring tool that allows the collection of object coupling data at runtime. A case study shows that our coupling metric can be measured automatically and con¯rms the hypothesis about the relatively low coupling of reflective systems in comparison with equivalent systems based on the classi- cal non-reflective programming model. As for code reuse, we de¯ne OO reuse metrics by extending a set of metrics previously developed for procedural lan- guages. A case study is used to con¯rm the hypothesis that reflective systems are more reusable than non-reflective systems exhibiting the same behaviour. Contents 1 Introduction 1 1.1 Problem and motivation . 1 1.2 Thesis objectives and contribution . 4 1.3 Thesis outline . 4 2 Related Work 6 3 Reflection in Java 11 3.1 Reflection . 12 3.2 Proxies . 13 3.3 Structural and Behavioural Reflection Models . 16 3.3.1 Java's introspective structural reflection . 16 3.3.2 A behavioural reflection model based on proxies . 17 3.3.3 Meta-objects as a means of reflection . 18 3.3.4 Comparison with CLOS MOPs . 20 3.4 Open Implementation . 21 3.4.1 Open implementation guidelines . 23 3.4.2 Customising applications' behaviour . 24 3.5 Discussion . 27 3.6 Conclusions . 29 4 Applications of the Reflection Model 32 4.1 Open architecture in a distributed system . 33 4.2 Distributed Applications . 35 4.2.1 RMI-based system . 35 4.2.2 CORBA implementation . 40 4.2.3 Java's Servlets implementation . 45 4.3 Design Patterns . 49 4.3.1 Behavioural Patterns . 50 4.3.2 Structural Patterns . 61 4.3.3 Creational Patterns . 69 4.4 Discussion . 70 4.5 Conclusions . 73 2 CONTENTS 3 5 Coupling Metrics 74 5.1 Software Metrics . 75 5.1.1 Metric scales . 77 5.1.2 Metric validation . 78 5.2 A Dynamic Coupling Metric . 78 5.2.1 DCM scales . 81 5.2.2 Class dependencies and object coupling . 81 5.3 Theoretical Validation of DCM ................... 83 5.3.1 Weyuker's set of measurement principles . 83 5.3.2 Applying Weyuker's principles on DCM . 85 5.3.3 The coupling measures criteria of Briand et al. 89 5.4 On the Empirical Validation of the DCM . 90 5.4.1 Measuring tool . 91 5.4.2 A case study . 93 5.5 Discussion . 100 5.6 Conclusions . 103 6 Code Reuse Metrics 105 6.1 Object-Oriented Code Reuse Measures . 106 6.1.1 Adapting Chen's software model and measures . 107 6.1.2 An illustrative example . 108 6.2 Theoretical Validation of the Metrics . 109 6.3 Empirical Validation: A Case Study . 112 6.3.1 An approach to code reuse . 113 6.3.2 Improving OO code reuse through reflection . 113 6.3.3 Reuse Analysis . 115 6.4 Discussion . 118 6.5 Conclusions . 119 7 Conclusions and future work 120 7.1 Theme and goals of the thesis . 120 7.2 The contribution of the thesis . 120 7.3 Future work . 122 References 124 List of Tables 3.1 ProxyFactory for creating proxy objects . 25 3.2 Example Runtime binding and triggering rei¯cation . 26 3.3 Example Runtime binding and triggering rei¯cation . 27 3.4 Generic implementation of JavaBeans mechanism . 28 4.1 The communication interface between clients and server(s) . 36 4.2 Delegating binding of a base object to ProxyFacory . 37 4.3 The RMI-server process . 39 4.4 The remote interface de¯ning the service protocol . 39 4.5 Remote object wrapper for the Factory class . 40 4.6 A PropertyChangeListener as a client process class . 41 4.7 IDL to support reuse of method invocations over the ORB . 42 4.8 Implementation of the IDL interface ProxyFactoryWrapper . 42 4.9 The CORBA server application . 44 4.10The CORBA client application . 45 4.11Client uses URL objects to communicate with Web-server . 47 4.12Controller servlet provides clients with ActivePropertyHandlers . 48 4.13An implementation of the Template pattern: the meta-program . 51 4.14An implementation of the Template pattern: the client part . 51 4.15The meta-level part of the Strategy pattern implementation . 53 4.16An implementation of the Visitor pattern . 55 4.17An implementation of the Visitor pattern at the meta-level . 56 4.18CommandHandler controls execution of commands . 59 4.19Commands are dispatched to the meta-level using a proxy object 60 4.20A Vector object as adaptee . 61 4.21Adapting default implementation of a stack using a proxy . 62 4.22Adapting default implementation of a stack using a proxy . 64 4.23An implementation of Composite without meta-programming . 65 4.24The meta-level part of the Composite pattern implementation . 68 4.1 Features of design patterns when adapted to the reflection model 72 5.1 Main features of the interceptive code . 94 5.2 Concrete aspect for intercepting executions a concrete system . 95 4 LIST OF TABLES 5 5.1 DCM values as a function of the execution steps of the static model 96 5.2 DCM values as a function of the execution steps of the meta-model 98 6.1 MVC implementation using JavaBeans . 114 6.2 Application classes of the second system . 115 6.1 Entities of both systems and reuse percentages . 116 List of Figures 3.1 Clients request services from Target objects to ful¯l their tasks . 14 3.2 A proxy can manipulate clients' requests before dispatching control 14 3.3 Key classes of dynamic proxies' dispatch mechanism . 15 3.4 A two-level reflective architecture with proxies . 18 4.1 A two-level reflective model with remote proxies . 34 4.2 Class diagram in the distributed RMI environment . 38 4.3 Class structure of the Strategy pattern . 52 4.4 Adapting the Strategy pattern to the reflection model . 53 4.5 Class structure of the Visitor pattern . 55 4.6 Adapting the Visitor pattern to the reflection model . 57 4.7 Class structure of the Composite pattern . 66 4.8 Adapting the Composite pattern to the reflection model . 67 5.1 Class structure of the static system . 96 5.2 Class structure of the dynamic system . 97 5.3 DCM(static system) vs DCM(meta-system) for 1-1000 steps . 99 5.4 DCM(static system) vs DCM(meta-system) for 1-10000 steps . 99 5.5 Static coupling holds a constant contribution to DCM over time . 100 5.6 DCM increases steadily at a constant rate in case of static coupling101 5.7 Transient coupling reduces the number of contributions to DCM . 101 5.8 A variable and slower increase rate in case of transient coupling . 102 6.1 Application S reusing set P . 108 6 Acknowledgements I would like to thank all, who through their support and help have allowed me to bring this work to the end, in particular my supervisors Dr. Roger Johnson and Dr. Steve Counsell for their constant support, encouragement, patience and collaboration. I am grateful to the School of Computer Science and Information Systems at Birkbeck College for the Teaching Assistantship (TA) and the fruitful research atmosphere- Professor George Loizou for his interest and support, and Professor Alexandra Poulovassilis, Head of the School of Computer Science and Informa- tion Systems, for her encouragement and support, Roger Mitton, who managed the TA group, for his excellent leadership and Dr. Constantinos Constantinides for his collaboration at an early stage of my research. Many thanks to the System Group in the School namely Phil Gregg, Phil Docking, Andrew Watkins and Graham Sadler for providing the computing facilities and their friendly and prompt response in case of problems. Mrs Betty Walters and the administrative group for providing an excellent working environment. I would like to thank Professor Laurie Hendren, Professor of Computer Science, McGill University in Canada and Visiting Fellow at Oxford University Computing Laboratory, for her interest in the implementation of measuring tools for collecting coupling data at runtime. I bene¯ted from seminars organised by the British Computer Society (BCS) Advanced Programming Specialist Group. It was an invaluable opportunity to meet and discuss current research topics with the group and with speakers of international pro¯le. In this context, many thanks to my supervisor Dr. Roger Johnson and to all other members of the organising committee especially chairman Professor John Florentin. The research reported in this thesis has bene¯tted from anonymous review- ers. I would like to thank those reviewers, who through their incisive and useful critic have contributed signi¯cantly to improving the submitted papers and consequently the work presented here.
Load more

Recommended publications
  • New Inheritance Models That Facilitate Source Code Reuse in Object-Oriented Programming
    NEW INHERITANCE MODELS THAT FACILITATE SOURCE CODE REUSE IN OBJECT- ORIENTED PROGRAMMING By HISHAM M. AL-HADDAD Bachelor of Science Yarmouk University lrbid, Jordan 1986 Master of Science Northrop University Los Angeles, California 1988 Submitted to the Faculty of the Graduate College of the Oklahoma State University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY July, 1992 Oklahoma Statt.' Ur1iv. Library NEW INHERITANCE MODELS THAT FACILITATE SOURCE CODE REUSE IN OBJECT- ORIENTED PROGRAMMING C/ wU::r-~ B I A~c;p .... _.-~ Dean of the Graduate CoUege ii PREFACE Code reusability is a primary objective in the development of software systems. The object-oriented programming methodology is one of the areas that facilitate the development of software systems by allowing and promoting code reuse and modular designs. Object-oriented programming languages (OOPLs) provide different facilities to attain efficient reuse and reliable extension of existing software components. Inheritance is an important language feature that is conducive to reusability and extensibility. Various OOPLs provide different inheritance models based on different interpretations of the inheritance notion. Therefore, OOPLs have different characteristics derived from their respective inheritance models. This dissertation is concerned with solutions for three major problems that limit the utilization of inheritance for code reusability. The range of object-oriented applications and thus the usage of object-oriented programming in general is also discussed. The three major problems are: 1) the relationship between inheritance and other related issues such as encapsulation, access techniques, visibility of inheritance, and subtyping; 2) the hierarchical structure imposed by inheritance among classes; and 3) the accessibility of previous versions of the modified methods defmed in classes located at higher levels of the inheritance structure than the parent classes.
    [Show full text]
  • Attachment A
    Board of Governors, State University System of Florida Request to Offer a New Degree Program (Please do not revise this proposal format without prior approval from Board staff) University of West Florida Fall 2018 University Submitting Proposal Proposed Implementation Term Hal Marcus College of Science and Engineering Computer Science Name of College(s) or School(s) Name of Department(s)/ Division(s) Bachelor of Science in Computer Computer Science Science Academic Specialty or Field Complete Name of Degree 11.0701 Proposed CIP Code The submission of this proposal constitutes a commitment by the university that, if the proposal is approved, the necessary financial resources and the criteria for establishing new programs have been met prior to the initiation of the program. Date Approved by the University Board of President Date Trustees Signature of Chair, Board of Date Provost and Senior Vice Date Trustees President Provide headcount (HC) and full-time equivalent (FTE) student estimates of majors for Years 1 through 5. HC and FTE estimates should be identical to those in Table 1 in Appendix A. Indicate the program costs for the first and the fifth years of implementation as shown in the appropriate columns in Table 2 in Appendix A. Calculate an Educational and General (E&G) cost per FTE for Years 1 and 5 (Total E&G divided by FTE). Projected Implementation Projected Program Costs Enrollment Timeframe (From Table 2) (From Table 1) E&G Contract E&G Auxiliary Total HC FTE Cost per & Grants Funds Funds Cost FTE Funds Year 1 150 96.87 3,241 313,960 0 0 313,960 Year 2 150 96.87 Year 3 160 103.33 Year 4 160 103.33 Year 5 170 109.79 3,426 376,087 0 0 376,087 1 Note: This outline and the questions pertaining to each section must be reproduced within the body of the proposal to ensure that all sections have been satisfactorily addressed.
    [Show full text]
  • The Circle Meta-Model
    Document:P2062R0 Revises: (original) Date: 01-11-2020 Audience: SG7 Authors: Wyatt Childers ([email protected]) ​ ​ Andrew Sutton ([email protected]) ​ ​ Faisal Vali ([email protected]) Daveed Vandevoorde ([email protected]) The Circle Meta-model Introduction During the November 2019 meeting in Belfast, some of the SG7 participants enthusiastically mentioned Circle1 as providing a more intuitive compile-time programming model and suggested that SG7 investigate overhauling the de-facto SG7 approach (P1240+P17332) to follow Circle's ​ ​ ​ general approach (to reflection and metaprogramming). This paper describes a framework for understanding metaprogramming systems and provides a high-level overview of some of Circle's main characteristics, contrasting them to P1240's ​ ​ approach augmented with an injection mechanism along the lines of P1717. ​ ​ While we appreciate some of Circle’s powerful capabilities, we also raise some concerns with its underlying model and provide arguments in support of P1240’s choices as being a more ​ ​ suitable fit for C++’s evolution. The Dimensions of Reflective Programming In P0633, we identified three “dimensions” of compile-time reflective metaprogramming: ​ ​ 1. Control: How are compile-time computations effected/interpreted? What are metaprograms? 2. Reflection: How are source constructs are made available as data for use in metaprograms? 3. Synthesis: How can “code” be generated from a programmatic representation? 1 https://www.circle-lang.org/ Circle is an impressive project: Sean Baxter developed a brand new ​ ​ C++17-like front end on top of LLVM, incorporating a variety of new compile-time capabilities that align closely with SG7's goals. For Sean’s motivations, see https://github.com/seanbaxter/circle/blob/master/examples/README.md#why-i-wrote-circle.
    [Show full text]
  • Generic Programming
    Generic Programming July 21, 1998 A Dagstuhl Seminar on the topic of Generic Programming was held April 27– May 1, 1998, with forty seven participants from ten countries. During the meeting there were thirty seven lectures, a panel session, and several problem sessions. The outcomes of the meeting include • A collection of abstracts of the lectures, made publicly available via this booklet and a web site at http://www-ca.informatik.uni-tuebingen.de/dagstuhl/gpdag.html. • Plans for a proceedings volume of papers submitted after the seminar that present (possibly extended) discussions of the topics covered in the lectures, problem sessions, and the panel session. • A list of generic programming projects and open problems, which will be maintained publicly on the World Wide Web at http://www-ca.informatik.uni-tuebingen.de/people/musser/gp/pop/index.html http://www.cs.rpi.edu/˜musser/gp/pop/index.html. 1 Contents 1 Motivation 3 2 Standards Panel 4 3 Lectures 4 3.1 Foundations and Methodology Comparisons ........ 4 Fundamentals of Generic Programming.................. 4 Jim Dehnert and Alex Stepanov Automatic Program Specialization by Partial Evaluation........ 4 Robert Gl¨uck Evaluating Generic Programming in Practice............... 6 Mehdi Jazayeri Polytypic Programming........................... 6 Johan Jeuring Recasting Algorithms As Objects: AnAlternativetoIterators . 7 Murali Sitaraman Using Genericity to Improve OO Designs................. 8 Karsten Weihe Inheritance, Genericity, and Class Hierarchies.............. 8 Wolf Zimmermann 3.2 Programming Methodology ................... 9 Hierarchical Iterators and Algorithms................... 9 Matt Austern Generic Programming in C++: Matrix Case Study........... 9 Krzysztof Czarnecki Generative Programming: Beyond Generic Programming........ 10 Ulrich Eisenecker Generic Programming Using Adaptive and Aspect-Oriented Programming .
    [Show full text]
  • Code Reuse and Refactoring: Going Agile on Complex Products
    Code Reuse and Refactoring: Going Agile on Complex Products Using enterprise Software Version Management to coordinate complex products, seamlessly support Git developers, and solve refactoring problems. Table of Contents Component-Based Development __________________________________________________ 1 CBD Product Model ______________________________________________________________ 1 The Repository Model ____________________________________________________________ 2 Managing CBD in Git _____________________________________________________________ 2 Setting Up the CBD Model _____________________________________________________ 2 Incorporating Non-Software Components ____________________________________ 3 Updating Component Baselines ________________________________________________ 3 Submitting Patches to Components _____________________________________________ 4 Developer View _______________________________________________________________ 4 Refactoring: In Practice ________________________________________________________ 4 Refactoring: Developer Impact _________________________________________________ 4 Managing CBD in Perforce Software Version Management and Perforce Git Fusion ______ 5 Setting Up the CBD Model _____________________________________________________ 5 Incorporating Non-Software Components ____________________________________ 5 Updating Component Baselines ________________________________________________ 5 Submitting Patches to Components _____________________________________________ 5 Developer View _______________________________________________________________
    [Show full text]
  • Comparative Studies of Programming Languages; Course Lecture Notes
    Comparative Studies of Programming Languages, COMP6411 Lecture Notes, Revision 1.9 Joey Paquet Serguei A. Mokhov (Eds.) August 5, 2010 arXiv:1007.2123v6 [cs.PL] 4 Aug 2010 2 Preface Lecture notes for the Comparative Studies of Programming Languages course, COMP6411, taught at the Department of Computer Science and Software Engineering, Faculty of Engineering and Computer Science, Concordia University, Montreal, QC, Canada. These notes include a compiled book of primarily related articles from the Wikipedia, the Free Encyclopedia [24], as well as Comparative Programming Languages book [7] and other resources, including our own. The original notes were compiled by Dr. Paquet [14] 3 4 Contents 1 Brief History and Genealogy of Programming Languages 7 1.1 Introduction . 7 1.1.1 Subreferences . 7 1.2 History . 7 1.2.1 Pre-computer era . 7 1.2.2 Subreferences . 8 1.2.3 Early computer era . 8 1.2.4 Subreferences . 8 1.2.5 Modern/Structured programming languages . 9 1.3 References . 19 2 Programming Paradigms 21 2.1 Introduction . 21 2.2 History . 21 2.2.1 Low-level: binary, assembly . 21 2.2.2 Procedural programming . 22 2.2.3 Object-oriented programming . 23 2.2.4 Declarative programming . 27 3 Program Evaluation 33 3.1 Program analysis and translation phases . 33 3.1.1 Front end . 33 3.1.2 Back end . 34 3.2 Compilation vs. interpretation . 34 3.2.1 Compilation . 34 3.2.2 Interpretation . 36 3.2.3 Subreferences . 37 3.3 Type System . 38 3.3.1 Type checking . 38 3.4 Memory management .
    [Show full text]
  • A Model of Inheritance for Declarative Visual Programming Languages
    An Abstract Of The Dissertation Of Rebecca Djang for the degree of Doctor of Philosophy in Computer Science presented on December 17, 1998. Title: Similarity Inheritance: A Model of Inheritance for Declarative Visual Programming Languages. Abstract approved: Margaret M. Burnett Declarative visual programming languages (VPLs), including spreadsheets, make up a large portion of both research and commercial VPLs. Spreadsheets in particular enjoy a wide audience, including end users. Unfortunately, spreadsheets and most other declarative VPLs still suffer from some of the problems that have been solved in other languages, such as ad-hoc (cut-and-paste) reuse of code which has been remedied in object-oriented languages, for example, through the code-reuse mechanism of inheritance. We believe spreadsheets and other declarative VPLs can benefit from the addition of an inheritance-like mechanism for fine-grained code reuse. This dissertation first examines the opportunities for supporting reuse inherent in declarative VPLs, and then introduces similarity inheritance and describes a prototype of this model in the research spreadsheet language Forms/3. Similarity inheritance is very flexible, allowing multiple granularities of code sharing and even mutual inheritance; it includes explicit representations of inherited code and all sharing relationships, and it subsumes the current spreadsheet mechanisms for formula propagation, providing a gradual migration from simple formula reuse to more sophisticated uses of inheritance among objects. Since the inheritance model separates inheritance from types, we investigate what notion of types is appropriate to support reuse of functions on different types (operation polymorphism). Because it is important to us that immediate feedback, which is characteristic of many VPLs, be preserved, including feedback with respect to type errors, we introduce a model of types suitable for static type inference in the presence of operation polymorphism with similarity inheritance.
    [Show full text]
  • Sub-Method Structural and Behavioral Reflection Marcus Denker
    Sub-method Structural and Behavioral Reflection Marcus Denker To cite this version: Marcus Denker. Sub-method Structural and Behavioral Reflection. Computer Science [cs]. Universität Bern, 2008. English. tel-00555937 HAL Id: tel-00555937 https://tel.archives-ouvertes.fr/tel-00555937 Submitted on 14 Jan 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Sub-method Structural and Behavioral Reflection Inauguraldissertation der Philosophisch-naturwissenschaftlichen Fakultät der Universität Bern vorgelegt von Marcus Denker von Deutschland Leiter der Arbeit: Prof. Dr. O. Nierstrasz Institut für Informatik und angewandte Mathematik Von der Philosophisch-naturwissenschaftlichen Fakultät angenommen. Bern, 26.05.2008 Der Dekan: Prof. Dr. P. Messerli This dissertation is available as a free download from http://scg.unibe.ch Copyright © 2008 Marcus Denker. The contents of this dissertation are protected under Creative Commons Attribution-ShareAlike 3.0 Unported license. You are free: to Share — to copy, distribute and transmit the work to Remix — to adapt the work Under the following conditions: Attribution. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
    [Show full text]
  • Beginning SOLID Principles and Design Patterns for ASP.NET Developers — Bipin Joshi Beginning SOLID Principles and Design Patterns for ASP.NET Developers
    THE EXPERT’S VOICE® IN .NET DEVELOPMENT Beginning SOLID Principles and Design Patterns for ASP.NET Developers — Bipin Joshi Beginning SOLID Principles and Design Patterns for ASP.NET Developers Bipin Joshi Beginning SOLID Principles and Design Patterns for ASP.NET Developers Bipin Joshi 301 Pitruchhaya Thane, India ISBN-13 (pbk): 978-1-4842-1847-1 ISBN-13 (electronic): 978-1-4842-1848-8 DOI 10.1007/978-1-4842-1848-8 Library of Congress Control Number: 2016937316 Copyright © 2016 by Bipin Joshi This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher's location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law. Trademarked names, logos, and images may appear in this book. Rather than use a trademark symbol with every occurrence of a trademarked name, logo, or image we use the names, logos, and images only in an editorial fashion and to the benefit of the trademark owner, with no intention of infringement of the trademark.
    [Show full text]
  • Software Reusability: Approaches and Challenges
    International Journal of Research and Innovation in Applied Science (IJRIAS) |Volume VI, Issue V, May 2021|ISSN 2454-6194 Software Reusability: Approaches and Challenges Moko Anasuodei1, Ojekudo, Nathaniel Akpofure2 1Department of Computer Science and Informatics, Faculty of Science, Federal University Otuoke, Nigeria 2Department of Computer Science, Faculty of Natural and Applied Sciences, Ignatius Ajuru University of Education, Nigeria Abstract: Software reuse is used to aid the software phases. Software engineering has been more centered on development process which in recent times can improve the original development which gives an optimal software at a resulting quality and productivity of software development, by faster and less costly price, a design process based on assisting software engineers throughout various software systemic reusable is now recognized. engineering phases to enhance the quality of software, provide quick turnaround time for software development using few Software reuse reduces efforts and cost, because software people, tools, and methods, which creates a good software development costs can be extremely high, but they are quality by enhancing integration of the software system to shared, such that the cost of reuse can be extremely low. provide a competitive advantage. This paper examines the One major advantage of software reuse suggested by concept of software reuse, the approaches to be considered for keswani et al (2014) explains that there is a significant need software reuse, which is broadly shared into three categories: component-based software reuse, domain engineering and for the number of bugs to be reduced during software software product lines, architecture-based software reuse and development process, such that instead of developing an challenges that affect the software reuse development process.
    [Show full text]
  • Directly Reflective Meta-Programming
    Directly Reflective Meta-Programming ∗ Aaron Stump Computer Science and Engineering Washington University in St. Louis St. Louis, Missouri, USA [email protected] Abstract Existing meta-programming languages operate on encodings of pro- grams as data. This paper presents a new meta-programming language, based on an untyped lambda calculus, in which structurally reflective pro- gramming is supported directly, without any encoding. The language fea- tures call-by-value and call-by-name lambda abstractions, as well as novel reflective features enabling the intensional manipulation of arbitrary pro- gram terms. The language is scope safe, in the sense that variables can neither be captured nor escape their scopes. The expressiveness of the language is demonstrated by showing how to implement quotation and evaluation operations, as proposed by Wand. The language's utility for meta-programming is further demonstrated through additional represen- tative examples. A prototype implementation is described and evaluated. Keywords: lambda calculus, reflection, meta-programming, Church en- coding, Mogensen-Scott encoding, Wand-style fexprs, alpha equivalence, language implementation. 1 Introduction This paper presents a new meta-programming language called Archon, in which programs can operate directly on other programs as data. Existing meta- programming languages suffer from defects such as encoding programs at too low a level of abstraction, or in a way that bloats the encoded program terms. Other issues include the possibility for variables either to be captured or escape their static scopes. Archon rectifies these defects by trading the complexity of the reflective encoding for additional programming constructs. We adopt ∗This work is supported by funding from the U.S.
    [Show full text]
  • [Lirmm-00862477, V1] Bridging the Gap Between Component-Based Design and Implementation with a Reflective Programming Language
    Design and Implementation of a reflective Component-based programming and modeling language Bridging the Gap between Component-based Design and Implementation with a Reflective Programming Language Petr Spacek Christophe Dony Luc Fabresse Chouki Tibermacine Universite´ Lille Nord de France LIRMM, CNRS and Montpellier II University Ecole des Mines de Douai 161, rue Ada 941 rue Charles Bourseul 34392 Montpellier Cedex 5 France 59508 DOUAI Cedex France spacek,dony,tibermacin @lirmm.fr [email protected] { } Abstract General Terms Languages, Reflection, Metamodeling Component-based Software Engineering studies the design, Keywords Component, Programming, Modeling, Archi- development and maintenance of software constructed upon tecture, Reflection, Reflexive, Meta-model, Constraints, sets of connected components. Existing component-based Transformations models are frequently transformed into non-component- based programs, most of the time object-oriented, for run- time execution and then many component-related concepts, 1. Introduction e.g. explicit architecture, vanish at the implementation stage. Research works on component-based software engineering The main reason why is that with objects the component- (CBSE) have brought many advances on how to achieve related concepts are treated implicitly and therefore the orig- complex software development by reusing and assembling inal intentions and qualities of the component-based design components. The current trend is to explicitly express ar- are hidden. This paper presents a reflective component-based chitectures of software solutions, to reason about them, to programming and modeling language, which proposes the verify them and to transform them. However it appears following original contributions: 1) Components are seen that component-orientation has been more studied at de- as objects in which requirements, architecture descriptions, sign stage, with modeling languages and ADLs [10, 16, 22] connection points, etc.
    [Show full text]