Two-tier garbage collection for persistent object

Lee, Dokeun; Won, Youjip; Park, Yongjun; Lee, Seongjin

doi:10.1145/3341105.3373986

Cited by 1 publication

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With this goal in mind, we bring, from the systems community into the software engineering community techniques to create Program Inspection Points, a notion that we define in Section 2. Like in classic garbage collectors for C/C++, [6][7][8][9][10] inspection points impose no overhead on programs unless they need to be inspected; Moreover, like in that line of work, we are willing to accept some imprecision: the inability to distinguish pointers from integers, for instance, might prevent the inspection of some parts of the heap. Yet, in contrast to garbage collectors, we provide the program with the means to associate low-level data-heap and stack allocated memory, for instance-with high-level source-code information: user-defined names and line locations.…”

Section: Contributionsmentioning

confidence: 99%

“…5 They own this qualifier to a weak type system, that neither associates size information with memory regions, nor distinguish pointers from scalars. Although there exist garbage collectors for languages like C or C++, [6][7][8][9][10] such implementations are not mainstream. The more reliable these garbage collectors are, the heavier their overhead.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Automatic inspection of program state in an uncooperative environment

2022

View full text Add to dashboard Cite

The program state is formed by the values that the program manipulates. These values are stored in the stack, in the heap, or in static memory. The ability to inspect the program state 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 so‐called uncooperative environment. In this article, 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 trading precision for performance. In this article, we demonstrate how to use inspection points to debug compiler optimizations; to augment benchmarks with verification code; and to visualize data structures.

show abstract