A Type System for Safe Intermittent Computing
Explore a novel type system approach for safe intermittent computing in energy-harvesting devices, addressing idempotence requirements and improving programmability for batteryless systems.
Concurrent Mutation Must Go
Explore concurrent mutation challenges and solutions in programming languages, focusing on innovative approaches to enhance system reliability and performance.
Dataflow-Based Optimization for QIR Programs
Explore QDFO, a dataflow-based optimization approach for Microsoft QIR, improving code efficiency and readability through preprocessing and redundancy reduction in quantum computing programs.
A Probabilistic Choreography Language for PRISM
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.
Verifying Quantum Circuits in GAP
Explore quantum circuit verification using GAP, focusing on equivalence checking, ancilla management, and rotational gate validation in the Quantum GAP library.
Continuous Arrays - SPARSE 2024 Workshop
Explore continuous arrays in programming, focusing on their implementation and applications in modern software development.
Exploring Algebraic Placement in Multiparty Languages - CP 2024
Explore the relationship between type systems and placement systems in distributed programming languages, focusing on modular reasoning and algebraic placement structures.
Compiling Probabilistic Programs for Variable Elimination with Information Flow
Explore a novel approach to variable elimination and marginal inference in probabilistic programming, featuring bounded recursion and discrete distributions, with compiler-based optimization techniques.
Wait-Free Weak Reference Counting - ISMM 2023
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.
Automatic Differentiation for Sparse Tensors
Explore efficient automatic differentiation for sparse tensors, leveraging novel DSLs and optimizations to outperform existing frameworks in data-intensive applications.
Specifying Smart Contracts with Hax and ConCert
Explore high-assurance smart contracts using Hax toolchain and ConCert for embedding, specifying security properties, and verification in Rust.
Mostly Automated Proof Repair for Verified Libraries
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.
Formally Verified Samplers from Probabilistic Programs with Loops and Conditioning
Explore Zar: a verified compiler for discrete probabilistic programs, transforming cpGCL to executable samplers. Learn about choice-fix trees, interaction trees, and sampling equidistribution theorem.
Space-Efficient Polymorphic Gradual Typing, Mostly Parametric - PLDI 2024
Explore space-efficient implementation of gradual typing with mostly parametric polymorphism. Learn about λCmp and λSmp calculi, their properties, and the implications for type-preserving translations.
Consolidating Smart Contracts with Behavioral Contracts
Explore ConSol, a Solidity extension enhancing smart contract reliability through behavioral contracts. Learn to express critical conditions, prevent attacks, and improve code robustness and readability.
Testing Specifications in Dafny - Dafny'24
Explore techniques for testing specifications in Dafny, including automatic mutation testing and Spec-Testing Proofs, to enhance trust in formal verification processes.
Generation of Verified Assembly Code Using Dafny and Reinforcement Learning
Explore verified assembly code generation using Dafny and reinforcement learning, combining efficiency with automatic correctness verification for complex programming tasks.
VST-A: A Foundationally Sound Annotation Verifier for Imperative Programs
Explore VST-A, a foundationally sound annotation verifier combining automation with rich assertion language and formal soundness proofs for imperative program verification.
Quantum Computing - Session Preview
Explore quantum computing advancements and their impact on programming languages in this POPL'24 session preview with Oded Padon.
Machine and Automata Learning - Session Preview
Explore cutting-edge research in machine and automata learning at POPL'24, featuring insights from Steven Holtzen on latest advancements and applications.
Synthesis 2 - Session Preview
Explore cutting-edge research in program synthesis with Hila Peleg's preview of the Synthesis 2 session at POPL'24, highlighting recent advancements in the field.