Task 7.3: Formalisms to support incremental verification

In this toask we will study the formalisms needed to describe increments. Among others, we will study temporal logics, process algebras and automata. In order to decompose proof obligations in system verification, we are currently considering the assume-guarantee reasoning [HQR00].

wp7/t7.3/index.txt · Last modified: 2007/10/18 17:21 by pys