Stephen Kell

One gyration (in allocsld/chain.c) involves padding `.interp` so we can later clobber it (if 'requested') or else simply later swap `argv[0]` to point to the inferior `ld.so` (if 'invoked'), to...

The n-way comparison of indexers mooted in #67 could be a good experimental addition to a new paper.

A full interprocedural sizeofness analysis, including per-function summaries and a link-time composition step, is a further development that I have sketched out elsewhere.

Here is my sketch. We want to eliminate the need to declare malloc wrappers and the like. (And perhaps even the need to declare suballocators, although that is a bit...

One problem with this is that all functions, even ones that don't have any role in passing sizeof around, would need a summary that is represented at run time. For...

Deeming this fixed; more general instances should be treated as CIL issues.

The pageindex itself should have a bigalloc. But then we'd have to memset a region of the pageindex. The full pageindex for a 47-bit address space and 12-bit pages has...

Feel like the idea is the same binary symlinked in three ways: - liballocs.so: for clients to use by linking -lallocs, and what must be in preload position to have...

Predictably, POSIX shared memory is no better: `shm_unlink()` needs to be called.

Maybe dlopening via the `proc` symlink is the right answer? Currently we close the file descriptor before we `dlopen`, even. This way we would have to hang on to it....