Some theoretical aspects of verification (with a focus on bisimilarity)

Automated theorem proving - cont.
1970s, 1980s, 1990s, 2000s
dozens <strong>of</strong> various (s<strong>of</strong>tware) theorem provers (or pro<strong>of</strong> assistants)
Used for verifying (computer) systems
usually extend first order logic: induction principles, higher order logics
(reasoning on data structures like lists, trees, graphs, ...
functional programming, functions <strong>of</strong> higher order types, ...)
One example:
Hunt W.: Microprocessor design <strong>verification</strong>,
Journal <strong>of</strong> Automated Reasoning 5, 4(1989), 429 - 460
(<strong>verification</strong> <strong>of</strong> the 32-bit processor FM8502), a part <strong>of</strong> a bigger project:
Bevier W., Hunt W., Moore J., Young W.:
An approach to system <strong>verification</strong>,
Journal <strong>of</strong> Automated Reasoning 5, 4(1989), 411 - 428
(<strong>verification</strong> <strong>of</strong> code generator, assembler, kernel <strong>of</strong> an operating system)
Petr Jančar (TU Ostrava) <strong>Some</strong> <strong>aspects</strong> <strong>of</strong> <strong>verification</strong>
Kolloquium Jena, 14 May 2007 25 /
89