Formal Methods Courses and Certifications

ACM SIGPLAN

Parameterized Verification of Disjunctive Timed Networks

Explore new techniques for parameterized verification of disjunctive timed networks, including efficient algorithms and summary construction for arbitrary-sized systems.

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

ACM SIGPLAN

Verification of a Subgraph Construction Algorithm for Geometric Graphs - VMCAI 2024

Explore automated verification of a subgraph construction algorithm, focusing on geometric graph properties, edge removal, and connectivity preservation in Euclidean plane representations.

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

ACM SIGPLAN

Trustworthy Runtime Verification via Bisimulation - Experience Report

Explore trustworthy runtime verification using bisimulation in the Copilot framework. Learn how CopilotVerifier generates correctness proofs for compiled monitors, enhancing safety-critical system assurance.

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

ACM SIGPLAN

Inductive Approach to Spacer - PLDI 2024

Explore an inductive approach to Spacer, unifying it with GPDR and addressing refutational completeness issues in constrained Horn clause satisfiability problem solving.

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

ACM SIGPLAN

Asynchronous Probabilistic Couplings in Higher-Order Separation Logic

Explore asynchronous probabilistic couplings in higher-order separation logic, addressing synchronization issues in relational program logics for enhanced reasoning about probabilistic programs.

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

ACM SIGPLAN

Hyper Hoare Logic: Proving and Disproving Program Hyperproperties

Explore Hyper Hoare Logic, a generalized proof system for program hyperproperties. Learn to reason about sets of states, proving and disproving properties beyond traditional Hoare logics.

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

ACM SIGPLAN

A Probabilistic Choreography Language for PRISM

Explore a choreographic framework for modeling and analyzing concurrent probabilistic systems using PRISM. Learn about a new choreography language and its encoding into PRISM for enhanced system reliability.

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

Wolfram

Function Extraction: Mapping Programs into Mathematica Equations

Extract precise program functions by mapping C-like code to Mathematica equations, enabling correctness verification and solving for program behavior.

• YouTube
• 25 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 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

Unified Compositional Formal Methods: Exact Separation Logic and the Gillian Platform - Incorrectness'24

Explore unified compositional formal methods for program correctness and incorrectness reasoning, focusing on exact separation logic and the Gillian platform.

• YouTube
• 23 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

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