Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Bounds checking"”.

  1. Palloc: parallel dynamic memory allocation

    … Thus, PALLOC2 provide the capabilities of baggy bounds checking with no performance impact. In fact, we find that, for both sequential and parallel programs, PALLOC2's performance is superior to PALLOC1 and to other state-of-the-art allocators including Hoard, DLMalloc, and Streamflow for …

    uiuc Repository record for Palloc: parallel dynamic memory allocation (opens in a new tab)

  2. Practical Mitigations Against Memory Corruption and Transient Execution Attacks

    … protected from leakage and a dynamic tag-based bounds checking mechanism for arrays. We show that sPACtre can defend against these attacks. We evaluate sPACtre on a variety of cryptographic libraries with several cryptographic algorithms, as well as a synthetic benchmark, and show that it is …

    vt Repository record for Practical Mitigations Against Memory Corruption and Transient Execution Attacks (opens in a new tab)

  3. Asynchronous hardware-enforced memory safety

    … for fast, flexible, and secure memory safety checking. First, AHEMS checks memory safety asynchronously to the main processor so that the runtime overhead is very low. Second, AHEMS can be flexibly implemented either in a processor, as a co-processor, or as an external device, depending on the …

    uiuc Repository record for Asynchronous hardware-enforced memory safety (opens in a new tab)