The Unified Extensible Firmware Interface (UEFI) is the industry-standard Basic Input/Output System (BIOS) firmware specification used by modern desktop, portable, and server computers, and is increasingly being ported to today's new mobile form factors as well. UEFI is firmware responsible for bootstrapping the hardware, turning control over to an operating system loader, and then providing runtime services to the operating system. ANTLR (ANother Tool for Language Recognition) is a lexer-parser generator for reading, processing, executing, and translating structured text and binary files. It supersedes older technologies such as lex/yacc or flex/bison and is widely used to build languages and programming tools. ANTLR accepts a provided grammar and generates a parser that can build and walk parse trees. This report studies UEFI BIOS and compiler theory and demonstrates ways compiler theory can be leveraged to solve problems in the UEFI BIOS domain. Specifically, this report uses ANTLR to implement two language applications aimed at furthering the development of UEFI BIOS implementations. They are: 1. A software complexity analysis application for UEFI created that leverages ANTLR's standard general-purpose C language grammar. The complexity analysis application uses general-purpose and domain-specific measures to give a complexity score to UEFI BIOS modules. 2. An ANTLR grammar created for the VFR domain-specific language, and a sample application which puts the grammar to use. VFR is a language describing visual elements on a display; the sample application creates an HTML preview of VFR code without requiring a developer to build and flash a BIOS image on a target machine to see its graphical layout. / text

Many companies in the domain of modeling and simulation are showing interest in the new emerging OpenModelica, an object oriented modeling and simulation platform based on Modelica language. The purpose of this thesis is to study if and how simulation libraries written in ExtendSim such as PaperFront, can be semi-automatically converted to equivalent Modelica libraries. The ExtendSim tool is based upon a C like language called ModL that is used for designing models. A prototype translator is developed for translating ModL to Modelica. One difficulty that had to be overcome was the fact that ExtendSim is a commercial tool which hides part of its model information in a binary format. The generated code from prototype translator can be viewed using any text editor or using the textual view of Modelica graphical editors such as OMEdit or Dymola. The implementation of the prototype translator is done using the Java based ANTLR tool, which generates a parser and a lexer from the defined grammar rules. Moreover, a set of templates is written using the StringTemplate language for the code generation. The prototype translator takes ModL code of an ExtendSim library file and generates an Abstract Syntax Tree (AST), which is then converted to an equivalent Modelica AST. This Modelica AST is later converted to textual Modelica code. Subject to limited resource availability and time constraints of the thesis work, the basic constructs of ModL language are supported by the translator e.g. data types, if-else statements, loops, procedures etc. The enhancements in the translator can be made in the future by adding support for remaining language features such as support for tracing and additional ModL built-in functions etc.

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Quantum computing is an emerging technology that, currently, has the challenge of developing programming languages, according to the rules of quantum mechanics, to support the creation, analysis, modeling and simulation of high-level quantum algorithms. Particularly, the focus is on the investigation of new semantic models to develop programming languages for quantum computing. In this context, one alternative is to use the semantic model of monads and arrows that abstracts both pure and mixed quantum states and also can express measures. This model however, was originally implemented as a library for the functional language Haskell, which not every programmer is family. This way, this study aims to provide a universal tool for high-level quantum programming, providing a library for Java. This library was implemented using the new features of closures present in the version 8 of the JDK (Java Development Kit), already available in developers preview. In addition, we present a specific syntax for the library to facilitate the development of quantum algorithms with a clearly structured notation. This syntax is described in a notation similar to the do-notation of Haskell and operates in conjunction with a parser implemented by ANTLR tool. / A computação quântica é uma tecnologia emergente e, atualmente, encontra-se no desafio de desenvolver linguagens de programação segundo as regras da mecânica quântica para a criação, análise, modelagem e simulação de algoritmos quânticos de alto nível. Particularmente, o foco é na investigação de novos modelos semânticos para elaborar linguagens de programação para a computação quântica. Nesse contexto, uma das alternativas é utilizar um modelo semântico de mônadas e setas capaz de abstrair tanto estados quânticos puros quanto mistos e ainda expressar operações de medidas. Esse modelo foi implementado como uma biblioteca para a linguagem funcional Haskell, contudo nem todo programador está familiarizado. Dessa forma, o presente trabalho objetiva oferecer uma ferramenta universal de alto nível para a programação quântica, apresentando uma biblioteca para o Java. Essa biblioteca foi implementada utilizando os novos recursos de closures presentes na versão 8 do JDK (Java Development Kit), já disponibilizados na prévia de desenvolvedores. Além disso, esse trabalho apresenta uma sintaxe específica para a biblioteca para facilitar a elaboração de algoritmos quânticos de forma clara e estruturada, descrita de uma maneira similar a notação-do do Haskell. A sintaxe criada opera em conjunto com um tradutor desenvolvido com a ferramenta ANTLR.

