This thesis is one of the first to introduce a systematic and general Source Language Analysis System (called SLA) for a high -level synthesis system.

Abstract not available

In the development of information systems for business, structured approaches are widely used in practice. Structured approaches provide a prescription and guidelines for how to go about the process of developing an information system, are relatively easy to learn and provide tools which are well suited to their task. However, the products of structured approaches are sometimes seen to be vague and imprecise since requirements are written using natural language or represented in the form of models which do not have a formal foundation. This vagueness or ambiguity can be the source of problems later in development of the information system. A possible solution to this is to represent requirements using formal methods since these are seen as precise and unambiguous. However, formal methods are typically only a mathematical language for representing requirements. They are often regarded as difficult to learn and use. Even though formal methods of one sort or another have been in existence for many years they are not popular and appear unlikely to become popular in the future. One possible approach to providing the advantages of structured approaches and formal methods is to provide translation procedures from the products of structured approaches to a formal description in a suitable formal language. The work in this thesis follows this theme and is aimed at the creation of a translation procedure from an Object Role Model (ORM) schema to a Z specification. An object role model schema is the end product of a process called the Natural Language Information Analysis Method (NIAM) which is used to produce an information model for an information system. NIAM is a method which has been used successfully in industry since the mid 1970s and continues to be used today. This thesis provides a translation procedure from ORM to Z which is less arbitrary and more comprehensive than previous conversion procedures in the literature. It establishes a systematic method for (i) choosing suitable types and variables for a Z specification and (ii) predicates that express all the standard constraints available in ORM modelling. The style of representation in Z preserves ORM�s concepts in a way that aids traceability and validation. The natural language basis of ORM, namely the use of elementary facts, is preserved. Furthermore, an ORM schema differentiates between abstract concepts and the means by which these concepts are represented symbolically and this thesis provides a representation in Z that maintains the distinction between conceptual objects and their symbolic representation. Identification schemes of entity types are also translated into the Z specification but it is left as an option in the translation procedure. Guiding and evaluating the work conducted here are a published set of criteria for the evaluation of a conceptual schema. These have helped in making decisions regarding the translation procedure and for assessing my work and that of others.

This thesis describes a new approach to achieving high quality distributed garbage collection using the Train Algorithm. This algorithm has been investigated for its ability to provide high quality collection in a variety of contexts, including persistent object systems and distributed object systems. Prior literature on the distributed Train Algorithm suggests that safe, complete, asynchronous, and scalable collection can be attained, however an approach that achieves this combination of behaviour has yet to emerge. The mechanisms and policies described in this thesis are unique in their ability to exploit the distributed Train Algorithm in a manner that displays all four desirable qualities. Further the mechanisms allow any number of mutator and collector threads to operate concurrently within a site; this is also a unique property amongst train-based mechanisms (distributed or otherwise). Confidence in the quality of the approach promoted in this thesis is obtained via a top-down approach. Firstly a concise behavioural model is introduced to capture fundamental requirements for safe and complete behaviour from train-based collection mechanisms. The model abstracts over the techniques previously introduced under the banner of the Train Algorithm. It serves as a self- contained template for correct train-based collection that is independent of a target object system for deployment of the algorithm. Secondly a means to instantiate the model in a distributed object system is described. The instantiation includes well-established techniques from prior literature, and via the model these are correctly refined and reorganised with new techniques to achieve asynchrony, scalability, and support for concurrency. The result is a flexible approach that allows a distributed system to exhibit a variety of local collection mechanisms and policies, while ensuring their interaction is safe, complete, asynchronous, and scalable regardless of the local choices made by each site. Additional confidence in the properties of the new approach is obtained from implementation within a distributed object system simulation. The implementation provides some insight into the practical issues that arise through the combination of distribution, concurrent execution within sites, and train-based collection. Executions of the simulation system are used to verify that safe collection is observed at all times, and obtain evidence that asynchrony, scalability, and concurrency can be observed in practice. / Thesis (Ph.D.)--School of Computer Science, 2004.

