Segui questo link per vedere altri tipi di pubblicazioni sul tema: Programming language translation.
Tesi sul tema "Programming language translation"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-24 saggi (tesi di laurea o di dottorato) per l'attività di ricerca sul tema "Programming language translation".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi le tesi di molte aree scientifiche e compila una bibliografia corretta.
1
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.
Testo completo
2
Khan, 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.
Testo completo
3
Sanjabi, 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.
Testo completoAbstract (sommario):
We analyse the semantics of aspect-oriented extensions to functional languages by presenting compositional translations of these primitives into languages with traditional notions of state and control. As a first step, we examine an existing semantic description of aspects which allows the labelling of program points. We show that a restriction of these semantics to aspects which do not preempt the execution of code can be fully abstractly translated into a functional calculus with higher order references, but that removing this restriction requires a notion of exception handling to be added to the target language in order to yield a sound semantics. Next, we proceed to show that abandoning the labelling technique, and consequently relaxing the so-called ``obliviousness'' property of aspectual languages, allows preemptive aspects to be included in the general references model without the need for exceptions. This means that the game model of general references is inherited by the aspect calculus. The net result is a clean semantic description of aspect-orientation, which mirrors recently published techniques for their implementation, and thereby provides theoretical justification for these systems. The practical validity of our semantics is demonstrated by implementing extensions to the basic calculus in Standard ML, and showing how a number of useful aspect-oriented features can be expressed using general references alone. Our theoretical methodology closely follows the proof structure that often appears in the game semantics literature, and therefore provides an operational perspective on notions such as ``bad variables'' and factorisation theorems.
4
Karlsson, 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.
Testo completoAbstract (sommario):
This report describes an examination project made for the IT consultingcompany Sogeti. The purpose of the project was to develop and modify the translation tool Language Manager (LM) built by Sogeti to be used for translating applications. Employees at Sogeti considered some disadvantages with Language Manager, version 1.0 which among others was that language files for projects were saved at two locations. Partly in resource maps among with the source code of the applications and partly in a database. This was dual work for employees at Sogeti and it also caused redundancy inthe system. Also employees at Sogeti thought that the managing of projects and versioning did not adapt to how the system was needed to be used. The destination by the examination project was to remove the database and only use XML-files to handle languages, and also to make the new Language Manager easier to work with. New users should easily understand how to handle terms and translation in the new application and no manual should be needed to perform tasks. Language Manager version 2.0 should be written in C# .Net Framework 4.5 and the graphical user interface should be created with Windows Presentation Foundation (WPF). Sogeti wished for the Model-View-ViewModel pattern (MVVM) to be implemented. The new tool was supposed to be robust and simple with a future-safe architecture.<br>Den 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.
5
Ravalli, Gilbert, and 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.
Testo completoAbstract (sommario):
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.
6
Podkalicka, 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/.
Testo completoAbstract (sommario):
Cultural diversity is a central issue of our times, although with different emphases in the European and Australian context. Media and communication studies have begun to draw on work in translation studies to understand how diversity is experienced across hybrid cultures. Translation is required both for multilingual (multicultural) societies such as Australia and for trans-national entities such as the European Union. Translation is also of increasing importance politically and even emotionally as individual nations and regions face the challenge of globalisation, migration, and the Americanisation of media content. The thesis draws on cultural and media policy analysis. Programming strategies are reviewed and 'conversational' interviews conducted with broadcasting managers and staff at SBS Australia and across multilingual public broadcasters in the EU (BBC WS, Deutsche Welle, ARTE, Radio Multikulti Berlin, Barcelona Televisió). These are used to investigate the issues, challenges, and uses of the multilingual broadcasting logic for Australia's and Europe's cultural realities. This thesis uses the concept of 'translation' as a key metaphor for bridging differences and establishing connections among multicultural citizens in the context of the European Union and Australia. It is proposed that of the two versions of translation - institutional in the EU and mediated in Australia respectively - the mediated version has achieved higher success in engaging ordinary citizens in more affective, informal and everyday forms of cross-cultural communication. Specifically, the experience of the Special Broadcasting Service (Australia's multilingual and multicultural public broadcaster) serves as a model to illuminate the cultural consequences of the failure of the EU to develop translation practices beyond the level of official, institutional and political communication. The main finding is the identification of a need for more mediated interlingual exchange; that is a translation of language policy in Europe into media experience for ordinary citizen-consumers, at both institutional and textual levels.
7
Pippin, 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.
Testo completo
8
Andersson, 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.
Testo completoAbstract (sommario):
The concept of translating source code into other target programming languages is extensively used in a wide area of applications. Danfoss Power Solutions AB, a company located in Älmhult, strives to streamline their way of software development for microcontrollers by implementing this idea. Their proprietary software tool PLUS+1 GUIDE is based on the CAN bus communication network, which allows electronic control units to share data represented in the XML format. Due to compatibility problems, the application in the electronic control units requires this data to be translated into the source code in the low-level C programming language. This thesis project proposes an approach for facilitating this task by implementing a source-to-source compiler that performs the translation with a reduced level of manual user involvement. A literature review was conducted in order to find the existing solutions relevant to our project task. An analysis of the provided XML input files was thereafter performed to clarify a software design suitable for the problem. By using a general XML parser, a solution was then constructed. The implementation resulted in a fully functional source-to-source compiler, producing the generated C code within a time range of 73–85 milliseconds for the input test files of typical size. The feedback received from the domain experts at Danfoss confirms the usability of the proposed solution.
9
Laube, Annett, and 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.
Testo completoAbstract (sommario):
0 VORWORT
Die für die Übersetzung von Programmiersprachen benötigten Analyse- und Synthesealgorithmen können bereits seit geraumer Zeit relativ gut sprachunabhängig formuliert werden. Dies findet seinen Ausdruck unter anderem in einer Vielzahl von Generatoren, die den Übersetzungsproze? ganz oder teilweise automatisieren lassen. Die Syntax der zu verarbeitenden Sprache steht gewöhnlich in Datenform (Graphen, Listen) auf der Basis formaler Beschreibungsmittel (z.B. BNF) zur Verfügung. Im Bereich der Übersetzung natürlicher Sprachen ist die Trennung von Sprache und Verarbeitungsalgorithmen - wenn überhaupt - erst ansatzweise vollzogen. Die Gründe liegen auf der Hand. Natürliche Sprachen sind mächtiger, ihre formale Darstellung schwierig. Soll die Übersetzung auch die mündliche Kommunikation umfassen, d.h. den menschlichen Dolmetscher auf einer internationalen Konferenz oder beim Telefonieren mit einem Partner, der eine andere Sprache spricht, ersetzen, kommen Echtzeitanforderungen dazu, die dazu zwingen werden, hochparallele Ansätze zu verfolgen.
Der Prozess der Übersetzung ist auch dann, wenn keine Echtzeiterforderungen vorliegen, außerordentlich komplex. Lösungen werden mit Hilfe des Interlingua- und des Transferansatzes gesucht. Verstärkt werden dabei formale Beschreibungsmittel realtiv gut erforschter Teilgebiete der Informatik eingesetzt (Operationen über dekorierten Bäumen, Baum-zu-Baum-Übersetzungsstrategien), von denen man hofft, daß die Ergebnisse weiter führen werden als spektakuläre Prototypen, die sich jetzt schon am Markt befinden und oft aus heuristischen Ansätzen abgeleitet sind.
[...]
10
Laube, Annett, and 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.
Testo completoAbstract (sommario):
0 VORWORT
Die für die Übersetzung von Programmiersprachen benötigten Analyse- und Synthesealgorithmen können bereits seit geraumer Zeit relativ gut sprachunabhängig formuliert werden. Dies findet seinen Ausdruck unter anderem in einer Vielzahl von Generatoren, die den Übersetzungsproze? ganz oder teilweise automatisieren lassen. Die Syntax der zu verarbeitenden Sprache steht gewöhnlich in Datenform (Graphen, Listen) auf der Basis formaler Beschreibungsmittel (z.B. BNF) zur Verfügung. Im Bereich der Übersetzung natürlicher Sprachen ist die Trennung von Sprache und Verarbeitungsalgorithmen - wenn überhaupt - erst ansatzweise vollzogen. Die Gründe liegen auf der Hand. Natürliche Sprachen sind mächtiger, ihre formale Darstellung schwierig. Soll die Übersetzung auch die mündliche Kommunikation umfassen, d.h. den menschlichen Dolmetscher auf einer internationalen Konferenz oder beim Telefonieren mit einem Partner, der eine andere Sprache spricht, ersetzen, kommen Echtzeitanforderungen dazu, die dazu zwingen werden, hochparallele Ansätze zu verfolgen.
Der Prozess der Übersetzung ist auch dann, wenn keine Echtzeiterforderungen vorliegen, außerordentlich komplex. Lösungen werden mit Hilfe des Interlingua- und des Transferansatzes gesucht. Verstärkt werden dabei formale Beschreibungsmittel realtiv gut erforschter Teilgebiete der Informatik eingesetzt (Operationen über dekorierten Bäumen, Baum-zu-Baum-Übersetzungsstrategien), von denen man hofft, daß die Ergebnisse weiter führen werden als spektakuläre Prototypen, die sich jetzt schon am Markt befinden und oft aus heuristischen Ansätzen abgeleitet sind.
[...]:0 Vorwort S. 2
1 Einleitung 2. 4
2 Die Komponenten des dreistufigen Transfers S. 5
3 Formalisierung der Komposition S. 8
4 Pre-Transfer-Phase S. 11
5 Formalisierung der Pre-Transfer-Phase S. 13
6 Transfer-Phase S. 18
7 Formalisierung der Transfer-Phase S. 20
8 Post-Transfer-Phase S. 24
9 Transfer-Beispiel S. 25
10 Zusammenfassung S. 29
11
Tonchev, Ognyan, and 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.
Testo completoAbstract (sommario):
This 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.<br>This 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.
12
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.
Testo completo
13
Aspen, 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.
Testo completoAbstract (sommario):
<p> </p><p>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.</p><p>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.</p><p>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.</p><p>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.</p><p>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.</p><p> </p>
14
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.
Testo completoAbstract (sommario):
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (page 62).<br>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.<br>by David Wu.<br>M. Eng.<br>M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
15
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.
Testo completoAbstract (sommario):
Esta tese de doutorado apresenta um modelo de especificação, textual e grafico, para sistemas transacionais em banco de dados (ER/T+) e, também, um modelo de implementação desta especificação. Sugere uma técnica de proceduralização de especificações declarativas, usando um grafo de dependencia de fluxos de dados para estabelecer a relação de precedecia entre os fluxos do diagrama da linguagem gráfica de especificação. Apresenta, também, os mecanismos de execução da linguagem de especificação proposta e as regras de mapeamento da linguagem de especificação, em seus aspectos estruturais (dados) e comportamentais (transações), para correspondentes construções na linguagem de implementação (C e SQL). Adicionalmente, são discutidos aspectos de otimização de consultas no âmbito da linguagem de especificação de transações e, também, aspectos de aninhamento de consultas para combinar diversos fluxos do diagrama ER/T+ em expressões complexas de consultas SQL.<br>This 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
16
Lee, Chen-Hsiu. "A tabular propositional logic: and/or Table Translator." CSUSB ScholarWorks, 2003. https://scholarworks.lib.csusb.edu/etd-project/2409.
Testo completoAbstract (sommario):
The goal of this project is to design a tool to help users translate any logic statement into Disjunctive Normal Form and present the result as an AND/OR TABLE, which makes the logic relation easier to express by using a two-dimensional grid of values or expressions. This tool is implemented through a web-based and Java-based application. Thus, the user can utilize this tool via World Wide Web.
17
Li, 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.
Testo completoAbstract (sommario):
The Unified Modeling Language (UML) is the successor to the wave of object-oriented analysis and design (OOA&D) methods that appeared in the late '80s and early '90s. The class diagram is one of the most useful diagrams in UML. The class diagram technique has become truly central within object-oriented methods.
18
Long, 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/.
Testo completo
19
Gessenharter, 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.
Testo completo
20
Jaber, Ghaleb. "Le langage pascal/relationnel : un langage de programmation de bases de donnees." Toulouse 3, 1987. http://www.theses.fr/1987TOU30222.
Testo completoAbstract (sommario):
Presentation du langage pascal/relationnel construit a partir de pascal par adjonction de constructions venant du domaine des bases de donnees ainsi que la conception et l'implantation du traducteur du langage. Les instructions relationnelles sont inspirees du calcul des predicats et permettent les operations classiques offertes par les systemes de gestion de bases de donnees relationnelles
21
Ditu, Gabriel Cristian Computer Science & Engineering Faculty of Engineering UNSW. "The programming language TransLucid." 2007. http://handle.unsw.edu.au/1959.4/40701.
Testo completoAbstract (sommario):
This thesis presents TransLucid, a low-level, purely declarative, intensional programming language. Built on a simple algebra and with just a small number of primitives, TransLucid programs define arbitrary dimensional infinite data structures, which are then queried to produce results. The formal foundations of TransLucid come from the work in intensional logic by Montague and Scott. The background chapters give a history of intensional logic and its predecessors in the Western world, as well as a history of intensional programming and Lucid, the first intensional programming language. The semantics of TransLucid are fully specified in the form of operational semantics. Three levels of semantics are given, in increasing order of efficiency, with the sequential warehouse semantics, the most efficient, being presented together with a proof that any expression will be evaluated by only examining relevant dimensions in the current context. The language is then extended in three important ways, by adding versioned identifiers, (declarative) side-effects and timestamped equations and demands. Adding versioned identifiers to TransLucid enriches the expressiveness of the language and allows the encoding of a variety of programming paradigms, ranging from manipulating large data-cubes to pattern-matching. Adding side-effects supports one of the main reasons for TransLucid: namely, to provide a target language, together with a methodology, for translating the main programming paradigms, thus creating a uniform end platform that can be the focus for optimisation and program verification. A translation of imperative programs into TransLucid is given. Timestamped equations and demands enable TransLucid to become a language for synchronous programming in real-time systems, as well as allowing runtime updates to a program's equations. The language TransLucid represents a decisive advance in declarative programming. It has applications in many fields of computer science and opens up exciting new avenues of research.
22
Ravalli, 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.
Testo completoAbstract (sommario):
Thesis (MSc.) - Swinburne University of Technology, Faculty of Information & Communication Technologies, 2002.<br>Dissertation for the degree of Master of Science (Research), Faculty of Information and Communication Technologies, Swinburne University of Technology, 2002. Typescript. Bibliography p. 142-146.
23
Wang, Lih-der, and 王立德. "The Implementation of Automated Translator from Programming Language to Timed Automata." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/y8d82v.
Testo completoAbstract (sommario):
碩士<br>國立臺灣大學<br>電機工程學研究所<br>92<br>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.
24
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.
Testo completo