Essays about: "Abstract Syntax Trees"

Showing result 1 - 5 of 15 essays containing the words Abstract Syntax Trees.

  1. 1. A Linter for Static Analysis of MiniZinc Models

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Erik Rimskog; [2021]
    Keywords : linter MiniZinc combinatorial optimisation static analysis models;

    Abstract : MiniZinc is a modelling language for constraint satisfaction and optimisation problems. It can be used to solve difficult problems by declaratively modelling them and giving them to a generic solver. A linter, a tool for static analysis, is implemented for MiniZinc to provide analysis for improving models. READ MORE

  3. 2. Implementation and Evaluation of an Emulated Permission System for VS Code Extensions using Abstract Syntax Trees

    University essay from Linköpings universitet/Programvara och system

    Author : Åström David; [2021]
    Keywords : Visual Studio Code; Extensions; Permissions; Static Analysis; Abstract Syntax Trees;

    Abstract : Permission systems are a common security feature in browser extensions and mobile applications to limit their access to resources outside their own process. IDEs such as Visual Studio Code, however, have no such features implemented, and therefore leave extensions with full user permissions. READ MORE

  4. 3. Trees that Grow in the Paragon Compiler A Step Towards Modularity

    University essay from Göteborgs universitet/Institutionen för data- och informationsteknik

    Author : John Andersson; Anders Berggren Sjöblom; Anders Bäckelie; Johannes Ljung Ekeroth; Lukas Skystedt; Lina Terner; [2020-10-30]
    Keywords : ;

    Abstract : Paragon is a programming language that extends Java with statically checked information flow control policies. Paragon’s compiler, which is written in Haskell, has a large type checker. Its current implementation is monolithic, making the compiler challenging to develop. Paragon’s authors, Broberg et al. READ MORE

  5. 4. Spork : Move-enabled structured merge for Java with GumTree and 3DM

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Simon Larsén; [2020]
    Keywords : ;

    Abstract : With software development becoming an increasingly parallel process in which branching lines of development is common, the shortcomings of unstructured merge techniques are becoming more tangible. In particular, merge conflicts occur frequently and often unnecessarily. READ MORE

  6. 5. Test Case Dependency Detection Using Syntactic Analysis of Code for Test Optimization Purposes

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Rouwayd Hanna; [2020]
    Keywords : ;

    Abstract : It is not possible to develop high quality software for large systems without a rigorous testing process. However, testing tends to be costly and time consuming, which is why research in test optimization has received a great deal of attention. READ MORE