Master of Science / Department of Computing and Information Sciences / Xinming Ou / Attack graphs present a visual representation of all the potential vulnerabilities and attack paths in a network. They act as a vital security tool in finding the critical attack paths in the enterprise wide networks. Generated attack graphs for complex networks present thousands of attack paths to visualize and represent to the end user. Enhancing the visualization of attack graphs by adding user interactivity will greatly improve in analyzing attack graphs and identifying the critical attack paths in the enterprise network. The layout of the attack graph can be adjusted to represent the layout of the real world enterprise network. Adding user interactivity to attack graphs is done using Prefuse, a software framework written in Java for information visualization. Prefuse is flexible and got the ability to render large amounts of data in an efficient manner. The visualization framework for the attack graphs provides a GUI tool for interacting with attack graph. The framework is a layered architecture with two important layers, the static layer and the dynamic layer. The static layer translates the attack graph trace generated from MuLVAL into a standard graphviz dot language descriptive file. The dynamic layer translates the graphviz dot file into a graph object that can be interpreted and visualized using the prefuse software framework. Preliminary result in this work has been published in [19].

<p>The goal of this project is to create a source-to-source compiler which will translate NestStep code to C code. The compiler's job is to replace NestStep constructs with a series of function calls to the NestStep runtime system. NestStep is a parallel programming language extension based on the BSP model. It adds constructs for parallel programming on top of an imperative programming language. For this project, only constructs extending the C language are relevant. The output code will compile to form an executable program that runs on the multicore processor Cell Broadband Engine (Cell BE). The NestStep runtime system has been ported to the Cell BE and is available from start of this project.</p>

Most of the common DBMS (ORACLE, Microsoft SQL Server, MySQL, DB2, etc.) use disk storage as run time memory. When data becomes necessary from database, DBMS reads them from disk and loads it to RAM (Random Access Memory). This approach uses small amount of RAM, but DBMS efficiency is relative poor. In this work was created prototype of DBMS. This prototype is read-only DBMS and holds all database data in RAM. The purpose of this work is to compare efficiency of common DBMS against created prototype. For this prototype was developed and optimized bunch of data searching, sorting, grouping, joining algorithms. All of these algorithms are based on the main prototype data model idea: database table stores all data into table tree. Prototype and other DBMS were tested with TPCH test, which consists of very different 22 SQL queries to test DBMS efficiency. The test result produced good results for prototype: prototype was 30-40 times faster against ORACLE on complex joining queries and 100-200 times faster against ORACLE on simple joining and searching queries.

Orientador: Prof. Dr. Márcio Katsumi Oikawa / Dissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Ciência da Computação, 2016. / No Brasil, há grande variação da prevalência de doenças infecciosas, dentre as quais podemos destacar as hepatites B e C. Um dos fatores que pode in uenciar o tratamento é a realização de um diagnóstico preciso e rápido do genótipo do vírus que ataca o paciente. Esse diagnóstico norteará todos os procedimentos clínicos de tratamento de curto, médio e longo prazo, além de permitir indicar com maior precisão a lista de medicamentos usados pelo paciente e acompanhar historicamente a in uência do tratamento na sua vida cotidiana. Em muitos casos ocorre a resistência da doença a um determinado medicamento, resistência associada à presença de mutações em regiões específicas do DNA. O processo de compreensão da resistência é dinamico e depende de muitas observações e testes, no entanto, pode ser estruturado com regras e expressões representadas pela lógica de primeira ordem, pois esta ultima fornece sentenças abrangentes sob a forma de quantificadores e operações sobre variáveis. Nesse contexto, esse projeto se propõe a implementar uma gramática capaz de interpretar expressõess em lógica de primeira ordem, aplicados a análise de dados biológicos e a diversos contextos semânticos. A gramática foi desenvolvida na linguagem de programação Java, com o auxílio da ferramenta ANTLR e empregada por uma biblioteca, nomeada de BIAR (Biblioteca de Análise de Regras). Na forma de biblioteca, o BIAR, pode ser utilizado sozinho ou acoplado com outros softwares. Na seleção resultados encontramos um estudo de caso sobre sua aplicabilidade para a composição de regras de tratamento usando medicamentos. Desta forma, o BIAR demonstra condições de analisar expressões levando em consideração características clinicas e epidemiol logicas, oferecendo um grau maior de especifcidade para as analises de sequencias, baseado no historico de pacientes de centros hospitalares da cidade de São Paulo. / In Brazil, there is wide variation in infectious diseases prevalence, among which we highlight the hepatitis B and C. One of the factors that may in uence the treatment is to perform an accurate and rapid identication of the virus genotype that infected the patient. This diagnosis will guide all clinical procedures in short, medium and long term treatments, and also allows to state more precisely the list of medicines that will used by the patient and to track the in uence of treatment in their daily lives. In many cases, there may be a disease resistance to a particular drug which is associated to the presence of mutations in specic regions of DNA. The process of understanding the resistance is dynamic and depends on many observations and exams. However, it can be structured with rules and keywords represented by rst-order logic, that provides comprehensive decisions as quantiers of operations on variables. In this context, this project aimed to implement a lexical grammar capable of interpreting expressions in rst-order logic, applied to biological data analysis and dierent semantic contexts. The grammar was developed in Java programming language, with the help of ANTLR tool, and employed by a library named BIAR (Analysis of rules library). In its library format, the BIAR may be used alone or coupled with other softwares. In the Results section, we present a case study about its applicability to the development of procedures in treatments with drugs. Therefore, BIAR demonstrates the abilities to analyze expressions according to clinical and epidemiological characteristics, providing a higher degree of specicity for analysis of sequences, based on the medical histories of patients from hospitals centers in S~ao Paulo city.

