Centering Humans in the Programming Languages Classroom: Building a Text for the Next Generation
Explore principles for designing inclusive programming language textbooks, focusing on human-centered approaches and interdisciplinary applications in computer science education.
MVC, MVCC and Causal Trees in CRDT Systems - Lecture 23
Explore MVC, MVCC, and Causal Trees in CRDT systems, focusing on techniques to organize inner workings while maximizing benefits and minimizing disruption to established practices.
Typed Equivalence of Labeled Effect Handlers and Labeled Delimited Control Operators
Explore the equivalence between labeled effect handlers and labeled delimited control operators in computational effects, with insights on their expressive power and practical applications.
Ansible Is Turing Complete
Explore Ansible's unexpected Turing completeness through core language features. Discover how this configuration management tool achieves computational universality without relying on external languages or plugins.
Applying Large Scale Diffing to Declarative Configuration Code for Production Safety
Explore large-scale diffing for declarative configuration code to enhance production safety, addressing unintended consequences and testing challenges in config changes.
Exploratory Study on Multi-User Program Synthesis - A Multi-Wizard Approach
Explore multi-user program synthesis through a design experiment, investigating collaborative potential and effectiveness in software engineering and related domains.
CLOVER: Closed-Loop Verifiable Code Generation - Dafny'24
Explore CLOVER, a paradigm for ensuring correctness in AI-generated code through consistency checking among code, docstrings, and formal annotations using verification tools and language models.
Computational-Bounded Robust Compilation and Universally Composable Security
Explore computational-bounded robust compilation and its connection to universally composable security. Extend techniques to computational UC security and generalize beyond to arbitrary equalities.
Modularizing CPU Semantics for Virtualization
Explore modularization of CPU semantics for efficient virtualization, focusing on simplifying VMM implementation and verification while addressing challenges in hardware-assisted virtualization.
Towards Modular Specification and Verification of Concurrent Hypervisor-based Isolation
Explore modular specification and verification of NOVA microhypervisor using concurrent separation logic. Discover challenges in formally verifying concurrent systems for enhanced virtualization and isolation.
Is Peter Correct or Incorrect? - O'HearnFest Lecture
Explore Patrick Cousot's analysis of Peter O'Hearn's work in program verification and reasoning, examining correctness and potential inaccuracies in his theories.
Symbolic Execution with Separating Decision Diagrams
Explore symbolic execution techniques using Separating Decision Diagrams in this advanced computer science talk by Josh Berdine.
Bi-abductive Adversarial Program Synthesis
Explore bi-abductive adversarial program synthesis techniques in this advanced computer science talk by Julien Vanegue.
Massive Proofs for the Masses
Explore massive proofs and their applications in computer science with Byron Cook's insightful presentation on cutting-edge verification techniques.
Peter, the May and the Must, and Lacework
Explore Peter O'Hearn's contributions to program analysis and verification, focusing on the "may" and "must" concepts and Lacework's impact.
Working with Peter O'Hearn in Academia and Industry
Explore Mark Harman's experiences collaborating with Peter O'Hearn across academic and industrial settings, gaining insights into their influential work.
The Last Yard: Foundational End-to-End Verification of High-Speed Cryptography
Explore foundational end-to-end verification of high-speed cryptography, connecting Hacspec, Jasmin, and SSProve tools using Coq. Demonstrates approach with AES implementation proof.
Memory Simulations, Security and Optimization in a Verified Compiler
Explore memory simulations, security features, and optimizations in verified compilers. Gain insights into pointer allocations, stack canaries, and tail recursion elimination in CompCert.
Lean Formalization of Extended Regular Expression Matching with Lookarounds
Explore a formalized matching algorithm for extended regular expressions using Lean 4, covering intersection, complement, and lookarounds in symbolic derivatives and locations.
On the Need for Available, Functional, and Reusable Memory Models
Explore challenges in memory model research through personal failure stories, highlighting shortcomings and future expectations for the field.
Why Languages Should Preserve Load-Store Order
Explore the complexities of memory models and load-store reordering in programming languages, examining their impact on code optimization and reasoning.