Hoare Logic Courses and Certifications

ACM SIGPLAN

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

ACM SIGPLAN

Encode the ∀∃ Relational Hoare Logic into Standard Hoare Logic

Discover how to encode ∀∃ relational Hoare logic into standard Hoare logic for program verification without requiring logic framework modifications or soundness re-verification.

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

ACM SIGPLAN

Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning

Explore Outcome Logic, a unified theory for correctness and incorrectness reasoning in program logics, generalizing Hoare Logic to capture computational effects and reachability.

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

ACM SIGPLAN

The Never-Ending Trace: An Under-Approximate Approach to Divergence Bugs

Explore a new approach to detecting divergence bugs using forward under-approximating triples. Learn how this logic reasons about infinite loops and recursive calls compositionally.

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

ACM SIGPLAN

Partial Incorrectness Logic - Theory and Practice of Static Analysis

Explore Partial Incorrectness Logic, a program logic related to O'Hearn's incorrectness logic, examining the duality between divergence and unreachability using Dijkstra's predicate transformers.

• YouTube
• 15 minutes
• Self-Paced
• 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
• Self-Paced
• Free Video

ACM SIGPLAN

Gradual Exact Logic: Unifying Hoare Logic and Incorrectness Logic via Gradual Verification

Explore the connection between gradual verification and underapproximating logics through a novel gradualization of exact logic that unifies Hoare logic and incorrectness logic.

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

ACM SIGPLAN

A Quantitative Probabilistic Relational Hoare Logic

Explore eRHL, a groundbreaking program logic for relational expectation properties in probabilistic programs, offering soundness and completeness for program equivalence, statistical distance, and differential privacy.

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

Birla Institute Of Technology And Science–Pilani (BITS–Pilani)

Logic for Computer Science

Master formal reasoning and logical thinking fundamentals essential for computer science, covering propositional logic, predicate logic, model checking, and program verification techniques.

• Coursera
• 1 day 4 hours 48 minutes
• Self-Paced
• Paid Course

Pragmatic AI Labs

Design by Provable Contracts

Explore Design by Provable Contracts, climbing a five-rung provability ladder—from lint and types to Lean 4 proofs—applied to softmax, producing machine-checked guarantees for safety-critical numerical kernels.

• Coursera
• 5 weeks, 1 hour a week
• Self-Paced
• Paid Course

Strange Loop Conference

You Are a Program Synthesizer

Explore program synthesis insights to improve coding skills. Learn about code quality, specification-driven development, and advanced analysis techniques for better programming practices.

• YouTube
• 40 minutes
• Self-Paced
• Conference Talk

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
• Self-Paced
• Free Video

ACM SIGPLAN

Colouring Flags with Dafny and Idris - Dafny'24

Explore fine-grained reasoning in Dafny and Idris through the Dutch National Flag problem, comparing their verification approaches and programming paradigms.

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

ACM SIGPLAN

Calculational Design of Correctness and Incorrectness Transformational Program Logics by Abstract Interpretation

Explore transformational program logics for correctness and incorrectness, extending to handle termination and nontermination. Learn a calculational method for designing sound and complete formal proof systems.

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

ACM SIGPLAN

The Landscape of Formal Verification in APL - A Review with a Case Study in Quantum Computing

Explore formal verification in APL, focusing on its potential for building dependable software. Examine a case study in quantum computing and discuss future implications for software development.

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