IIT Madras · Computer Science

Automated Program Verification

Prof. Kartik Nagar · 68 free video lectures

68 video lectures. Topics: Course Overview; Propositional Logic (PL); Satisfiability and Validity in Propositional Logic; Davis-Putnam-Logemann-Loveland Algorithm (DPLL) Part A; Davis-Putnam-Logemann-Loveland Algorithm (DPLL) Part B; Encoding Problems in Propositional Logic; First-Order Logic…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Course Overview
  2. Propositional Logic (PL)
  3. Satisfiability and Validity in Propositional Logic
  4. Davis-Putnam-Logemann-Loveland Algorithm (DPLL) Part A
  5. Davis-Putnam-Logemann-Loveland Algorithm (DPLL) Part B
  6. Encoding Problems in Propositional Logic
  7. First-Order Logic (FOL)
  8. Satisfiability and Validity in First-Order Logic Part A
  9. Satisfiability and Validity in First-Order Logic Part B
  10. Satisfiability Modulo Theories (SMT)
  11. Theory of Equality (T_=) Part A
  12. Theory of Equality (T_=) Part B
  13. Theory of Numbers
  14. Theory of Arrays
  15. Combination of Theories
  16. Compactness of FOL
  17. Application of SMT: Bounded Model Checking
  18. Z3 Tool
  19. Introduction to Program Verification
  20. Formal Definition of Program Verification
  21. Different Forms of Program Specifications
  22. Towards Automated Verification
  23. Strongest Post Condition Part A: Primitive Statements
  24. Strongest Post Condition Part B: Primitive Statements
  25. Strongest Post Condition Part C: Compound Statements
  26. Strongest Post-Condition Part D: Putting it all together
  27. Soundness and Completeness of Strongest Post-Condition
  28. Weakest Pre-condition Part A: Primitive Statements
  29. Weakest Pre-condition Part B: Primitive Statements
  30. Weakest Pre-condition Part C: Compound Statements
  31. Weakest Pre-condition Part D: Putting it all together
  32. Hoare Logic Part A: Introduction
  33. Hoare Logic Part B: Inference Rules for Compound Statements
  34. Hoare Logic Part C: Loop Invariants
  35. Hoare Logic Part D: Putting it all together
  36. Crafting Inductive Loop Invariants
  37. Verification Condition Generation Part A
  38. Verification Condition Generation Part B
  39. Handling functions
  40. Handling Pointers
  41. Introduction to Abstract Interpretation
  42. Forward Propagate Algorithm
  43. Overview of Abstract Interpretation
  44. Soundness of Abstract Interpretation
  45. Lattice Theory Basics Part A
  46. Lattice Theory Basics Part B
  47. Fixpoints
  48. Chains
  49. Galois Connection
  50. Concrete and Abstract Join Over Path
  51. Defining Soundness of Abstract Interpretation
  52. Proof of Soundness of Abstract Interpretation
  53. Introduction to Kildall's Algorithm
  54. Properties of Kildall's Algorithm
  55. Kildall's Algorithm with Monotonic Transfer Functions
  56. Kildall's Algorithm with Distributive Transfer Functions
  57. Proof of Soundness of Kildall's Algorithm
  58. Proof of Termination of Kildall's Algorithm
  59. Constant Abstract Domain
  60. Interval Abstract Domain: Introduction
  61. Interval Abstract Domain: Widening and Narrowing
  62. Relational Domains and Inter-Procedural Abstract Interpretation
  63. Concrete and Symbolic Model Checking
  64. Abstract Model Checking
  65. Abstract Model Cheking with Cartesian Predicate Abstraction
  66. Abstraction Refinement using Interpolation
  67. CEGAR
  68. Summary

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Madras.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights