Sökning: "Compilers"

Visar resultat 6 - 10 av 48 avhandlingar innehållade ordet Compilers.

  1. 6. Correct and Efficient Monte Carlo Inference for Universal Probabilistic Programming Languages

    Författare :Daniel Lundén; David Broman; Lawrence Murray; Joakim Jaldén; Sam Staton; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Probabilistic programming languages; Compilers; Static program analysis; Monte Carlo inference; Operational semantics; Probabilistiska programmeringsspråk; Kompilatorer; Statisk programanalys; Monte Carlo-inferens; Operationell semantik; Informations- och kommunikationsteknik; Information and Communication Technology;

    Sammanfattning : Probabilistic programming languages (PPLs) allow users to express statistical inference problems that the PPL implementation then, ideally, solves automatically. In particular, PPL users can focus on encoding their inference problems, and need not concern themselves with the intricacies of inference. LÄS MER

  3. 7. Building Verified Hardware and Verified Stacks in HOL

    Författare :Andreas Lööw; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; hardware synthesis; compilers; formal verification; interactive theorem proving;

    Sammanfattning : This thesis explores building provably correct software and hardware inside the HOL4 interactive theorem prover. Interactive theorem provers such as HOL4 are proof environments where manual (human) and automated (machine) proofs can be composed in logically safe ways and all proof steps (be it manual or automated) are mechanically checked. LÄS MER

  4. 8. Extensible Compiler Construction

    Författare :Torbjörn Ekman; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; numerical analysis; Computer science; attribute grammars; extensible compilers; context-sensitive transformations; declarative object-oriented programming; kontroll; system; numerisk analys; Datalogi; control; systems;

    Sammanfattning : Processing of programs is a core area in computer science. A compiler that translates source text to machine language is the most well-known kind of tool in this area, but there are numerous other kinds of related applications: source-to-source translators, refactoring tools, reengineering tools, metrics tools, consistency checkers, etc. LÄS MER

  5. 9. Compiler Generation for Data-Parallel Programming Languages from Two-Level Semantics Specifications

    Författare :Johan Ringström; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : This thesis is an empirical study of compiler generation for data-parallel languages from denotational-semantics-based formal specifications. We investigate whether compiler generation from such specifications is practical, not only with respect to generation of practical compilers, but also with respect to compilation of programs into efficient code and execution of the compiled programs on massively parallel SIMD (Single Instruction Multiple Data) architectures. LÄS MER

  7. 10. Testing an Optimising Compiler by Generating Random Lambda Terms

    Författare :Michal Palka; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; functional programming; software testing; random testing; type systems; lambda calculus;

    Sammanfattning : This thesis tries to improve on the relatively uncommon practice of random testing of compilers.Random testing of compilers is difficult and not widespread for two reasons. First, it is hard to come up with a generator of valid test data for compilers, that is a generator of programs. LÄS MER