model checking
An automated formal verification technique that builds a finite-state model of a system and exhaustively searches the state space to check temporal logic properties, returning either a proof or a counterexample path.
Timeline (last 90 days)
Model checking is an automated formal verification technique: first build a finite-state model of the system, then use an algorithm to exhaustively or symbolically search the state space to check whether a given temporal logic property holds; it either gives a proof that the property holds or returns a concrete counterexample path.
SharpLogic does not execute the agents but performs symbolic analysis of the graph structure, thus combining the exhaustiveness of model checking with the lightness of property testing.
Dan Klein argues that layering a second model on top of a system to check the first is a weak fix, because both can err and often fail on the same hard cases; he estimates that 80% checking 80% ends up at about 82%.
All Facts (3)
Model checking is an automated formal verification technique: first build a finite-state model of the system, then use an algorithm to exhaustively or symbolically search the state space to check whether a given temporal logic property holds; it either gives a proof that the property holds or returns a concrete counterexample path.
50%UnverifiedSharpLogic does not execute the agents but performs symbolic analysis of the graph structure, thus combining the exhaustiveness of model checking with the lightness of property testing.
50%UnverifiedDan Klein argues that layering a second model on top of a system to check the first is a weak fix, because both can err and often fail on the same hard cases; he estimates that 80% checking 80% ends up at about 82%.
50%