Question: Consider following program where `x` is an integer variable; you may ignore the possibility of `x` overflowing: x := x + 2 x := x
Consider following program where `x` is an integer variable; you may ignore the possibility of `x` overflowing:
x := x + 2 x := x + 3 x := x + 4
Prove that under precondition `x = 0` the program establishes the postcondition `x = 9`. For this, draw a state diagram similar to the diagram for `x := x + 1 x := x + 2` in the course notes. Use a program to draw a diagram and insert the diagram as an svg file. The diagram has to include all the required annotations. State all conditions for the correctness of the transitions and for non-interference. You do not have to carry out the proofs [you get bonus ponits if you do].
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
