The formal methods are techniques making it possible to ensure the good comprehension of the awaited functions of a system. These functions being able to be temporal, deterministic,…
They make it possible moreover to facilitate the interconnection of functional modules of different origins (software, material) while being based on common mathematical representations.
In the years 1990, these concepts were extended to the design of the numerical electronic circuits. To date, it is not possible to extend these techniques to the entirety of the analogical circuits. This limit is intrinsic with the approach of the discrete deterministic systems.
From there, several approaches are possible to check the answer of the system, its determinism, and thus its adequacy with its definition.
Here a nonexhaustive list of these techniques which base all on the presence of a suitable specification of awaited functional of the system:
Theorem Prooving : the system is defined in the form of a mathematical theorem.
The tools of this type thus compare the model in progress with a model, known as of reference (Model Golden delicious), which was checked as correspondent with unit waitings, or of interface.
There is comparison between two of the same models level (behavioral vs. behavioral, RTL vs. RTL, netlist vs. netlist), or of successive levels (behavioral vs. RTL, behavioral vs. netlist, RTL vs. netlist).
N.B.: Currently, the tools behavioral vs. xxx are not functional
Notes and references of the article
| Random links: | Saint-Denis-in-the Hôtel | (38) Léda | Citroen C44 | Pacific (Missouri) | Aíto García Reneses | La_septième_chanson |