Mathematically proving computer programs
Today, I was randomly surfing internet and then I saw this video from Leslie Lamport (https://www.youtube.com/watch?v=rkZzg7Vowao), it hit me because in my general distributed systems courses, I did read about Lamport clocks and there were quite a lot of associated papers written by Lamport. So, I opened it, entire video was made in quite an interesting way, and I do get fascinated by one of his lines, it was about mathematically proving up algorithms and from my understanding it is one of the sole reasons which accumulated to his success Now, I started questioning up my approach every time when I am assigned a task, I try to fit it with the framework supported/created by my team. I find it a bit difficult to mathematically prove anything and this could be reason behind me not able to create new novel things. How can I create algorithms which have a proof associated with it? He asks to mathematically prove a program which they are doing? I need to look more into this……