Rozprawy doktorskie na temat „Programming language translation”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 24 najlepszych rozpraw doktorskich naukowych na temat „Programming language translation”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Ibrahim-Sakre, Mohammed M. A. "A fast and expert machine translation system involving Arabic language". Thesis, Cranfield University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305302.
Pełny tekst źródłaKhan, Mohammad Abid. "The use of text-based approach in natural language translation by computer". Thesis, Cranfield University, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.278760.
Pełny tekst źródłaSanjabi, Sam Bakhtiar. "A semantics for aspects by compositional translation". Thesis, University of Oxford, 2008. http://ora.ox.ac.uk/objects/uuid:9cb4d365-afb9-4f9f-b18b-59857e2c85d6.
Pełny tekst źródłaKarlsson, Nina. "Language Manager Version 2.0". Thesis, Örebro universitet, Institutionen för naturvetenskap och teknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-30043.
Pełny tekst źródłaDen här rapporten beskriver ett examensarbete som genomfördes åt IT-konsultbolaget Sogeti med syfte till att vidareutveckla och omarbeta översättningsverktyget Language Manager (LM) som var tillverkat av Sogeti och som användes till att översätta applikationer. Anställda på Sogeti ansåg att det fanns vissa nackdelar med Language Manager version 1.0 som bland annat var att språkfiler för projekt lagrades på två platser. Dels i resursmappar tillsammans med applikationernas källkod och dels i en databas. Detta medförde dubbelt arbete för de anställda på Sogeti när de arbetade med Language Manager och det orsakade även redundans i systemet. På Sogeti ansåg man även att hanteringen av projekt och versionshanteringen av språkdata i Language Manager version 1.0 inte passade ihop med hur man arbetade med programmet. Målet med examensarbetet var att avlägsna databasen och endast arbeta med XML-filer som förvaring av språk och att Language Manager version 2.0 skulle bli enklare och mer lättarbetat. Nya användare skullemed lätthet förstå hur hantering av termer och översättning skulle göras utan hjälp av manual. Det nya översättningsverktyget skulle skrivas i C# .Net Framework 4.5 och Windows Presentation Foundation (WPF) skulle användas för att implementera det grafiska gränssnittet tillsammans med Model-View-ViewModel-mönstret (MVVM).Särskild inriktning skulle framför allt vara mot robusthet, enkelhet och med en framtidssäker arkitektur.
Ravalli, Gilbert, i gravalli@swin edu au. "Translation of on object role model schema into the formal language Z". Swinburne University of Technology, 2005. http://adt.lib.swin.edu.au./public/adt-VSWT20060502.130326.
Pełny tekst źródłaPodkalicka, Aneta Monika. "Lost in translation? Language policy, media and community in the EU and Australia : some lessons from the SBS". Queensland University of Technology, 2007. http://eprints.qut.edu.au/16696/.
Pełny tekst źródłaPippin, William E. Jr. "Optimizing Threads of Computation in Constraint Logic Programs". The Ohio State University, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=osu1041551800.
Pełny tekst źródłaAndersson, Gustav. "Translation of CAN Bus XML Messages to C Source Code". Thesis, Linnéuniversitetet, Institutionen för datavetenskap och medieteknik (DM), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-96424.
Pełny tekst źródłaLaube, Annett, i Hans-Ulrich Karl. "Konzeption eines dreistufigen Transfers für die maschinelle Übersetzung natürlicher Sprachen". Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-100746.
Pełny tekst źródłaLaube, Annett, i Hans-Ulrich Karl. "Konzeption eines dreistufigen Transfers für die maschinelle Übersetzung natürlicher Sprachen". Technische Universität Dresden, 1997. https://tud.qucosa.de/id/qucosa%3A26316.
Pełny tekst źródłaTonchev, Ognyan, i Mohammed Salih. "High-level programming languages translator". Thesis, Blekinge Tekniska Högskola, Avdelningen för för interaktion och systemdesign, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2560.
Pełny tekst źródłaThis paper discusses a high level language translator. If we divide translators of programming languages in two types: those working for two specific languages and universal translators that can be used for translation between different programming languages, the solution that will be presented in this work can be classified as both, specific language oriented and an universal translator. For the purpose of the research it was limited to translate only from Java to C++, but it can easily be extended to translate between any other high level languages. For simplifying the process of translation the project uses an intermediate step. All programs in the input language are first compiled to an abstract XML language and then to the desired output language. That way it is not necessary to translate directly from one programming language to another which is a very tricky and difficult task and could make the solution difficult to be maintained and extended. Hence the translator can also be used to translate from any high level language to XML. That gives another advantage to our solution: an XML representation of a computer program is valuable information by itself. We describe the design and implementation of the solution, demonstrate how it works and also give information on how it can be extended to work for any other programming language.
Millington, M. "Theories of translation correctness for concurrent programming languages". Thesis, University of Edinburgh, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.370892.
Pełny tekst źródłaAspen, Said. "Determining the feasibility of automatically translating SMILE to a Java framework". Thesis, Linköping University, Department of Computer and Information Science, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-15789.
Pełny tekst źródła
MTsim (Mobile Traffic Simulator) is an Ericsson AB internal software application that is part of 2Gsim. It is used to simulate elements of a GSM (Global System for Mobile communications) network for feature testing and automated testing. It is written in the programming language TSS Language, also known as SMILE which is a proprietary Ericsson programming language. SMILE is based on the principles of state matrix programming which in essence means that each program is on its own a finite state machine. The language is old and was originally intended as a macro language for smaller test programs, not for applications the size of MTsim.
It is of interest to evaluate the feasibility of performing an automatic conversion of applications written in SMILE, with special interest in converting MTsim, to a Java framework since Java has many advantages compared to SMILE. Java, as a language, is well suited for larger applications, there are numerous well supported tools and there is a much wider spread competence than there is for SMILE.
It is clear that in order to do a full conversion of a SMILE program to a Java framework two applications must be implemented. First a Java framework, which acts as a run time environment, must be designed which can host the translated programs. The other part is an actual translator which takes a SMILE program as input and ouputs a translated Java program. A more sophisticated framework is preferred since it makes the actual translated programs more light weight and easy to read which means higher degree of maintainability.
There are different ways to implement state machines in Java but the most flexible and versatile is to implement it as a black-box framework in an object oriented way where the framework has sophisticated mechanisms for message and event handling which is central to any state machine framework.
The translation for SMILE can easily be done by using a AST (abstract syntax tree) representation, which is a full representation of the SMILE program in tree-form. The AST is obtained from an intermediate state of the SMILE program compiler.
Wu, David M. Eng Massachusetts Institute of Technology. "Abstraction systems for translating and customizing a blocks-based programming language". Thesis, Massachusetts Institute of Technology, 2018. https://hdl.handle.net/1721.1/122912.
Pełny tekst źródłaThesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (page 62).
StarLogo Nova is a tool that allows users to analyze complex systems by programming agent-based models with a block-based programming language. It can be used in education to study complex systems in a more modern way and is accessible to anyone who has access to the internet. However, there are still a few barriers that reduce StarLogo Nova's impact. First, it is only available in English, so users who are not fluent in English will have difficulty using the powerful tool. Second, novice users who are unfamiliar with programming may find it hard to learn how to program their models, which diminishes their ability to study the science concepts they are trying to model. This thesis takes steps to remedy these problems. First, I develop a system for translating StarLogo Nova into different languages. Then, I work with a fellow researcher in the Scheller Teacher Education Program (STEP) lab on the development of custom blocks: user-defined blocks that can be used to simplify the modeling process. Our design of custom blocks is made with the novice user in mind, creating a more intuitive custom-block creation experience than currently exists in other block-programming languages.
by David Wu.
M. Eng.
M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
Ahlert, Hubert. "Um modelo não procedural de especificação e implementação voltado a sistemas transacionais em banco de dados". reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 1994. http://hdl.handle.net/10183/9006.
Pełny tekst źródłaThis Ph.D thesis presents a graphic and textual specification model for database transactions systems (ER/T+) and, also, an implementation model for this specification. Suggest a proceduralization technique for declarative specifications using a data flow dependency graph to establish a precedence relation between the diagram flows of the graphics specification language. Furthermore it presents the execution mechanism of the proposal specification language and the behavioral and structural rules for mapping the specification language into corresponding implementation language (C and SQL) constructions. Additionaly, are discussed query optimization aspects for transaction specification language and aspects of nested queries to combine various ER/T+ diagram flows into complex SQL query expressions
Lee, Chen-Hsiu. "A tabular propositional logic: and/or Table Translator". CSUSB ScholarWorks, 2003. https://scholarworks.lib.csusb.edu/etd-project/2409.
Pełny tekst źródłaLi, Kaiyan. "Unified modeling language class diagram translator for the online design pattern library system". CSUSB ScholarWorks, 2003. https://scholarworks.lib.csusb.edu/etd-project/2194.
Pełny tekst źródłaLong, Wendy. "CATY : an ASN. 1-C++ translator in support of distributed object-oriented applications /". Master's thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-10242009-020105/.
Pełny tekst źródłaGessenharter, Dominik [Verfasser]. "Semantics-driven translation of UML-models into object-oriented programming languages : aligning the semantics of UML static structures and dynamic behavior in an approach for model-driven development / Dominik Gessenharter". Ulm : Universität Ulm, 2020. http://d-nb.info/1212115295/34.
Pełny tekst źródłaJaber, Ghaleb. "Le langage pascal/relationnel : un langage de programmation de bases de donnees". Toulouse 3, 1987. http://www.theses.fr/1987TOU30222.
Pełny tekst źródłaDitu, Gabriel Cristian Computer Science & Engineering Faculty of Engineering UNSW. "The programming language TransLucid". 2007. http://handle.unsw.edu.au/1959.4/40701.
Pełny tekst źródłaRavalli, Gilbert. "Translation of on object role model schema into the formal language Z". 2002. http://adt.lib.swin.edu.au/public/adt-VSWT20060502.130326/index.html.
Pełny tekst źródłaDissertation for the degree of Master of Science (Research), Faculty of Information and Communication Technologies, Swinburne University of Technology, 2002. Typescript. Bibliography p. 142-146.
Wang, Lih-der, i 王立德. "The Implementation of Automated Translator from Programming Language to Timed Automata". Thesis, 2004. http://ndltd.ncl.edu.tw/handle/y8d82v.
Pełny tekst źródła國立臺灣大學
電機工程學研究所
92
General purpose programming languages are rich in functionalities and therefore have complicated structures. Hence verifying software programs written in such programming languages can be very difficult. Even if the technical specifications had been verified to be error-free, there may still be errors introduced by the actual implementation. It is important that the verification is performed on the final program. Based on the work flow, a program can be considered as a real-time system with many processes, where each process is represented by a fragment of the original program. According to the grammars of the specific programming language, an automated translator can be used to translate the programs into corresponding formal verification models. The whole program can then be verified by applying the standard verification techniques to each model individually. The automation of translation can simplify the task of creating a formal model and identify potential errors in the implementation. We will present our implementation of a program that translates basic C programs into timed automata described by Red.
Dueck, Gerald David Paul. "On the design of a computer language and its translator for programming with abstract data types". 1985. http://hdl.handle.net/1993/29047.
Pełny tekst źródła