Results 1 to 10 of about 113,367 (297)
PSIMiner: A Tool for Mining Rich Abstract Syntax Trees from Code [PDF]
2021 IEEE/ACM 18th International Conference on Mining Software Repositories (MSR), 2021 The application of machine learning algorithms to source code has grown in the past years. Since these algorithms are quite sensitive to input data, it is not surprising that researchers experiment with input representations. Nowadays, a popular starting point to represent code is abstract syntax trees (ASTs). Abstract syntax trees have been used for a
Egor Spirin +3 more
+8 more sources
A Generic Framework for Automated Quality Assurance of Software Models –Implementation of an Abstract Syntax Tree [PDF]
, 2014 —Abstract Syntax Tree’s (AST) are used in language tools, such as compilers, language translators and transformers as well as analysers; to remove syntax and are therefore an ideal construct for a language independent tool.
Anderson, Mark, Owens, Darryl
core +4 more sources
A syntax-semantics interface for Tree-Adjoining Grammars through Abstract Categorial Grammars
Journal of Language Modelling, 2018 We present a model of the syntax-semantics interface for Tree-Adjoining Grammars (TAGs). It is based on the encoding of TAGs within the framework of Abstract Categorial Grammars (ACGs).
Sylvain Pogodalla
doaj +3 more sources
Source Code Verification for Embedded Systems using Prolog [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 System relevant embedded software needs to be reliable and, therefore, well tested, especially for aerospace systems. A common technique to verify programs is the analysis of their abstract syntax tree (AST).
Frank Flederer +3 more
doaj +6 more sources
EtWExplorer: Multi-Priority Scheduling Path Exploration Technology Based on Abstract Syntax Tree Analysis [PDF]
Applied Sciences, 2022 Symbolic execution is well known as a dynamic vulnerability discovery technique. Its greatest advantage is the capability to analyze the execution information of the program and to explore the path in the program deterministically.
Xinglu He, Pengfei Wang, Kai Lu, Xu Zhou
doaj +2 more sources
Canonical Abstract Syntax Trees
Electronic Notes in Theoretical Computer Science, 2007 This paper presents Gom, a language for describing abstract syntax trees and generating a Java implementation for those trees. Gom includes features allowing the user to specify and modify the interface of the data structure. These features provide in particular the capability to maintain the internal representation of data in canonical form with ...
Antoine Reilles
openalex +5 more sources
Deep Learning With Customized Abstract Syntax Tree for Bug Localization [PDF]
IEEE Access, 2019 Given a bug report, bug localization technique can help developers automatically locate potential buggy files. Information retrieval and deep learning approaches have been applied in bug localization by extracting lexical features in bug reports and ...
Hongliang Liang +3 more
doaj +3 more sources
Initial Algebra Semantics for Cyclic Sharing Tree Structures [PDF]
Logical Methods in Computer Science, 2010 Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanised reasoning with useful principles such as structural induction and ...
Makoto Hamana
doaj +3 more sources
An Approach of Conformance Verification between Design Models and Code Based on Abstract Syntax Tree [PDF]
MATEC Web of Conferences, 2016 Design models and code are products of different stages in the software development process. The conformance of design models and code plays an important role in software development process, also is a key principle to improve the maintainability of the ...
Liu Zhao, Tian Yang, Yan Haihua
doaj +2 more sources
fAST: Flattening Abstract Syntax Trees for Efficiency [PDF]
2019 IEEE/ACM 41st International Conference on Software Engineering: Companion Proceedings (ICSE-Companion), 2019 Frequently source code analysis tools need to exchange internal representations of abstract syntax trees (AST) with each other. Conveniently, and intuitively, the externalised representations are in the form of hierarchical trees. We argue, counter-intuitively, that hierarchical representation is not the most efficient way for source analysis tools to ...
Yijun Yu
openalex +3 more sources