ACM SIGPLAN Courses

A Hoare Logic for Symmetry Properties

1 rating

Discover a novel Hoare-style logic for verifying symmetry properties in imperative programs using group actions, with practical tool SymVerif for formal verification.

• YouTube
• 14 minutes
• Self-Paced
• Free Video

Formal Verification of Probabilistic Deep Reinforcement Learning Policies with Abstract Training

1 rating

Explore a novel approach for quantitatively verifying probabilistic Deep Reinforcement Learning policies through abstract training, addressing challenges in neural network reasoning and state explosion in safety-critical applications.

• YouTube
• 33 minutes
• Self-Paced
• Free Video

Migrating Gradual Types - A Framework for Static and Dynamic Type Migration

Discover how to efficiently migrate between static and dynamic typing in gradual type systems, exploring automated techniques for optimizing type annotations and error handling in programming languages.

• YouTube
• 25 minutes
• Self-Paced
• Free Video

Linear Haskell - Practical Linearity in a Higher-Order Polymorphic Language

Explore the integration of linear type systems in functional programming through a novel approach that maintains backwards compatibility while enabling pure interfaces for mutable data and I/O protocols.

• YouTube
• 25 minutes
• Self-Paced
• Free Video

Program Synthesis Using Abstraction Refinement

Discover a novel approach to program synthesis using abstraction refinement, exploring how abstract semantics and tree automata can significantly improve synthesis efficiency and performance.

• YouTube
• 24 minutes
• Self-Paced
• Free Video

Inference of Static Semantics for Incomplete C Programs

Discover how to analyze and reconstruct incomplete C programs through advanced type inference techniques, enabling better static analysis and stub generation for partial code bases.

• YouTube
• 27 minutes
• Self-Paced
• Free Video

Analytical Modeling of Cache Behavior for Affine Programs

Discover analytical modeling techniques for cache behavior optimization in polyhedral programs, focusing on compile-time solutions for set associative cache hierarchies and program transformation strategies.

• YouTube
• 28 minutes
• Self-Paced
• Free Video

A Principled Approach to Ornamentation in ML

Explore higher-order ornaments in ML programming, focusing on datatype transformations, code refactoring techniques, and theoretical foundations for systematic code adaptation and reuse.

• YouTube
• 25 minutes
• Self-Paced
• Free Video

Parametricity versus the Universal Type - A Study of System F Compilation

Explore the relationship between System F parametricity and universal types, examining why certain compilations fail to preserve contextual equivalence in polymorphic programming languages.

• YouTube
• 26 minutes
• Self-Paced
• Free Video

Handling Fibred Algebraic Effects in Dependent Type Systems

Explore advanced concepts in algebraic computational effects and handlers within dependent type theory, focusing on precise computations and sound program equivalences.

• YouTube
• 26 minutes
• Self-Paced
• Free Video

Optimal Dyck Reachability for Data-Dependence and Alias Analysis

Discover optimal algorithms for Dyck reachability problems with applications in alias and data-dependence analysis, featuring improved complexity bounds and practical implementations for static program analysis.

• YouTube
• 23 minutes
• Self-Paced
• Free Video

Go with the Flow - Compositional Abstractions for Concurrent Data Structures

Explore a novel approach to concurrent data structure verification using flow interfaces, enabling simpler correctness proofs and parametric linearizability for dictionary algorithms.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

Compositional Reasoning and Inference for Weak Isolation in Database Transactions

Explore compositional reasoning and inference techniques for weakly-isolated database transactions, focusing on verification methods and concurrency control mechanisms in modern database systems.

• YouTube
• 23 minutes
• Self-Paced
• Free Video

Jones-Optimal Partial Evaluation by Specialization-Safe Normalization

Delve into advanced partial evaluation techniques through specialization-safe normalization, exploring Jones-optimality, Futamura projections, and type-checked code generation in meta-programming contexts.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

Higher-Order Constrained Horn Clauses for Verification

Explore higher-order constrained Horn clauses and their application in functional program verification, focusing on refinement types and canonical models for automated verification systems.

• YouTube
• 25 minutes
• Self-Paced
• Free Video