CGO 2021
Sat 27 February - Wed 3 March 2021
Tue 2 Mar 2021 12:40 - 12:50 - CGO Student Research Competition

The program state is formed by the values that the program manipulate. These values are stored in the stack, in the heap, or in statically allocated memory. The ability to inspect all these values is useful as a debugging or as a verification aid. Yet, there exists no general technique to insert inspection points in type-unsafe languages such as C or C++. The difficulty comes from the need to traverse the memory graph in a also-called uncooperative environment. In this paper, we propose an automatic technique to deal with this problem. We introduce a static code transformation approach that inserts in a program the instrumentation necessary to report its internal state. Our technique has been implemented in LLVM. It is possible to adjust the granularity of inspection points in terms of breath and depth. The former dimension defines where they are inserted in the program; the latter, which memory regions they track. The evaluation performed in this paper indicates that they are efficient when used sparingly, and add a minimum performance overhead in the programs.

Tue 2 Mar

Displayed time zone: Eastern Time (US & Canada) change

12:30 - 14:30
CGO Student Research CompetitionMain Conference / Student Research Competition
12:30
10m
Talk
A New Memory Layout for Self-Rebalancing Trees
Student Research Competition
Paul Iannetta ENS Lyon
12:40
10m
Talk
Automatic Inspection of Program State for Debugging and Verification Purposes
Student Research Competition
José Wesley de Souza Magalhães Federal University of Minas Gerais
12:50
10m
Talk
Compiler Framework for Low Overhead Fork-Join Parallelism
Student Research Competition
13:00
10m
Talk
Data vs. Instructions: Runtime Code Generation for Convolutions
Student Research Competition
Malith Jayaweera Northeastern University
13:10
10m
Talk
Fast Structural Register Allocation
Student Research Competition
William Zhang Carnegie Mellon University, Pranav Kumar Carnegie Mellon University
13:20
10m
Talk
Fine Grained Control of Program Transformations via Strategic Rewriting in MLIR
Student Research Competition
Martin Lücke University of Edinburgh
13:30
10m
Talk
Towards an Exploration Tool for Program Optimization Using Heuristic Search Algorithms
Student Research Competition
Johannes Lenfers University of Münster
13:40
10m
Talk
When Binary Optimization Meets Static Profiling
Student Research Competition
Angelica Aparecida Moreira Universidade Federal de Minas Gerais