The Mystro system: A comprehensive translator toolkit

Mystro is a system that facilities the construction of compilers, assemblers, code generators, query interpretors, and similar programs. It provides features to encourage the use of iterative enhancement. Mystro was developed in response to the needs of NASA Langley Research Center (LaRC) and enjoys a number of advantages over similar systems. There are other programs available that can be used in building translators. These typically build parser tables, usually supply the source of a parser and parts of a lexical analyzer, but provide little or no aid for code generation. In general, only the front end of the compiler is addressed. Mystro, on the other hand, emphasizes tools for both ends of a compiler

Application of the residue number system to the matrix multiplication problem

Due to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to [email protected], referencing the URI of the item.Includes bibliographical references.Not availabl

Walk-Through Guide for Facilitators: Proposed translation and EN>IT Glossary

L’oggetto principale di questo lavoro di tesi è una proposta di traduzione supportata dalla creazione di un glossario EN>IT. Il punto di partenza per una buona traduzione sono delle forti basi teoriche, estremamente utili come guida per il traduttore che si trova a dover affrontare dei problemi traduttologici. Per questo motivo gran parte del mio progetto ruota attorno all’analisi e descrizione di alcuni concetti fondamentali della Scienza della Traduzione, dai modelli di traduzione più conosciuti, alle strategie e processi traduttivi più utili, dagli universali linguistici all’avvento della traduzione automatica e traduzione assistita. Essendo che la mia proposta di traduzione ha come oggetto tre documenti tratti dal progetto IntRef che uniti formano la cosiddetta ‘Guida dettagliata per Facilitatori’, le mie ricerche si sono concentrate maggiormente sulle caratteristiche e sfide della traduzione specializzata e traduzione tecnica. Il secondo capitolo si concentra in particolare sul problema di come tradurre gli elementi specifici della cultura di partenza nella cultura d’arrivo e sulla terminologia, elemento fondamentale della traduzione specializzata. Con questo progetto si è cercato di rappresentare in maniera sia teorica che pratica il processo di traduzione nell’ambito della traduzione specializzata professionale. Questo è stato fatto specialmente attraverso l’analisi della traduzione nella quale è stato descritto il processo di traduzione in tutte le sue fasi ponendo l’accento sulle difficoltà incontrate e su come queste ultime sono state affrontate e risolte. Sono stati inoltre descritti alcuni strumenti ormai fondamentali per la produzione di una traduzione fedele e efficace come i corpora, i software per l’analisi testuale e specialmente i software di traduzione assistita. In conclusione lo scopo principale di questo progetto è quello di presentare una proposta di traduzione di un testo specializzato mostrando in maniera dettagliata tutti i passaggi che hanno contribuito alla sua produzione

Fast self-stabilizing byzantine tolerant digital clock synchronization

Consider a distributed network in which up to a third of the nodes may be Byzantine, and in which the non-faulty nodes may be subject to transient faults that alter their memory in an arbitrary fashion. Within the context of this model, we are interested in the digital clock synchronization problem; which consists of agreeing on bounded integer counters, and increasing these counters regularly. It has been postulated in the past that synchronization cannot be solved in a Byzantine tolerant and self-stabilizing manner. The first solution to this problem had an expected exponential convergence time. Later, a deterministic solution was published with linear convergence time, which is optimal for deterministic solutions. In the current paper we achieve an expected constant convergence time. We thus obtain the optimal probabilistic solution, both in terms of convergence time and in terms of resilience to Byzantine adversaries

Application of the residue number system to the matrix multiplication problem

Due to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to [email protected], referencing the URI of the item.Includes bibliographical references.Not availabl

CryptOpt: Verified Compilation with Random Program Search for Cryptographic Primitives

