scholarly journals Efficient tree-traversals: reconciling parallelism and dense data representations

2021 ◽  
Vol 5 (ICFP) ◽  
pp. 1-29
Author(s):  
Chaitanya Koparkar ◽  
Mike Rainey ◽  
Michael Vollmer ◽  
Milind Kulkarni ◽  
Ryan R. Newton
Keyword(s):  
Constant Factor ◽  
Abstract Syntax ◽  
Sequential Programs ◽  
Abstract Syntax Tree ◽  
Data Formats ◽  
Parallel Performance ◽  
Data Representations ◽  
Memory Representations ◽  
Tree Traversals ◽  
Dense Data

Recent work showed that compiling functional programs to use dense, serialized memory representations for recursive algebraic datatypes can yield significant constant-factor speedups for sequential programs. But serializing data in a maximally dense format consequently serializes the processing of that data, yielding a tension between density and parallelism. This paper shows that a disciplined, practical compromise is possible. We present Parallel Gibbon, a compiler that obtains the benefits of dense data formats and parallelism. We formalize the semantics of the parallel location calculus underpinning this novel implementation strategy, and show that it is type-safe. Parallel Gibbon exceeds the parallel performance of existing compilers for purely functional programs that use recursive algebraic datatypes, including, notably, abstract-syntax-tree traversals as in compilers.

scholarly journals Adabot: Fault-Tolerant Java Decompiler (Student Abstract)

2020 ◽  
Vol 34 (10) ◽  
pp. 13861-13862
Author(s):  
Zhiming Li ◽  
Qing Wu ◽  
Kun Qian
Keyword(s):  
Reverse Engineering ◽  
Machine Translation ◽  
Fault Tolerant ◽  
Safety Concern ◽  
Statistical Machine Translation ◽  
Abstract Syntax ◽  
Rule Based ◽  
Abstract Syntax Tree ◽  
Important Field ◽  
Internal Architecture

Reverse Engineering has been an extremely important field in software engineering, it helps us to better understand and analyze the internal architecture and interrealtions of executables. Classical Java reverse engineering task includes disassembly and decompilation. Traditional Abstract Syntax Tree (AST) based disassemblers and decompilers are strictly rule defined and thus highly fault intolerant when bytecode obfuscation were introduced for safety concern. In this work, we view decompilation as a statistical machine translation task and propose a decompilation framework which is fully based on self-attention mechanism. Through better adaption to the linguistic uniqueness of bytecode, our model fully outperforms rule-based models and previous works based on recurrence mechanism.

scholarly journals Multi-purpose Syntax Definition with SDF3

2020 ◽  
pp. 1-23 ◽  
Author(s):  
Luís Eduardo de Souza Amorim ◽  
Eelco Visser
Keyword(s):  
Error Recovery ◽  
Abstract Syntax ◽  
Abstract Syntax Tree ◽  
Syntax Tree ◽  
Full Class ◽  
High Level ◽  
Modular Composition ◽  
Tree Representations ◽  
Context Free ◽  
Context Free Grammars

Abstract SDF3 is a syntax definition formalism that extends plain context-free grammars with features such as constructor declarations, declarative disambiguation rules, character-level grammars, permissive syntax, layout constraints, formatting templates, placeholder syntax, and modular composition. These features support the multi-purpose interpretation of syntax definitions, including derivation of type schemas for abstract syntax tree representations, scannerless generalized parsing of the full class of context-free grammars, error recovery, layout-sensitive parsing, parenthesization and formatting, and syntactic completion. This paper gives a high level overview of SDF3 by means of examples and provides a guide to the literature for further details.

scholarly journals WASTK: A Weighted Abstract Syntax Tree Kernel Method for Source Code Plagiarism Detection

2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Deqiang Fu ◽  
Yanyan Xu ◽  
Haoran Yu ◽  
Boyang Yang
Keyword(s):  
Kernel Method ◽  
Source Code ◽  
Detection Methods ◽  
Abstract Syntax ◽  
Plagiarism Detection ◽  
Abstract Syntax Tree ◽  
Syntax Tree ◽  
Tree Kernel ◽  
Document Frequency ◽  
Abstract Syntax Trees

In this paper, we introduce a source code plagiarism detection method, named WASTK (Weighted Abstract Syntax Tree Kernel), for computer science education. Different from other plagiarism detection methods, WASTK takes some aspects other than the similarity between programs into account. WASTK firstly transfers the source code of a program to an abstract syntax tree and then gets the similarity by calculating the tree kernel of two abstract syntax trees. To avoid misjudgment caused by trivial code snippets or frameworks given by instructors, an idea similar to TF-IDF (Term Frequency-Inverse Document Frequency) in the field of information retrieval is applied. Each node in an abstract syntax tree is assigned a weight by TF-IDF. WASTK is evaluated on different datasets and, as a result, performs much better than other popular methods like Sim and JPlag.

scholarly journals Abstract Syntax Tree Based Source Code Antiplagiarism System for Large Projects Set

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 175347-175359
Author(s):  
Michal Duracik ◽  
Patrik Hrkut ◽  
Emil Krsak ◽  
Stefan Toth
Keyword(s):  
Source Code ◽  
Abstract Syntax ◽  
Abstract Syntax Tree ◽  
Syntax Tree
Sign in / Sign up

Export Citation Format

Share Document