**Ceci est une ancienne révision du document !**

## Model checkers

Model checkers are tool that verify all possible states of a formal model, i.e. a formal description of a system. Compared to proof assistant, they can be less powerful but easier to use.

### [[nu_smv|NuSMV]]

NuSMVis a reimplementation and extension of SMV, the first model checker based on BDDs. NuSMVhas been designed to be an open architecture for model checking, which can be reliably used for the verification of industrial designs, as a core for custom verification tools, as a testbed for formal verification techniques, and applied to other research areas.

- License: GNU LGPL 2.1

- Web site: http://nusmv.irst.itc.it/

### Murphi

Murphi also has a formal verifier based on explicit state enumeration. The verifier performs depth- or breadth-first search in the state graph defined by a Murphi description, storing all the states it encounters in a large hash table. When a state is generated that is already in the hash table, the search algorithm does not expand its successor states (they were expanded whenever the state was originally inserted in the table).

- License: BSD like

### Mec 5

Mec 5 is a model-checker for finite AltaRicamodels, using a very expressive specification language (systems of fixpoint equations over finite relations with first-order quantifiers and equality testing).

- License: Public domain

- Web site: http://altarica.labri.fr/Tools/Mec5/

### Maria

Maria is a reachability analyzer for concurrent systems that uses Algebraic System Nets (a high-level variant of Petri nets) as its modelling formalism.

- License: GNU LGPL

- Web site: http://www.tcs.hut.fi/Software/maria/