Thesis (Ph. D.), Oregon Graduate Institute of Science & Technology, 1995.

Thesis (M.C.S.)--Carleton University, 1992. / Also available in electronic format on the Internet.

Thesis (M.S. in Computer Science) Naval Postgraduate School, March 1996. / Thesis advisor(s): David K. Hsiao, C. Thomas Wu. "March 1996." Includes bibliographical references. Also available online.

Made available in DSpace on 2014-06-12T15:54:28Z (GMT). No. of bitstreams: 2 arquivo7152_1.pdf: 1057833 bytes, checksum: 67e3dddb2bcfb41fafccbd6d0086f285 (MD5) license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2005 / Neste trabalho discutimos o projeto de compiladores corretos por construção para linguagens orientadas a objeto. Um compilador correto é aquele que garante que a semântica é preservada quando o programa fonte _e traduzido para a linguagem destino. O projeto de compiladores corretos para linguagens imperativas se encontra bem fundamentado; atualmente, o maior desafio é o desenvolvimento de uma abordagem para lidar com características de orientação a objetos. Nesta tese, descrevemos uma abordagem algébrica para construção de compiladores corretos para uma linguagem orientada a objetos chamada ROOL (acrônimo para Refenement Objecy-oriented Language), que é similar a Java e C++. Esta linguagem inclue classes, herança, ligação dinâmica, recursão, cast e teste de tipos, e visibilidade baseada em classes. Na nossa abordagem, lidamos com o problema de corretude do compilador transformando a tarefa de compilação em uma tarefa de refinamento de programa. O processo de compilação passa ser identificado como sendo a redução de um programa fonte, escrito em um subconjunto executável da linguagem, para uma forma normal. A forma normal é gerada por uma série de transformações que preservam a corretude, e s ao provadas corretas a partir das leis básicas da linguagem; portanto o processo é correto por construção. A maior vantagem da nossa abordagem reside na caracterização do processo de compilação dentro de um sistema uniforme onde as comparações e traduções entre semânticas são evitadas. A redução a forma normal é formalizada como uma álgebra onde a noção central é a de refinamento de programas. Portanto, o produto da compilação é um programa na própria linguagem fonte. Nossa forma normal é um programa na forma de um interpretador, escrito na mesma linguagem fonte, emulando o comportamento da máquina destino. A partir desse interpretador, é que a seqüência das instruções geradas são capturadas. Definimos a Máquina Virtual de ROOL (RVM) como sendo nossa máquina destino; ela _e baseada na Máquina Virtual de Java (JVM) Tal uniformidade implica que todo o cálculo necessário para assegurar a corretude do processo de compilação é realizado em um único sistema de uma linguagem orientada a objetos cuja semântica é dada por leis algébricas. Nenhuma teoria relativa a linguagem fonte ou destino é desenvolvida ou usada no processo. O processo de compilação é justificado por teoremas de redução da forma normal. Existem cinco fases: pré-compilação de classes, redirecionamento de chamada de métodos, simplificação, eliminação de controle e refinamento de dados. Para cada fase, um teorema assegura o resultado esperado. O teorema principal conecta os passos intermediários e estabelece o resultado para todo o processo. Uma vez que os teoremas de redu¢c~ ao pra cada fase são provados corretos a partir das leis básicas de ROOL, eles corroboram para a corretude de todo o processo

No description available.

M.Sc. (Information Science) / In this study we have looked at object-oriented programming in the field of manufacturing. Scheduling was the main topic of research in this study. Object-oriented programming was used, because It was found easier to develop a general scheduling system by using objects. The use of mathematical algorithms (for example) would have been much more cumbersome and further developments would not have been as simple. At first, Expert Systems (ES), Artificial Intelligence (AI), Flexible Manufacturing Systems (FMS), Process Planning, Computer Integrated Manufacturing (elM), etc. are discussed. This forms the basis for the different scheduling techniques studied. . To make the study more useful, a system was developed in Turbo Pascal 5.5. The Idea behind the system is to explain different dynamic scheduling techniques, for example due date scheduling, backward scheduling and priority scheduling. The objects used in the system are explained with the help of a pseudo-object-oriented language, "NOT". The conclusions made from this paper can be used for further studies.

