The problem set seems very straight forward. It is just like the lecture note - Proving precondition => postcondition. I can see that without using induction, this problem would be solved by case by case, where case1 should be string less than 2 and the other case should be string greater than or equal to two. Since cases are set, proving part won't be that hard. I hope I get a good mark on this too.
I think Prof Heap very nice. Even though problem set worth max 2% each, he looks like he gives away marks from these and make us to practice and catch concepts of the theory. Well, I also hope the rest of the problem sets will be easy enough.
This week's lecture is about 'Program Correctness' The theory seems very straight forward but not too easy though. My weakest point is that I am very slow reading and understanding codes by myself without running it on computer. This is absolutely true that without fully understanding of codes, no program can be proven. So, before jumping into proving something, I need to read over and over the some code and speed up my understanding. Honestly, I have no much things talk about this topic.
I'll just go practice some of examples on lecture notes.
No comments:
Post a Comment