| ILF and DAWN for Verifying Distributed Algorithms { An Idea for a Tool{ (2007) | |||||||||||||||
Abstract | |||||||||||||||
| Designing a proof in such a way that it can be automatically checked for correctness is a hard task. The task becomes even harder, if the proof should be intuitive and easily comprehensible. The reason is that details which are necessary for automatic checkability, blur the essential idea | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||