Thesis (Ph.D.) -- Mississippi State University. Department of Industrial and Systems Engineering. / Title from title screen. Includes bibliographical references.

The purpose of this qualitative study was to describe how novice students solved computer programming problems in a beginning college level computer science (CS) course with an introduction to object-oriented programming (OOP) and what knowledge they obtained about OOP and computer problem solving (CPS) as a result of their experiences. Additionally, this descriptive study attempted to characterize the instruction provided to students in a beginning CS course as well as students' CPS strategies. An introduction to computer science class at the college level was selected for the sample. One experienced instructor and four students participated in this study. Data were collected through classroom observations, interviews with the instructor and students, classroom documents and researcher's journals. The analysis of the results revealed a teacher-centered instruction focused on syntactical details with an emphasis on the imperative paradigm and an introduction to object-oriented aspects of the C++ language. Results revealed that to develop the solution code for the given problems, students consistently approached them without a comprehensive written plan/design. The process students typically used in developing a solution for the given computer problem involved: (1) problem understanding, (2) preliminary problem analysis, (3) reliance on examples and (4) trial-and-error. Students typically approached debugging syntax and logic errors by (1) following the compiler generated messages, (2) using trial-and-error, (3) performing a desk-check strategy and (4) using the VISUAL C++ debugger. This study identified the features of CPS and OOP learning that can be studied for identifying how students approach CPS and OOP processes in other object-oriented languages (such as JAVA) and how their CPS and OOP processes develop as compared to C++. Differences in programming performances were found among males and females. Males in this study were more comfortable with the mechanical-orientation of programming as compared with their female counterparts. Future research is needed in CPS and OOP to explore gender issues in learning OOP languages. This study identified potential student CPS and OOP learning processes and factors using a qualitative approach. Future research should investigate the factors effecting introductory CS problem solving using a quantitative methodology or perhaps a combination of qualitative and quantitative approaches. / Graduation date: 2003

This dissertation examines aspects of the relationship between connectivity and the development of genetic structure in subdivided coral reef populations using both simulation and algebraic methods. The first chapter develops an object-oriented, individual based method of simulating the dynamics of genes in subdivided populations. The model is then used to investigate how changes to different components of population structure (e.g., connectivity, birth rate, population size) influence genetic structure through the use of autocorrelation analysis. The autocorrelograms also demonstrate how relationships between populations change at different spatial and temporal scales. The second chapter uses discrete multivariate distributions to model the relationship between connectivity, selection and resource use in subdivided populations. The equations provide a stochastic basis for multiple-niche polymorphism through differential resource use, and the role of scale in changing selective weightings is also considered. The third chapter uses matrix equations to study the expected development of genetic structure among Caribbean coral reefs. The results show an expected break between eastern and western portions of the Caribbean, as well as additional nested structure within the Bahamas, the central Caribbean (Jamaica and the reefs of the Nicaraguan Rise) and the Mesoamerican Barrier Reef. The matrix equations provide an efficient means of modeling the development of genetic structure in subdivided populations through time. The fourth chapter uses matrix equations to examine the expected development of genetic structure among Southeast Asian coral reefs. Projecting genetic structure reveals an expected unidirectional connection from the South China Sea into the Coral Triangle region via the Sulu Sea. Larvae appear to be restricted from moving back into the South China Sea by a cyclonic gyre in the Sulu Sea. Additional structure is also evident, including distinct clusters within the Philippines, in the vicinity of the Makassar Strait, in the Flores Sea, and near Halmahera and the Banda Sea. The ability to evaluate the expected development of genetic structure over time in subdivided populations offers a number of potential benefits, including the ability to ascertain the expected direction of gene flow, to delineate natural regions of exchange through clustering, or to identify critical areas for conservation or for managing the spread of invasive material via elasticity analysis.

