Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 36 for “"abstract syntax"”.

  1. Categorical models of second-order abstract syntax

    … offer powerful, reusable tools for working with syntax – such as type-preserving simultaneous substitution and compositional semantics via initial algebras. However, their practical impact on formal verification has been limited, due to their categorical sophistication and the challenges of …

    cambridge Repository record for Categorical models of second-order abstract syntax (opens in a new tab)

  2. Compiling Haskell into Lean: A Common Abstract Syntax for Haskell and Interactive Theorem Provers

    … produces an AST that serves as a common level of abstraction between a fragment of Haskell and Lean. The abstract common fragment promotes translation between languages by simplifying and restructuring GHC's original AST, improving the readability and linearization of the AST.</p> <p>Future work …

    chapman Repository record for Compiling Haskell into Lean: A Common Abstract Syntax for Haskell and Interactive Theorem Provers (opens in a new tab)

  3. Reasoning Using Higher-Order Abstract Syntax in a Higher-Order Logic Proof Environment: Improvements to Hybrid and a Case Study

    … about formal systems using higher-order abstract syntax (HOAS). We modify Hybrid's type of terms, which is built definitionally in terms of de Bruijn indices, to exclude at the type level terms with `dangling' indices. We strengthen the injectivity property for Hybrid's variable-binding …

    ottawa-retro Repository record for Reasoning Using Higher-Order Abstract Syntax in a Higher-Order Logic Proof Environment: Improvements to Hybrid and a Case Study (opens in a new tab)

  4. Optimizations in Distributed Run -Time Compilation

    … and present a rewriting system for Java abstract syntax trees designed to optimize the code generators. This general-purpose optimizer exploits the compositional nature of Jumbo to aggressively optimize the code generators for the individual code fragments.

    uiuc Repository record for Optimizations in Distributed Run -Time Compilation (opens in a new tab)

  5. Measuring Incrementally Developed Model Transformations Using Change Metrics

    … defines a set of change metrics based on an abstract syntax difference model. Language feature metrics are also defined for both transformation languages. A process for extracting model-based change metrics and language metrics from the abstract syntax of the transformation languages is …

    queens Repository record for Measuring Incrementally Developed Model Transformations Using Change Metrics (opens in a new tab)

  6. An Empirical study of the JaMoPP project using code coverage based system tests.

    … to look at how much of the project‟s grammar and abstract syntax tree are being used during the process of transforming Java source code into Java models. A look will then be taken at the coverage results to see if a correlation exists between the grammar and the abstract syntax tree results. …

    maynooth Repository record for An Empirical study of the JaMoPP project using code coverage based system tests. (opens in a new tab)

  7. Treemacs: An extensible tree editor

    … document trees, transformation trees, outlines, abstract syntax trees, and high-level program development trees.

    uiuc Repository record for Treemacs: An extensible tree editor (opens in a new tab)

  8. Constructive synthesis of optimized cryptographic primitives

    … integers in Parametric Higher-Order Abstract Syntax. This was part of a larger project, Fiat-crypto, which seeks to produce formally verified machine-code implementations of Elliptic Curve Cryptography. My implementation outputs Qhasm, a high-level assembly language developed for the …

    mit Repository record for Constructive synthesis of optimized cryptographic primitives (opens in a new tab)

  9. Contributions to the theory of syntax with bindings and to process algebra

    "We develop a theory of syntax with bindings, focusing on: - methodological issues concerning the convenient representation of syntax; - techniques for recursive definitions and inductive reasoning. Our approach consists of a combination of FOAS (First-Order Abstract Syntax) and HOAS (Higher-Order …

    uiuc Repository record for Contributions to the theory of syntax with bindings and to process algebra (opens in a new tab)

  10. Utility Libraries for Traversing and Manipulating Tree-like Data Structures with Varying Schemas

    … example of one of these structures is an abstract syntax tree (AST). However, the lack of good libraries to handle trees has led to many developers and large-scale code bases having to implement their utility functions over and over again. To address these concerns within the JavaScript …

    mit Repository record for Utility Libraries for Traversing and Manipulating Tree-like Data Structures with Varying Schemas (opens in a new tab)

  11. Source to source compiler for the automatic parallelization of JavaScript code

    … compiler transforms the input code to an AST (Abstract syntax tree). Afterward, we applied a dependence analysis, followed by fusion and fission techniques. As a later part, new portions of code are inserted to parallelize specific sections of the original program. From the modified AST …

    lima Repository record for Source to source compiler for the automatic parallelization of JavaScript code (opens in a new tab)

  12. OODSF: an object-oriented data specification framework in a heterogeneous computing environment

    … commonly used specification languages, such as Abstract Syntax Notation 1 (ASN.l) and Interface Definition Language (IDL), can be defined. The OODSF defines C++ class libraries for ASN.l and IDL to simplify the C++ language bindings. Arbitrary application-level IDL and ASN.l specifications can …

    vt Repository record for OODSF: an object-oriented data specification framework in a heterogeneous computing environment (opens in a new tab)

  13. Investigating representations of obfuscated malicious PowerShell

    … obfuscations. This work seeks to find a more abstract representation of script functionality using Abstract Syntax Trees so that an unseen obfuscated script can be detected if a related script is already known malware. We determine that simple AST based features such as node count and depth …

    mit Repository record for Investigating representations of obfuscated malicious PowerShell (opens in a new tab)

  14. Concordia parallel C : design and implementation

    … and library development, simulated execution, syntax/semantics/performance debugging, and simulation of various multiprocessors and multicomputers. A Parallel program written in CPC will be compiled by CPCC into a virtual code version, then interpreted by Concordia Parallel Systems Simulator …

    concordia Repository record for Concordia parallel C : design and implementation (opens in a new tab)

  15. The Design and Implementation of a Prolog Parser Using Javacc

    … is provided. The output of the parser is an “Abstract Syntax Tree” that reflects the correct precedence and associativity rules among the various operators (static and dynamic) of the language. Empirical results are provided that show that a Prolog parser that is generated by the parser …

    unt Repository record for The Design and Implementation of a Prolog Parser Using Javacc (opens in a new tab)

  16. A Code Structure Visualization Tool for Groovy

    … code structure of a program is represented by an Abstract Syntax Tree (AST). A language like Groovy provides easy way to tap into that structure. Furthermore, features like metaprogramming can help to easily decipher the structural information. That makes Groovy a natural choice for creating such …

    houston Repository record for A Code Structure Visualization Tool for Groovy (opens in a new tab)

  17. Online Processing of Wh-Dependencies in English by Native Speakers of Spanish

    … `shallow processors' who do not have access to abstract syntax during parsing is too strong.

    ku Repository record for Online Processing of Wh-Dependencies in English by Native Speakers of Spanish (opens in a new tab)

  18. Concurrent protocol data unit encoding/decoding : algorithms, architectures and performance evaluation

    … implementation, and performance evaluation of an Abstract Syntax Notation-One (ASN.1) encoder/decoder used in Open System Interconnection (OSI) implementations.

    concordia Repository record for Concurrent protocol data unit encoding/decoding : algorithms, architectures and performance evaluation (opens in a new tab)

  19. μJUNITER: Automated Unification of Microservices into Modular Monoliths for Versatile Software Architecture Migration

    … equivalent monolith. Our refactoring relies on abstract syntax tree merging and control flow bridging to unite distributed components into a centralized system. We have implemented our approach as μJUNITER, an automated refactoring tool that operates on Java source files of Spring Boot …

    vt Repository record for μJUNITER: Automated Unification of Microservices into Modular Monoliths for Versatile Software Architecture Migration (opens in a new tab)

  20. Reachability Analysis of RTL Circuits Using k-Induction Bounded Model Checking and Test Vector Compaction

    … for the subsequent cycles without traversing the abstract syntax tree of the entire design. To reduce the approximation on the induction step, an addition of signal domain constraints is proposed. Moreover, we present the technique for splitting up the property in question to get a better model of …

    vt Repository record for Reachability Analysis of RTL Circuits Using k-Induction Bounded Model Checking and Test Vector Compaction (opens in a new tab)

Page 1 of 2