Formal Methods Courses and Certifications

Simons Institute

Towards Verified Deep Learning

Explore formal methods for verifying deep learning systems, focusing on robustness, semantic analysis, and applications in cyber-physical systems with UC Berkeley's Sanjit Seshia.

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

ACM SIGPLAN

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

ACM SIGPLAN

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

ACM SIGPLAN

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

ACM SIGPLAN

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

ACM SIGPLAN

Later Credits: A Case Study in the Unreasonable Effectiveness of Separation Logic

Explore the effectiveness of separation logic in software verification through a case study on "Later Credits" presented by Derek Dreyer.

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

ACM SIGPLAN

A Deductive Verification Infrastructure for Probabilistic Programs

Explore a novel deductive verification infrastructure for probabilistic programs, featuring an intermediate verification language and real-valued logic for quantitative property verification.

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

ACM SIGPLAN

PEak: A Single Source of Truth for Hardware Design and Verification

Explore PEak, an open-source language enhancing hardware design productivity and verification through a unified approach for functional modeling, formal specification, and RTL implementation.

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

ACM SIGPLAN

Algorithmic Verification - Session Preview at POPL 2023

Explore algorithmic verification techniques and their applications in program analysis, presented by expert Umang Mathur at POPL 2023's innovative session preview track.

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

Linux Plumbers Conference

Program Verification for the Linux Kernel - Potential Costs and Benefits

Explore potential costs and benefits of program verification for the Linux kernel, gaining insights into its impact on development and reliability.

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

ACM SIGPLAN

A Comparison of Program Logics for (In)Correctness

Explore program logics for correctness and incorrectness, comparing over- and under-approximation techniques. Analyze Sufficient Incorrectness Logic and its Separation Logic variant for dynamic heap management.

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

ACM SIGPLAN

Deductive Verification of Parameterized Embedded Systems Modeled in SystemC

Explore deductive verification for parameterized embedded systems in SystemC, focusing on formal encoding, automated transformation, and novel invariant construction for global properties.

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

ACM SIGPLAN

A New Perspective on Commutativity in Verification

Explore a fresh perspective on commutativity in program proofs, focusing on its application in automated verification goals for various program types and properties.

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

ACM SIGPLAN

A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability

Explore a universal, sound, and complete proof method for machine-verifiable linearizability proofs. Learn about its application to complex algorithms and verification using TLAPS.

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

ACM SIGPLAN

Solving Queries for Boolean Fault Tree Logic via Quantified SAT

Explore fault tree analysis using Boolean Logic and Quantified SAT. Learn to identify system failure factors, analyze what-if scenarios, and check element independence in fault trees.

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