2 citations · 2 across the 4 of their papers we have counts for
4 papers
A Calculus for Unreachable Code
Peter Zhong, Shu-Hung You, Simone Campanoni +3
In Racket, the LLVM IR, Rust, and other modern languages, programmers and static analyses can hint, with special annotations, that certain parts of a program are unreachable. Same…
CAMP: Compiler and Allocator-based Heap Memory Protection
Zhenpeng Lin, Zheng Yu, Ziyi Guo +3
The heap is a critical and widely used component of many applications. Due to its dynamic nature, combined with the complexity of heap management algorithms, it is also a frequent…
The Parallel Semantics Program Dependence Graph
Brian Homerding, Atmn Patel, Enrico Armenio Deiana +6
A compiler's intermediate representation (IR) defines a program's execution plan by encoding its instructions and their relative order. Compiler optimizations aim to replace a give…
PROMPT: A Fast and Extensible Memory Profiling Framework
Ziyang Xu, Yebin Chon, Yian Su +4
Memory profiling captures programs' dynamic memory behavior, assisting programmers in debugging, tuning, and enabling advanced compiler optimizations like speculation-based automat…