
Explore robust and modular verification of WebAssembly programs using Iris-Wasm, a mechanized higher-order separation logic for specifying and verifying individual modules with strong isolation guarantees.

Explore novel coverage criteria for generating high-quality conformance tests in programming language implementations, focusing on feature-sensitive and feature-call-path-sensitive approaches.

Explore Flux, a refined type system for Rust that enhances verification of low-level pointer programs. Learn how it combines logical refinements with Rust's ownership mechanisms for efficient and ergonomic type-based verification.

Explore Taype, a novel language for secure multiparty computation that decouples security policies from program logic. Learn about oblivious algebraic data types and tape semantics for flexible, policy-agnostic development.

Explore the connection between Static Single Assignment (SSA) and Freyd categories, examining their graphical syntax and applications in compiler design and optimization.

Explore compiler techniques for efficiently handling structured data, enhancing performance and optimization in programming languages.

Explore the Sparse Abstract Machine (SAM) for targeting sparse tensor algebra to spatial dataflow accelerators, including its streaming dataflow abstraction and compiler implementation.

Explore a compiler pass using polyhedral analysis to optimize loop tiling for DMA-based hardware accelerators, addressing fixed-width transfer limitations.

Explore porting MicroPython to Arm Morello, examining hardware capabilities' impact on embedded runtime security and outlining potential improvements for MicroPython's security.

Explore four languages for achieving software portability across different platforms and architectures in this concise programming talk.

Discover SpEQ, a strategy for detecting semantics in sparse codes and translating to high-performance libraries. Learn about its implementation, evaluation, and performance gains across various backends.

Explore advanced array abstraction techniques beyond sparsity, enhancing data structure efficiency and computational performance in programming languages.

Explore Suki, a Rust DSL for implementing streaming dataflow with explicit compute placement, enabling fine-grained control and global optimization in distributed systems.

Explore a novel approach to JavaScript vulnerability detection using Multiversion Dependency Graphs, improving analysis efficiency and accuracy for npm packages.

Explore automated verification of algebraic laws in coding, crucial for software correctness. Learn about Propel verifier's capabilities in proving properties across various domains.

Explore a novel dynamic analysis technique for JavaScript that improves static analysis accuracy, particularly for dynamic property accesses, enhancing call graph construction and analysis recall.

Explore associated effects, a programming language feature enhancing type classes' flexibility in abstracting over function effects, improving expressive power in type and effect systems.

Explore RefinedRust, a novel type system for verifying both safe and unsafe Rust code. Learn about its implementation, evaluation, and potential impact on high-assurance software development.

Explore program reconditioning to avoid undefined behavior in compiler bug detection and reduction for GLSL and WGSL languages, enhancing differential testing and test-case simplification.

Explore Julia's subtyping challenges and a proposed solution for decidability in scientific computing, focusing on method dispatch and type annotations for generic libraries.

Explore a novel programming language approach to explainable graph learning, addressing limitations in GNN explainability through a graph description language and interpretable classification model.