Because of an interest in object-oriented database systems, designers have created systems to store and manipulate specific sets of abstract data types that belong to the real world environment they represent. Unfortunately, the advantage of these systems is also a disadvantage since no single object-oriented database system can be used for all applications. This paper describes an object-oriented database management system called the Object-oriented Database Editor (ODE) which overcomes this disadvantage by allowing designers to create and execute an object-oriented database that represents any type of environment and then to store it and simulate that environment. As conditions within the environment change, the designer can use ODE to alter that environment without loss of data. ODE provides a flexible environment for the user; it is efficient; and it can run on a personal computer.

International Telemetering Conference Proceedings / October 26-29, 1998 / Town & Country Resort Hotel and Convention Center, San Diego, California / Satellite tracking ground stations are under continuous pressure to automate. Autonomy is generally the desired goal, but if the ground stations are in a Commercial Ground Network(CGN) setup to support many missions simultaneously, remote control of such stations is of much more importance. The proliferation of Low Earth Orbiting (LEO) science, earth resources and eventually global communications satellites either in orbit or planned, requires a much lower cost methodology for ground support. A CGN of TCP/IP remotely controlled ground stations lowers much of the manpower that was historically required to operate such stations. This paper will cover the remote control aspects needed for a satellite ground tracking station and offer a unique remote control topology utilizing TCP/IP.

International Telemetering Conference Proceedings / November 04-07, 1991 / Riviera Hotel and Convention Center, Las Vegas, Nevada / There exists today, numerous off-the-shelf hardware solutions for the generation of simulated telemetry data streams. The ability to rapidly develop engineering models to drive the data contents of the telemetry is restricted by the lack of contemporary CASE tools. This paper presents an object-oriented Graphical User Interface (GUI) approach to generation of mathematical models in order to reduce the time required for model generation to a fraction of today’s development time, eliminate the need to write substantial amounts of software, and allow reuse of model objects in a manner consistent with the GUI cut, paste, and copy metaphors.

A major goal in software engineering is to reduce the cost of maintaining software systems. Finding design methods which make software more easily maintainable has thus been one of the most prioritized challenges during the past decade. While mainstream software design has concentrated on maintainability, other software disciplines e.g. high-performance computing and high-availability systems, have developed other design methods which primarily support the quality attributes that are more important in their areas. More recently, demands have been made for high performance and high availability in typical mainstream software. At the same time, traditional high-performance and high-availability systems tend to incorporate more advanced business functionality, i.e. different software disciplines have started to converge. The situation is not unproblematic since the software design methods developed for achieving performance and availability may have been developed with a limited influence from maintainability, and vice versa. It is thus important to identify and analyze emerging design conflicts. In this thesis I have studied conflicts between maintainability design methods onthe one hand, and performance and availability methods and techniques on the other. I present the results of four case-studies involving four different applications. It is a characteristic of these applications that half of the system can be regarded as a telecommunications system and the other as a typical main-stream system, i.e. all systems make high demands on performance and availability but also very high demands on high maintainability. In studying these applications, I have identified two major conflicts: granularity in dynamic memory usage and source code size. My results show that these two conflicts can cause problems of such amplitude that some applications become unusable. I found that conflicts in certain situations are inherent; in other cases they can be avoided - or at least reduced - by adjusting the design methods used. I have also shown that conflicts may quite simply be a matter of misconceptions. Ten guidelines have been combined into a simple process with the aim of helping software designers to avoid and reduce conflicts. A method which automatically reduces the dynamic memory conflict in object-oriented applications written in C++ has been developed, implemented and evaluated. Finally, I have defined optimal recovery schemes for high availability clusters.