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.
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.
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.
What We Learned from C++ Atomics and Memory Model Standardization
Explore insights from C++ atomics and memory model standardization, covering usage patterns, performance implications, implementation challenges, and lessons learned in language design.
Reasoning via Semantic Transformations
Explore semantic transformations in reasoning processes, examining their role and impact on logical analysis and problem-solving techniques.
Efficient Matching of Regular Expressions with Lookaround Assertions
Explore efficient matching of regular expressions with lookaround assertions, including formal semantics, simplification properties, and a new O(m·n) algorithm using oracle-NFAs for improved performance.
Polymorphic Type Inference for Dynamic Languages
Explore a novel type system combining polymorphism, intersection types, and subtyping for dynamic languages. Learn about type reconstruction algorithms and their applications in advanced programming.
When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism
Explore a novel type inference approach for first-class polymorphism using multi-bounded polymorphism, advancing the state of the art in type inference for programming languages.
Monotonicity and the Precision of Program Analysis
Explore the connection between program monotonicity and analysis precision. Learn how monotone behavior enables complete abstract interpretation for numeric invariant inference.
Capturing Types: A Calculus for Tracking Free Variables in Type Systems
Explore a calculus representing captured variables in types for enhanced safety, enabling effect implementation via scoped capabilities and guiding practical capture checking in programming languages.
Implementation and Synthesis of Math Library Functions
Explore MegaLibm, a domain-specific language for implementing, testing, and tuning math library functions. Learn how it enhances safety, modularity, and tunability in mathematical software development.
Automatic Parallelism Management - POPL 2024
Explore techniques for automatic parallelism management in high-level languages, combining static and runtime approaches to optimize performance without manual tuning.
Binding Syntax for Dependently-Typed Programs - WITS'24
Explore innovative binding syntax for dependently-typed programs, enhancing ergonomics while maintaining fixed grammar for improved error messaging.
Toward a Live, Rich, Composable, and Collaborative Planetary Compute Engine
Explore Planet Hazel, a visionary programming environment for collaborative planetary computing to address climate crisis challenges across diverse stakeholders.
Conflict-Driven Synthesis for Layout Engines
Explore Medea, a framework for automatically generating efficient and correct incremental layout engines, addressing challenges in web browser development and improving performance.
Probabilistic Programming with Stochastic Probabilities
Explore a novel approach to probabilistic programming languages using stochastic probability estimation, enabling unrestricted stochastic control flow and programmable inference with custom proposals.
Proving and Disproving Equivalence of Functional Programming Assignments
Explore an automated approach for verifying programming assignments using equivalence checking, functional induction, and clustering algorithms. Learn how to prove correctness and provide counterexamples efficiently.