Verifying Dijkstra ’ s algorithm in Jahob

This report presents how to efficiently prove correctness of JAVA implementations. To this end we used Jahob verification system which is one of the most evolved verification tool for Javalike programs nowadays. We chose to analyze Dijkstra’s algorithm because it is widely used in routing protocols. It is simple, yet allows us to cope with many types of software errors. This project was motivated by today’s increasing need of bug-free programs, the main reason being that software development and maintenance are expensive tasks.