Javascript must be enabled to continue!
CWAMR: Reimagining A Capability based Webassembly Runtime Via Cheri-Based Compartmentalization
View through CrossRef
WebAssembly (WASM) provides a language-neutral execution format widely deployed for cloud, edge, and embedded workloads. Its linear memory model and software-level sandboxing afford portability and a baseline of spatial isolation, yet they rely on dynamic bounds checks and page-based protections that incur overhead and remain susceptible to violations under speculative and out-of-order execution. Prior efforts to secure WASM for untrusted workloads frequently embed it within Trusted Execution Environments (TEEs) such as Intel SGX, introducing attestation, enclave management complexity, and exposure to shared-cache side channels, while still lacking hardware-enforced pointer provenance and bounds.
Academy & Industry Research Collaboration
Title: CWAMR: Reimagining A Capability based Webassembly Runtime Via Cheri-Based Compartmentalization
Description:
WebAssembly (WASM) provides a language-neutral execution format widely deployed for cloud, edge, and embedded workloads.
Its linear memory model and software-level sandboxing afford portability and a baseline of spatial isolation, yet they rely on dynamic bounds checks and page-based protections that incur overhead and remain susceptible to violations under speculative and out-of-order execution.
Prior efforts to secure WASM for untrusted workloads frequently embed it within Trusted Execution Environments (TEEs) such as Intel SGX, introducing attestation, enclave management complexity, and exposure to shared-cache side channels, while still lacking hardware-enforced pointer provenance and bounds.
Related Results
CWAMR: REIMAGINING A CAPABILITYBASED WEBASSEMBLY RUNTIME VIA CHERI-BASED COMPARTMENTALIZATION
CWAMR: REIMAGINING A CAPABILITYBASED WEBASSEMBLY RUNTIME VIA CHERI-BASED COMPARTMENTALIZATION
WebAssembly (WASM) provides a language-neutral execution format widely deployed for cloud, edge, and embedded workloads. Its linear memory model and software-level sandboxing affor...
Ada runtime environment working group—a framework for describing Ada runtime environment
Ada runtime environment working group—a framework for describing Ada runtime environment
The concept of a runtime environment to support program execution has always been associated with application software - it has only been with programming languages like Ada that t...
Runtime Verification on Robotics Systems
Runtime Verification on Robotics Systems
Runtime verification is a technique for generating monitors from formal specification of expected behaviors for the underlying system. It can be applied to automatically evaluate s...
Reviews Film
Reviews Film
Abstract
The Age of Shadows (2016) South Korea Director Jee-woon Kim Runtime 140 minutes
Backpack Full of Cash (2016) USA Director Sarah Mondale Runti...
COCOA: A Framework for Fine-scale Mapping Cell-type-specific Chromatin Compartmentalization Using Epigenomic Information
COCOA: A Framework for Fine-scale Mapping Cell-type-specific Chromatin Compartmentalization Using Epigenomic Information
Abstract
Chromatin compartmentalization and epigenomic modification are crucial factors in cell differentiation and diseases development. However...
Logistics capability, logistics outsourcing and firm performance in an e‐commerce market
Logistics capability, logistics outsourcing and firm performance in an e‐commerce market
PurposeEffective and efficient supply chain management is critical to the success of firms engaging in e‐commerce. The purpose of this paper is to examine the impact of logistics c...
Enhancement of Rabin-Karp Algorithmusing XOR Filter
Enhancement of Rabin-Karp Algorithmusing XOR Filter
Purpose–Thestudy aims to enhance the Rabin-Karp Algorithm that underlinesthe problem encountered wherein the algorithm’s runtimeperformanceis affected due tothe continuous rap...
An Optimised Hoffman Algorithm for Testing Linear Code Equivalency
An Optimised Hoffman Algorithm for Testing Linear Code Equivalency
The Hoffman’s algorithm to test equivalency of linear codes is one of the techniques that have been used over the years; it is achieved by a comparison of codewords of the linear c...

