There are two "aerated address space" techniques. Both use the same concept but apply it to different pieces of the address space. The name is taken from the concept which is to introduce small void parts (the "air") into the targetted portion of address space.
The aerated code space technique is a technique of loading the code into the memory address space that prevents attackers from trying to scan the code for useful fragments and/or kernel call passwords.
The address space of a process in a typical operating system (and also of a process space in OSHS when the aerated code space technique is not in use) has the code located in one or more flat solid chunks somewhere in the address space like this:
[ Image of a process address space where the code is located in a solid chunk of memory somewhere in the address space. There are two such chunks, one is for the code of the process and the other is for the code of the shared libraries used by the process ]
By contrast the aerated code space technique changes the process address space