
Explore Propel, a language with a type system for verifying algebraic properties in CRDT implementations. Learn about its case analysis and induction approach for ensuring correctness.

Explore a novel type system approach for safe intermittent computing in energy-harvesting devices, addressing idempotence requirements and improving programmability for batteryless systems.

Explore concurrent mutation challenges and solutions in programming languages, focusing on innovative approaches to enhance system reliability and performance.

Explore offloading-efficient sparse AI systems to optimize performance and resource utilization in artificial intelligence applications.

Explore tools and methods for automating quantum computing tasks, shielding end-users from complex concepts and supporting application development across diverse domains.

Explore QDFO, a dataflow-based optimization approach for Microsoft QIR, improving code efficiency and readability through preprocessing and redundancy reduction in quantum computing programs.

Explore a choreographic framework for modeling and analyzing concurrent probabilistic systems using PRISM. Learn about a new choreography language and its encoding into PRISM for enhanced system reliability.

Explore quantum circuit verification using GAP, focusing on equivalence checking, ancilla management, and rotational gate validation in the Quantum GAP library.

Explore continuous arrays in programming, focusing on their implementation and applications in modern software development.

Explore the relationship between type systems and placement systems in distributed programming languages, focusing on modular reasoning and algebraic placement structures.

Explore a novel approach to variable elimination and marginal inference in probabilistic programming, featuring bounded recursion and discrete distributions, with compiler-based optimization techniques.

Explore neural network models predicting heap allocation properties from static code, examining trade-offs, promising directions, and challenges in this innovative approach to memory management.

Explore a wait-free algorithm for weak reference counting, improving performance in high-contention scenarios. Learn about implementation, correctness proofs, and performance benchmarks for memory management optimization.

Explore efficient automatic differentiation for sparse tensors, leveraging novel DSLs and optimizations to outperform existing frameworks in data-intensive applications.

Explore ISVABI, a software/firmware approach for efficient video analytics using SSD block I/O interface. Learn about its implementation, performance improvements, and real-world applications.

Explore coverage types and their connection to Incorrectness Logic, integrating underapproximate reasoning within refinement type systems for enhanced program analysis and verification.

Explore high-assurance smart contracts using Hax toolchain and ConCert for embedding, specifying security properties, and verification in Rust.

Explore a novel approach to inductive program synthesis using iterative forward-backward abstract interpretation, enhancing search space pruning and improving synthesis efficiency.

Explore a novel automata-based approach for analyzing quantum circuits, enabling efficient verification and bug detection in large-scale quantum systems using tree automata and algebraic representations.

Explore Mosaic, an innovative compiler for sparse tensor algebra that combines external function calls and code fusion, offering flexibility and performance gains in tensor computations.

Explore automated proof repair for higher-order imperative functions, combining dynamic program alignment, enumerative invariant synthesis, and proof-driven testing to maintain verified software efficiently.