ACM SIGPLAN Courses

Positive Almost-Sure Termination: Complexity and Proof Rules

Explore complexity and proof rules for Positive Almost-Sure Termination in probabilistic programming, including recursion-theoretic analysis and novel proof techniques using transfinite ordinals.

• YouTube
• 19 minutes
• On-Demand
• Free Video

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.

• YouTube
• 19 minutes
• On-Demand
• Free Video

Validation of Modern JSON Schema: Formalization and Complexity

Explore the formalization and complexity of Modern JSON Schema validation, uncovering surprising PSPACE-completeness and its implications for data processing efficiency.

• YouTube
• 19 minutes
• On-Demand
• Free Video

Finding Infinite Counter-Models in Deductive Verification

Explore innovative techniques for finding infinite counter-models in deductive verification, enhancing automated solvers' capabilities and providing valuable insights for verification failures.

• YouTube
• 19 minutes
• On-Demand
• Free Video

Quantum Computing - Session Preview

Explore quantum computing advancements and their impact on programming languages in this POPL'24 session preview with Oded Padon.

• YouTube
• 11 minutes
• On-Demand
• Free Video

Program Analysis: Session Preview

Explore cutting-edge developments in program analysis with Roberto Giacobazzi's preview of the POPL'24 session, offering insights into advanced techniques and research directions.

• YouTube
• 10 minutes
• On-Demand
• Free Video

Logical Foundations - Session Preview

Explore logical foundations in programming languages with Emanuele D'Osualdo's preview of the POPL'24 session, offering insights into cutting-edge research and developments.

• YouTube
• 11 minutes
• On-Demand
• Free Video

Types 3: Session Preview

Explore cutting-edge research in type systems and their applications in programming languages with Nick Benton's preview of the Types 3 session at POPL'24.

• YouTube
• 11 minutes
• On-Demand
• Free Video

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.

• YouTube
• 11 minutes
• On-Demand
• Free Video

Gradual Typing and Verification - Session Preview

Explore gradual typing and verification techniques in programming languages with Ronald Garcia's preview of the POPL'24 session.

• YouTube
• 10 minutes
• On-Demand
• Free Video

Algorithmic Verification - Session Preview

Explore algorithmic verification techniques in this concise POPL'24 session preview, focusing on cutting-edge research and advancements in the field.

• YouTube
• 10 minutes
• On-Demand
• Free Video

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.

• YouTube
• 12 minutes
• On-Demand
• Free Video

Automated Verification - Session Preview

Explore automated verification techniques and advancements in program analysis with expert Viktor Kunčak at POPL'24's session preview.

• YouTube
• 10 minutes
• On-Demand
• Free Video

Heterogeneous Concurrency - A New Frontier for Weak Memory

Explore heterogeneous processors' shared memory interfaces and their impact on weak memory concurrency models in emerging computing domains.

• YouTube
• 18 minutes
• On-Demand
• Free Video

Effective Sequential Monte Carlo for Language Model Probabilistic Programs

Explore efficient Sequential Monte Carlo for language model probabilistic programs. Learn about LLaMPPL library, design challenges, and outperforming state-of-the-art LLMs on various tasks.

• YouTube
• 11 minutes
• On-Demand
• Free Video