classification of verification algorithms

Verification algorithms can be classified into four (overlapping) groups.

Unsound algorithms can only prove some of the false properties as false, while incomplete algorithms can only prove some of the true properties as true.

Complete algorithms are able to report all correct properties as true, while sound algorithms are able to report all false properties as false.

Sources

  • [[ Branch and Bound for Piecewise Linear Neural Network Verification ]]

Notes mentioning this note

There are no notes linking to this note.

Here are all the notes in this garden, along with their links, visualized as a graph.