Sign inSign in
ConceptSystems & CS

Model checking

A technique that conceptually checks all possible executions of a program on a small model.
as Leslie Lamport defines itMicrosoft ResearchThe wording closest to all 5 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

5

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    A technique for verifying that a system model satisfies a given property by exploring all reachable states.
    • 8:07Breadth-First Search (BFS)
  • Brian Yu

    Harvard University · Undergraduate

    An algorithm that determines entailment by enumerating all possible models and checking if the query is true whenever the knowledge base is true.
    • 2:13:40Harvard CS50’s Artificial Intelligence with Python – Full University Course
  • Martin Kleppmann

    Code Mesh LDN · Undergraduate

    Systematically going through all the possible combinations of what could happen, especially if different things could happen in different orders.
    • 1:11Correctness Proofs of Distributed Systems with Isabelle
  • Charles Leiserson

    MIT · Undergraduate

    A program that explores all possible ways of executing code to help find bugs in protocols.
    • 30:51Synchronization Without Locks

Lectures that assume it

1

Connections

10

The lectures that define it or assume it, and the concepts next to it.

5 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.