Summary: Software-Modellierung und Verifikation
Prof. J.-P. Katoen
Priv.-Doz. T. Noll firstname.lastname@example.org
C. Jansen email@example.com
11. Exercise sheet Semantics and Verification of Software SoSe2010
Due to Monday, 12th July 2010, before the exercise course begins.
Exercise 11.1: (4 points)
Provide the second/missing proof step for theorem 17.4 of the lecture, i.e. show that the following lemma holds:
Lemma 1 (17.6) For every c Cmd, , and e Stk, Tc c , , £
, e, implies c, and
e = .
You may use all theorems and lemmata presented in the lecture (except from the one to proof). Additionally you
may find the following lemma useful.
Lemma 2 (Decomposition Lemma) If c1 : c2, e, s £k
, e , , then there exists a configuration , e ,
and natural numbers k1, k2 with k1 + k2 = k such that c1, e, £k1
, e , and c2, e , £k2
, e , .