Thèses sur le sujet « Compiler theory »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 16 meilleures thèses pour votre recherche sur le sujet « Compiler theory ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
Concepcion, Rowen. « Introducing Non-Determinism to the Parallel C Compiler ». CSUSB ScholarWorks, 2014. https://scholarworks.lib.csusb.edu/etd/22.
Texte intégralWard, Allen Corlies. « A theory of quantitative inference for artifact sets, applied to a mechanical design compiler ». Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/14309.
Texte intégralNgô, Van Chan. « Formal verification of a synchronous data-flow compiler : from Signal to C ». Phd thesis, Université Rennes 1, 2014. http://tel.archives-ouvertes.fr/tel-01067477.
Texte intégralLerner, Sorin. « Automatically proving the correctness of program analyses and transformations / ». Thesis, Connect to this title online ; UW restricted, 2006. http://hdl.handle.net/1773/7001.
Texte intégralElms, Kim. « Debugging optimised code using function interpretation ». Thesis, Queensland University of Technology, 1999.
Trouver le texte intégralCastelluccia, Claude. « Generation automatique d'implementation optimisees de protocoles ». Nice, 1996. http://www.theses.fr/1996NICE4957.
Texte intégralHernandez, Ivory. « Strong-DISM| A First Attempt to a Dynamically Typed Assembly Language (D-TAL) ». Thesis, University of South Florida, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10640802.
Texte intégralDynamically Typed Assembly Language (D-TAL) is not only a lightweight and effective solution to the gap generated by the drop in security produced by the translation of high-level language instructions to low-level language instructions, but it considerably eases up the burden generated by the level of complexity required to implement typed assembly languages statically. Although there are tradeoffs between the static and dynamic approaches, focusing on a dynamic approach leads to simpler, easier to reason about, and more feasible ways to understand deployment of types over monomorphically-typed or untyped intermediate languages. On this occasion, DISM, a simple but powerful and mature untyped assembly language, is extended by the addition of type annotations (on memory and registers) to produce an instance of D-TAL. Strong-DISM, the resulting language, statically, lends itself to simpler analysis about type access and security as the correlation between datatypes and instructions with their respective memory and registers becomes simpler to observe; while dynamically, it disallows operations and further eliminates conditions that from high level languages could be used to violate/circumvent security.
Ward, Daniel R. « Reaper – Toward Automating Mobile Cloud Communication ». ScholarWorks@UNO, 2013. http://scholarworks.uno.edu/td/1707.
Texte intégralNelson, Andrew P. « Funqual : User-Defined, Statically-Checked Call Graph Constraints in C++ ». DigitalCommons@CalPoly, 2018. https://digitalcommons.calpoly.edu/theses/1848.
Texte intégralAtterving, Emmy. « “She said she was called Theodore” : - A modality analysis of five transcendental saints in the 1260’s Legenda Aurea and 1430’s Gilte Legende ». Thesis, Stockholms universitet, Historiska institutionen, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-144052.
Texte intégralCosta, Kelton Augusto Pontara da. « Uma ferramenta para execução de algoritmos utilizando o modelo a fluxo de dados dinâmico em hardware reconfigurável para a arquitetura ChipCflow : módulo de conversão C em grafo a fluxo de dados ». Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/18/18152/tde-20082009-153150/.
Texte intégralChipCflow is a tool for algorithms execution using a data dynamic flow in reconfigurable hardware. The main purpose of the work is to use the data flow architecture model, associated to the concept of reconfigurable architectures, to speed up C written applications. The program acceleration happens in the most intensive processing parts (example: loops), through direct hardware execution, using to advantage of the natural parallelism of the data flow model. The C conversion module in data flow graph is the basic part in the development of the ChipCflow project and the specific objective of the developed work. In this work we present detais of the C precompiler that generates VHDL code for the data flow operators modules of the written program of the original application in C. It is possible to consider as the main result of this thesis, the implementation of algorithms from a C language in the data flow graph model proposed in the project ChipCflow, where the operators to the data stream are typically already known, and even the way interconnection too, but how to approach the implementation in VHDL, and as a dynamic data flow, makes the proposed model for both the hardware and the compiler, a feature only available so far.
Ward, Allen C. « A Theory of Quantitative Inference Applied to a Mechanical Design Compiler ». 1989. http://hdl.handle.net/1721.1/6977.
Texte intégralThakur, Aditya. « Comprehensive Path-sensitive Data-flow Analysis ». Thesis, 2008. http://hdl.handle.net/2005/836.
Texte intégral« Scaling CFL-reachability-based alias analysis : theory and practice ». 2013. http://library.cuhk.edu.hk/record=b5884323.
Texte intégralThesis (Ph.D.)--Chinese University of Hong Kong, 2013.
Includes bibliographical references (leaves 170-186).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Abstracts also in Chinese.
Gunther, Emmanuel. « Formalización de fundaciones de la matemática y compiladores correctos por construcción ». Doctoral thesis, 2019. http://hdl.handle.net/11086/14372.
Texte intégralDentro de las teorías fundacionales de la matemática se encuentran la Teoría de Conjuntos y la Teoría de Tipos. La primera es bien conocida en la comunidad matemática; la teoría de tipos además de ser una posible fundación, es una base para lenguajes de programación lo suficientemente expresivos para enunciar teoremas, escribir sus pruebas y que su corrección sea verificada automáticamente. Esta tesis resume tres trabajos independientes pero relacionados entre sí. El primero consiste en el desarrollo de una metodología para definir compiladores correctos por construcción mediante el uso de tipos dependientes. Gracias a la expresividad de estos sistemas de tipos refinamos los lenguajes fuente y destino con su semántica; el tipo de la función de compilación es exactamente la preservación de la semántica. Matemáticamente podemos concebir los lenguajes como álgebras de términos de una signatura y al compilador como el homomorfismo inducido por la interpretación de una signatura en la otra. Esto nos llevó a formalizar en Agda una librería para Álgebra Universal Heterogénea, incluyendo las principales definiciones y resultados básicos, un sistema deductivo para un cálculo ecuacional y las nociones de morfismos entre signaturas y álgebras reducto. El último aporte de la tesis surge del estudio de uno de los problemas más famosos en la teoría de conjuntos: la independencia de la hipótesis del continuo (CH) respecto a la teoría ZFC. Gödel y Cohen demostraron, respectivamente, que no puede refutarse ni probarse CH en ZFC. Cohen desarrolló para ello la técnica de Forcing, que es la única manera conocida para extender modelos de ZFC. Si bien este desarrollo constituye uno de los avances más grandes en teoría de conjuntos, no existe hasta el momento ninguna formalización de Forcing en asistentes de prueba. Como parte de este doctorado hemos comenzado la formalización en el asistente Isabelle/ZF de la técnica de Forcing, llegando a probar que la extensión genérica satisface varios axiomas de ZF.
Set Theory and Type Theory are known as Foundations of Mathematics. The first one is well known by mathematicians; Type Theory, besides being a foundation, is the basis for programming languages expressive enough to state theorems, write their proofs and verify their correctness automatically. This thesis summarizes three works. The first one consists of the development of a methodology to define correct-by-construction compilers, using dependent types. Thanks to the expressiveness of these type systems, we refine the syntax of source and target languages by adding information of semantics at type level; then, the type of the compiler function expresses the property of correctness. We can conceive the languages as term algebras of a signature, and the compiler as the homomorphism induced by the interpretation of a signature in other. Hence we formalized in the Agda proof assistant a library of Heterogeneous Universal Algebra, including main definitions and basic results, a deductive system for equational calculus and notions of morphisms between signatures and reduct algebras. The last contribution of this thesis is motivated by the study of one of the most famous problems in set theory: the independence of the continuum hypothesis (CH) with respect to the ZFC theory. Gödel and Cohen showed that CH cannot be refuted or proven. In his work, Cohen developed the technique of forcing, the only known way to extend models of ZFC. Despite the importance of forcing in set theory, there was no mechanization in proof assistants. Our last work consists of the first steps of a complete formalization of forcing in the Isabelle proof assistant.
Gunther, Emmanuel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación; Argentina.
Valluri, Swetha. « Determinants of Health Care Use Among Rural, Low-Income Mothers and Children : A Simultaneous Systems Approach to Negative Binomial Regression Modeling ». 2011. https://scholarworks.umass.edu/theses/731.
Texte intégral