Most software domains rely on compilers to translate high-level code to multiple different machine languages, with performance not too much worse than what developers would have the patience to write directly in assembly language. However, cryptography has been an exception, where many performance-critical routines have been written directly in assembly (sometimes through metaprogramming layers). Some past work has shown how to do formal verification of that assembly, and other work has shown how to generate C code automatically along with formal proof, but with consequent performance penalties vs. the best-known assembly. We present CryptOpt, the first compilation pipeline that specializes high-level cryptographic functional programs into assembly code significantly faster than what GCC or Clang produce, with mechanized proof (in Coq) whose final theorem statement mentions little beyond the input functional program and the operational semantics of x86-64 assembly. On the optimization side, we apply randomized search through the space of assembly programs, with repeated automatic benchmarking on target CPUs. On the formal-verification side, we connect to the Fiat Cryptography framework (which translates functional programs into C-like IR code) and extend it with a new formally verified program-equivalence checker, incorporating a modest subset of known features of SMT solvers and symbolic-execution engines. The overall prototype is quite practical, e.g. producing new fastest-known implementations for the relatively new Intel i9 12G, of finite-field arithmetic for both Curve25519 (part of the TLS standard) and the Bitcoin elliptic curve secp256k1

Contributions to Securing Software Updates in IoT

The Internet of Things (IoT) is a large network of connected devices. In IoT, devices can communicate with each other or back-end systems to transfer data or perform assigned tasks. Communication protocols used in IoT depend on target applications but usually require low bandwidth. On the other hand, IoT devices are constrained, having limited resources, including memory, power, and computational resources. Considering these limitations in IoT environments, it is difficult to implement best security practices. Consequently, network attacks can threaten devices or the data they transfer. Thus it is crucial to react quickly to emerging vulnerabilities. These vulnerabilities should be mitigated by firmware updates or other necessary updates securely. Since IoT devices usually connect to the network wirelessly, such updates can be performed Over-The-Air (OTA). This dissertation presents contributions to enable secure OTA software updates in IoT. In order to perform secure updates, vulnerabilities must first be identified and assessed. In this dissertation, first, we present our contribution to designing a maturity model for vulnerability handling. Next, we analyze and compare common communication protocols and security practices regarding energy consumption. Finally, we describe our designed lightweight protocol for OTA updates targeting constrained IoT devices. IoT devices and back-end systems often use incompatible protocols that are unable to interoperate securely. This dissertation also includes our contribution to designing a secure protocol translator for IoT. This translation is performed inside a Trusted Execution Environment (TEE) with TLS interception. This dissertation also contains our contribution to key management and key distribution in IoT networks. In performing secure software updates, the IoT devices can be grouped since the updates target a large number of devices. Thus, prior to deploying updates, a group key needs to be established among group members. In this dissertation, we present our designed secure group key establishment scheme. Symmetric key cryptography can help to save IoT device resources at the cost of increased key management complexity. This trade-off can be improved by integrating IoT networks with cloud computing and Software Defined Networking (SDN).In this dissertation, we use SDN in cloud networks to provision symmetric keys efficiently and securely. These pieces together help software developers and maintainers identify vulnerabilities, provision secret keys, and perform lightweight secure OTA updates. Furthermore, they help devices and systems with incompatible protocols to be able to interoperate

Legal translation trainees’ performance in from-scratch translation and post-editing: A product analysis

This study explores the practice of adopting MT tools in the area of legal translation didactics to assess and compare the translation quality of from-scratch vs post-edited translations through an error-based revision. Error analysis highlights both common and unique patterns in the frequency, type and severity of translation errors to possibly determine if and to what extent errors are influenced by the presence of a pre-translated text and which procedure led to higher-quality translations. The study also points out the areas of strength of Machine Translation applied to legal translation didactics alongside its limitations as inferable from the final product.This study explores the practice of adopting MT tools in the area of legal translation didactics to assess and compare the translation quality of from-scratch vs post-edited translations through an error-based revision. Error analysis highlights both common and unique patterns in the frequency, type and severity of translation errors to possibly determine if and to what extent errors are influenced by the presence of a pre-translated text and which procedure led to higher-quality translations. The study also points out the areas of strength of Machine Translation applied to legal translation didactics alongside its limitations as inferable from the final product