Programmers worldwide share components and jointly develop components on a global scale in contemporary software development. An important aspect of such library-based programming is the need for technical communication with regard to libraries – library communication. As part of their work, programmers must discover, study, and learn as well as debate problems and future development. In this sense, the electronic, networked media has fundamentally changed programming by providing new mechanisms for communication and global interaction through global networks such as the Internet. Today, the baseline for library communication is hypertext documentation. Improvements in quality, efficiency, cost and frustration of the programming activity can be expected by further developments in the electronic aspects of library communication. This thesis addresses the use of the electronic networked medium in the activity of library communication and aims to discover design knowledge for communication tools and processes directed towards this particular area. A model of library communication is provided that describes interaction among programmer as webs of interrelated library communities. A discussion of electronic, networked tools and processes that match such a model is also provided. Furthermore, research results are provided from the design and industrial valuation of electronic reference documentation for the Java domain. Surprisingly, the evaluation did not support individual adaptation (personalization). Furthermore, global library communication processes have been studied in relation to open-source documentation and user-related bug handling. Open-source documentation projects are still relatively uncommon even in open-source software projects. User-related Open-source does not address the passive behavior users have towards bugs. Finally, the adaptive authoring process in electronic reference documentation is addressed and found to provide limited support for expressing the electronic, networked dimensions of authoring requiring programming skill by technical writers. Library communication is addressed here by providing engineering knowledge with regards to the construction of practical electronic, networked tools and processes in the area. Much of the work has been performed in relation to Java library communication and therefore the thesis has particular relevancefor the object-oriented programming domain. A practical contribution of the work is the DJavadoc tool that contributes to the development of reference documentation by providing adaptive Java reference documentation. / On the day of the public defence the title of article I was: Designing Electronic Library Reference Documentation.

After the book, Design Patterns: Elements of Reusable Object-Oriented Software was published in 1994, usage of design patterns in object-oriented (OO) programming has been investigated by many researchers. However, the effects of design patterns on non-object oriented (non-OO) programming have not been analyzed too much in the literature. This study focuses on various design pattern implementations using non OO programming and investigates the benefits of design patterns upon real-time software. In order to evaluate the results, specific quality metrics were selected and performance of traditionally developed software was compared with that of software developed using design patterns.

Computer software is ubiquitous. More than 35 × 10 18 computer instructions are executed around the globe each second. As computers dominate more aspects of our lives, there is a growing need to reason more accurately about computer software. Most contemporary computer software is written using object-oriented (OO) programming languages, such as J AVA, C#, and C++. How should we mathematically characterize object-oriented software? This is the question this thesis addresses by presenting an accurate domain-theoretic model of mainstream object-oriented programming. Mainstream object-oriented languages are class-based. In such languages, the name of a class is part of the meaning of an object, a property often called "nominality". Most mainstream OO languages also conform to a static type discipline. Hence, the focus of this thesis is the construction of an accurate model of nominal, statically-typed OO languages. In statically-typed nominal OO languages, class names are also part of the meaning of corresponding class types, and class inheritance (subclassing) is explicitly declared; one class is a subclass of another only if it is declared as such. When static type systems are formulated to describe sets of objects, subtyping is defined so that subclassing is consistent with subtyping. Nevertheless, some programming languages (PL) theoreticians dismiss this identification as a design error because the only published models of OO languages exclude nominal information from objects and define subtyping in a way that ignores nominality. In nominal OO languages, program behavior depends on the nominal information embedded in objects. This thesis builds a model of OO languages called NOOP that includes nominal information and defines static types in accord with mainstream OO language designs. In NOOP , the meaning of every object includes its class name. Similarly, types are defined such that objects belong to a particular class type if and only if they are members of classes that inherit from the class corresponding to the class type. To demonstrate the utility of the model, we show that in NOOP inheritance and OO subtyping coincide. This work shows that mainstream OO languages are not technically defective in identifying inheritance and subtyping. In models that include nominal information and define types that respect nominal information, this identification is mathematically correct. The folklore among OO programming language researchers that "inheritance is not subtyping" is incorrect.