We will cover the principles underlying a recent approach to the verification
of different classes of correctness properties (safety, termination) for
programs. The approach is based on a new view to programs where the
control flow graph is considered as an automaton. The alphabet of this
automaton are the program's statements. The language of this automaton are
the traces of the program. We will use automata-theoretic operations to
decompose a program into sets of traces and prove correctness for each set
of traces individually. For the verification of recursive programs we use
nested word automata and for termination analysis we use the Büchi
acceptance condition.

2015-heizmann.txt · Last modified: 2015/04/21 18:29 by Tomáš Brázdil

The seminar has been supported also by Project Innovation of doctoral study at FI MU (IDSnaFI) (CZ.1.07/2.2.00/15.0196).