Egor Urvanov

Model checking

Formal verification · automatic state exploration

created · updated

A method in which a program automatically walks the states of a described system and checks that the rules hold in each of them. If a rule breaks, the method outputs the exact chain of steps that leads there. For example, a shop model finds the move “payment, connection lost” after which the money is charged but there is no order: the buyer paid and got nothing. Unlike a test, the method is not limited to scenarios a person thought of, but it is limited by the size of the chosen world.

the rule: money is never charged without an ordercartthe buyer picked an itempaymentmoney is chargedorder createdall fineconnection lostit broke halfwaycharged, no orderthe buyer paid and got nothingmove 1move 2: no order made● model, people, systems, data  ● agent and harness  ● risk, stop, boundaryThe program tries every move and finds the one with money gone and no order

Source: Wikipedia: Model checking

Read more: Finding races and lost data with Quint models

Where it appears · 4

Related terms

Whole glossary

© 2026 Egor Urvanov