
Explore how Rust's type system enhances program synthesis, simplifying specifications and improving performance. Learn about Synthetic Ownership Logic and the RusSOL tool for automatic synthesis of correct Rust programs.

Explore a novel synthesis-based approach for fine-grained batch image processing, combining neural networks and symbolic reasoning to automate object-specific edits within images.

Explore operational game semantics for generative algebraic effects and handlers in a typed call-by-value λ-calculus, focusing on dynamic allocation and first-class effect instances.

Explore a fully abstract normal form bisimulation for call-by-value PCF, combining applicative and environmental bisimulation with game semantics for program equivalence checking.

Explore denotational semantics for Release/Acquire concurrency, focusing on trace semantics and game-like interpretations of program-environment interactions in shared-state languages.

Explore a Coq library for reasoning about variable binding in programming languages using functorial syntax, with insights from development and application across projects.

Explore unified compositional formal methods for program correctness and incorrectness reasoning, focusing on exact separation logic and the Gillian platform.

Explore Crosys, a novel method for dynamic analysis of multi-architectural binaries through intermediate language interpretation and binary rewriting, addressing IoT malware analysis challenges.

Explore ChoRus, a Rust framework for choreographic programming. Learn about endpoint projection and its implementation for distributed systems using library-level techniques.

Explore dynamic predictive analysis for detecting unserializable behaviors in weakly isolated data store applications. Learn about IsoPredict's novel techniques and evaluation results.

Explore Crystalline, a novel family of non-blocking memory reclamation schemes addressing high performance, memory efficiency, and wait-freedom challenges in concurrent programming.

Explore efficient hashing for lambda-terms with context-sensitive alpha-equivalence. Learn about improved algorithms for subterm comparison and structure sharing in mathematical knowledge graphs.

Explore an optimizing compiler for qutrit circuits that improves quantum computations, offering depth reduction and higher fidelity compared to manual implementations and qubit circuits.

Explore a novel program synthesis framework for refactoring code to use library components, featuring a sound equivalence checking technique and applications in functional and numerical computing.

Explore a foundational theory of typed data streams and transformers, covering complex sequential patterns, parallel structure, and programming idioms like punctuation and windowing.

Explore a tensor compiler for efficient fully homomorphic encryption, featuring automatic data packing to simplify programming and optimize performance in large-scale applications like neural networks.

Generate an LLP(q,k) parser for data parallelism and explore its application in creating a high-performance JSON parser.

Explore statically determined memory allocation for flat, immutable arrays in Apple array system, extending liveness analysis for JIT compilers in functional languages.

Explore efficient parallel scans for multi-core CPUs, achieving zero overhead and improved single-threaded performance in array languages.

Explore a novel scheduling strategy for mixing data and task parallelism, preserving data parallelism structure while enabling flexible thread distribution and self-scheduling for improved performance.

Explore rare edge cases and challenges in loop analysis for C programming, enhancing understanding of static analysis tools and improving software verification techniques.