SSA as Freyd Categories - Categorical Semantics for Compiler Design
Explore the connection between Static Single Assignment (SSA) and Freyd categories, examining their graphical syntax and applications in compiler design and optimization.
Compiler Support for Structured Data
Explore compiler techniques for efficiently handling structured data, enhancing performance and optimization in programming languages.
The Sparse Abstract Machine: A Model for Sparse Tensor Algebra on Dataflow Accelerators
Explore the Sparse Abstract Machine (SAM) for targeting sparse tensor algebra to spatial dataflow accelerators, including its streaming dataflow abstraction and compiler implementation.
Tiling for DMA-Based Hardware Accelerators
Explore a compiler pass using polyhedral analysis to optimize loop tiling for DMA-based hardware accelerators, addressing fixed-width transfer limitations.
Sequential Scheduling of Dataflow Graphs for Memory Peak Minimization
Optimize memory peak in sequential scheduling of dataflow graphs. Learn techniques for task and SDF graphs, including transformations and algorithms for improved performance.
Towards Secure MicroPython on Morello - Work in Progress
Explore porting MicroPython to Arm Morello, examining hardware capabilities' impact on embedded runtime security and outlining potential improvements for MicroPython's security.
A Static Analysis for High-Level Quantum Programming Languages
Explore a static analysis approach for high-level quantum programming, focusing on dataflow analysis to detect variables requiring uncomputation for program correctness.
Four Languages for Portability - SPARSE 2024
Explore four languages for achieving software portability across different platforms and architectures in this concise programming talk.
SpEQ: Translation of Sparse Codes Using Equivalences
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.
Extending the Scope of the Array Abstraction beyond Sparsity
Explore advanced array abstraction techniques beyond sparsity, enhancing data structure efficiency and computational performance in programming languages.
Suki: Choreographed Distributed Dataflow in Rust
Explore Suki, a Rust DSL for implementing streaming dataflow with explicit compute placement, enabling fine-grained control and global optimization in distributed systems.
Efficient Static Vulnerability Analysis for JavaScript with Multiversion Dependency Graphs
Explore a novel approach to JavaScript vulnerability detection using Multiversion Dependency Graphs, improving analysis efficiency and accuracy for npm packages.
Compatible Branch Coverage Driven Symbolic Execution for Efficient Bug Finding
Explore a novel symbolic execution technique for efficient bug finding, reducing path explosion through compatible branch coverage and program dependency analysis for faster software testing.
Automated Verification of Fundamental Algebraic Laws - PLDI 2024
Explore automated verification of algebraic laws in coding, crucial for software correctness. Learn about Propel verifier's capabilities in proving properties across various domains.
Floating-Point TVPI Abstract Domain for Numerical Program Analysis
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.
Reducing Static Analysis Unsoundness with Approximate Interpretation
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.
Associated Effects: Flexible Abstractions for Effectful Programming
Explore associated effects, a programming language feature enhancing type classes' flexibility in abstracting over function effects, improving expressive power in type and effect systems.
Bringing the WebAssembly Standard up to Speed with SpecTec
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.
RefinedRust: A Type System for High-Assurance Verification of Rust Programs
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.
Program Reconditioning: Avoiding Undefined Behaviour When Finding and Reducing Compiler Bugs - PLDI 2023
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.
Decidable Subtyping of Existential Types for Julia
Explore Julia's subtyping challenges and a proposed solution for decidability in scientific computing, focusing on method dispatch and type annotations for generic libraries.