EC publishes study on Next Generation Internet 2025 2018/10/05

Bob Goudriaan successor of Marc Gauw 2017/10/12

NLnet Labs' Jaap Akkerhuis inducted in Internet Hall of Fame 2017/09/19

NLnet and Gartner to write vision for EC's Next Generation Internet initiative 2017/04/12

Dutch Ministry of Economic Affairs donates 0.5 million to "Internet Hardening Fund" 2016/12/16

Vietsch Foundation and NLnet cooperate in internet R&D for research and education 2016/09/28


ELF Linking

[Making ELF insightful]

The Executable and Linkable Format is a common standard file format for executable files, object code, shared libraries, and core dumps. Understanding dynamic links is important but hard without the proper tools. This is a problem, because the actual details can have significant technical and legal implications.

First published in the specification for the application binary interface (ABI) of the Unix operating system version named System V Release 4 (SVR4),[2] and later in the Tool Interface Standard, ELF is now the most common binary file format for Unix and Unix-like systems on x86 processors. There are some existing tools to generate ELF graphs, which are used by for instance lawyers interested in finding out if programs really can be considered derivative works, but also by engineers trying to find defects (bloat, build system configuration errors).

One thing that is missing is "search", which would allow for answering questions like "which programs use this particular library" or "which symbols from a particular library are actually used by programs", which could be very relevant in a software engineering context (to discover if it is safe to remove libraries, or replace them with equivalent libraries, or to lift parts of a library into separate libraries to decrease bloat). This project will leverage existing tools, such as radare2 (ELF analysis) and Neo4j (graph database), add missing functionality in order to create a better set of analytical tools.

The project is led by Armijn Hemel.


Send in your ideas.
Deadline Feb 1st, 2018.


Last update: 2017/08/01