The goal of this project is to create a source-to-source compiler which will translate NestStep code to C code. The compiler's job is to replace NestStep constructs with a series of function calls to the NestStep runtime system. NestStep is a parallel programming language extension based on the BSP model. It adds constructs for parallel programming on top of an imperative programming language. For this project, only constructs extending the C language are relevant. The output code will compile to form an executable program that runs on the multicore processor Cell Broadband Engine (Cell BE). The NestStep runtime system has been ported to the Cell BE and is available from start of this project.

ASN.1 is a powerful formal notation divided into two parts, a specification of the data and the data itself in binary form. Creating decoders for these files can often be tedious. The purpose of this degree work is to extend current tools at Arctic Group to make an application that decodes a range of different ASN.1 specifications and data. This should be done during runtime, without needing to rebuild the application for each specification, while generating human-readable data and abstracting unwanted information. Two ways to create ASN.1 decoders were identified, and the application was designed taking heavy inspiration from a solution that stores intermediate data in a list. By not including encoding as a feature of the application a few shortcuts could be made, and the desired result could be achieved during runtime. The application was designed to include three parts. The first part was an ASN.1 parser using the Java-based tool ANTLR4. The second part matched the binary data to the information in the specification. The final part was an output formatter that abstracts and prettifies the output data to text files. The result was an application that parses at least three of the most commonly used specifications of the employer and does only have to be rebuilt when a new data type is present in the specifications. Problems arose when matching the data to the ASN.1 specifications, thus the matching and output formatting was only partially implemented. The application was evaluated by testing many different ASN.1 specifications, making sure everything was generated correctly during runtime and extending the parser to support more syntax as it was introduced in new specifications. Although the application did not support any arbitrary ASN.1 specification, it could serve as a foundation for further development to make the application truly generalized. / ASN.1 är en kraftfull formell notation uppdelad i två delar. En specifikation av data och medföljande data i binär form. Att skapa avkodare till dessa filer kan ofta vara tidskrävande. Syftet med det här examensarbetet är att vidareutveckla nuvarande verktyg på Arctic Group till en applikation som avkodar ett flertal olika ASN.1-specifikationer och data. Detta skall göras under körning och skall inte kräva att applikationen byggs om för varje specifikation. Applikationen skall även generera mänskligt läsbar utdata och abstrahera bort oönskad information. Två sätt att bygga en ASN.1-avkodare hittades under förstudien och applikationen designades med inspiration av en lösning som sparar data i en mellanliggande lista. Genom att inte inkludera kodning av data i applikationen kunde genvägar tas och det önskade resultatet kunde uppnås under körning. Applikationen designades med tre delar. Den första delen var en ASN.1-läsare som använde verktyget ANTLR4 byggt i Java, den andra en del som matchade informationen från specifikationen till den binära datan. Den sista delen var en formaterare för utdata som även abstraherade bort oönskad information. Resultatet blev en applikation som korrekt läser av minst tre av de mest använda ASN.1-specifikationerna hos uppdragsgivaren och som bara behöver byggas om då en ny datatyp introduceras i specifikationerna. Problem uppstod vid matching av data till specifikationen vilket ledde till att matchningen och formateringen blev bara delvis implementerat. Applikationen utvärderades genom att testa många olika ASN.1 specifikationer, kontrollera att allt genererades korrekt under körning och att utöka läsaren efterhand för att kunna hantera mer syntax då den introducerades i de nya specifikationerna. Även om applikationen inte än stödjer godtycklig ASN.1-specifikation kan den verka som en bas för vidareutveckling mot en mer komplett generaliserad lösning.

This master's thesis deals with creating an application for mobile devices with an Android operating system. The main task of this application is interpreting ALLL language commands. This allows any mobile device running this application to be a node of a wireless sensor network. First, well-known principles of wireless sensor networks, agents and ALLL language, which describes the agents in wireless sensor network, are explained in this project. The method for building the application on these bases follows. There are also some examples of agents interpreted by this application at the end.