
Explore a new derivative-based theory and algorithm for nonbacktracking regex matching, supporting anchors and counting while preserving backtracking semantics. Implemented in .NET7 with formal proof of correctness.

Explore a formal operational model for fused execution of contraction languages, covering sparse tensor and relational algebra. Learn about indexed streams and their compiler implementation.

Explore advanced compiler testing techniques for loop optimizations in C++ and data-parallel languages. Learn about YARPGen's reimplementation, static undefined behavior avoidance, and loop code diversity mechanisms.

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 an innovative approach to improve CFL-reachability scalability through graph folding, reducing input size and enhancing performance in program analysis applications like alias and value-flow analysis.

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 a verified monadic interpreter for WebAssembly, its adoption as a fuzzing oracle, and its performance compared to other interpreters and oracles.

Explore a novel type-based verification method for validating coverage in test input generators, enhancing property-based testing with underapproximate reasoning and refinement types.

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

Explore a static analysis approach for high-level quantum programming, focusing on dataflow analysis to detect variables requiring uncomputation for program correctness.

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 an efficient numerical abstract domain for analyzing floating-point programs, supporting conditionals, loops, and elementary functions. Learn about TVPI-FP's innovative use of interval arithmetic in inequalities.

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 SpecTec, a DSL toolchain streamlining WebAssembly specification and feature standardization. Learn how it generates artifacts, detects errors, and aims to revolutionize Wasm standards development.

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.