Extending Automerge: Undo, Redo, and Move Operations - PLF23
Explore advanced techniques for collaborative editing: implement undo/redo functionality and move operations in CRDTs, enhancing real-time document synchronization and user experience.
Termination in Concurrency, Revisited - PPDP23
Explore termination in concurrent programming, comparing type systems for mobile processes and examining session types, weight-based systems, and Curry-Howard correspondence.
Additive Cellular Automata Graded-Monadically
Explore cellular automata through graded comonadic and monadic perspectives, focusing on additive variants and their computational implications.
Strongly-Typed Multi-View Stack-Based Computations
Explore a Domain-Specific Language for stack-based computations, ensuring type correctness and supporting multiple views and mutually recursive functions of arbitrary arities.
Comprehensive Infrastructure as Code Testing - Creed for Speed
Explore ProTI, an automated unit testing approach for Infrastructure as Code programs, enabling rapid prototyping and efficient bug detection in cloud resource configurations.
Totally Live Programming with Hazel - Progress Report
Explore Hazel, a groundbreaking live programming environment with error localization and recovery mechanisms, ensuring well-structured and meaningful code at every stage.
Latte: Lightweight Aliasing Tracking for Java
Explore Latte, a lightweight system for tracking aliasing and uniqueness in Java, minimizing annotations and complexity while supporting destructive reads and practical applications.
All the Binaries Together: A Semantic Approach to Application Binary Interfaces
Explore a semantic approach to Application Binary Interfaces, enhancing interoperability and safety in multi-language systems through realizability models and formalized ABIs.
Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma
Explore formal probabilistic methods for combinatorial structures, focusing on the Lovász Local Lemma and its application to hypergraph coloring in Isabelle/HOL.
Martin-Löf Type Theory Mechanization in Coq
Explore an extensive mechanization of Martin-Löf Type Theory in Coq, covering decidability of conversion and type checking, with a certified executable type checker for MLTT.
Under-approximation for Scalable Bug Detection
Explore under-approximation techniques for efficient bug detection in large codebases. Learn about Incorrectness Logic, ISL, and Pulse-X for scalable, compositional program analysis and memory safety error detection.
PfComp: A Verified Compiler for Packet Filtering Leveraging Binary Decision Diagrams
Explore PfComp, a verified compiler for stateless firewall policies using binary decision diagrams. Learn about its Coq-assisted proof, OCaml extraction, and performance benefits.
Formalizing Giles Gardam's Disproof of Kaplansky's Unit Conjecture
Explore the formalization of Giles Gardam's disproof of Kaplansky's Unit Conjecture using Lean 4, combining deductive proving and verified computation.
UTC Time, Formally Verified - Presentation at CPP 2024
Explore formal verification of UTC time conversions using Coq and MathComp, including leap seconds implementation and refinement techniques for software verification projects.
Retrofitting Null-Safety into Java
Explore Nullsafe, a compiler plugin extending Java's type system with nullness, reducing NullPointerExceptions in production code at Meta through large-scale transformation.
asai: A Library for Compiler Diagnostics
Explore asai, an OCaml library for enhancing compiler diagnostics in proof assistants, improving error messages for end users.
Type Inference for Application Spines in Higher-Order Languages - WITS'24
Explore type inference for application spines in Haskell, covering error messages, impredicative polymorphism, visible type application, and required type arguments.
Solving Constraints During Type Inference - WITS'24
Explore GHC's type inference engine, covering bidirectional inference, implication constraints, level numbers, evidence generation, and quantified constraints in Haskell.
The Evolution of Effects in Functional Programming - From Monads to Higher-Order Effects
Explore the evolution of effectful programming in Haskell, from monads to higher-order effects, examining key milestones and their impact on functional programming paradigms.
Unified Compositional Symbolic Execution - N40AI'24
Explore unified compositional symbolic execution techniques for program analysis, enhancing software reliability and performance optimization.
Trust but Verify: Scaling Deductive Verification with Abstract Interpretation - N40AI'24
Explore scaling deductive verification for smart contracts using abstract interpretation. Learn about pointer analysis algorithms, program simplifications, and challenges in low-level code analysis.