ACER: An AST-based Call Graph Generator Framework

08/29/2023
by   Andrew Chen, et al.
0

We introduce ACER, an AST-based call graph generator framework. ACER leverages tree-sitter to interface with any language. We opted to focus on generators that operate on abstract syntax trees (ASTs) due to their speed and simplicitly in certain scenarios; however, a fully quantified intermediate representation usually provides far better information at the cost of requiring compilation. To evaluate our framework, we created two context-insensitive Java generators and compared them to existing open-source Java generators.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2018

A Simple Java Code Generator for ACL2 Based on a Deep Embedding of ACL2 in Java

AIJ (ACL2 In Java) is a deep embedding in Java of an executable, side-ef...
research
09/13/2017

Deadlock detection of Java Bytecode

This paper presents a technique for deadlock detection of Java programs....
research
01/22/2020

Graph Generators: State of the Art and Open Challenges

The abundance of interconnected data has fueled the design and implement...
research
04/03/2017

Towards a property graph generator for benchmarking

The use of synthetic graph generators is a common practice among graph-o...
research
05/24/2022

A Complex Java Code Generator for ACL2 Based on a Shallow Embedding of ACL2 in Java

This paper describes a code generator that translates ACL2 constructs to...
research
05/17/2020

Multi-Objective level generator generation with Marahel

This paper introduces a new system to design constructive level generato...
research
10/04/2018

Randen - fast backtracking-resistant random generator with AES+Feistel+Reverie

Algorithms that rely on a pseudorandom number generator often lose their...

Please sign up or login with your details

Forgot password? Click here to reset