Programming with Transition Diagrams

Abstract

In situations where the avoidance of goto statements would beinhibiting, programs can be methodically constructed by using transitiondiagrams. The key requirement is that the relevant assertions must be simpleenough to permit exhaustive reasoning. The method is illustrated by programsfor fast exponentiation, merging, and path-finding in a directed graph.