Abstract
In situations where the avoidance of goto statements would be inhibiting, programs can be methodically constructed by using transition diagrams. The key requirement is that the relevant assertions must be simple enough to permit exhaustive reasoning. The method is illustrated by programs for fast exponentiation, merging, and path-finding in a directed graph.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag New York Inc
About this chapter
Cite this chapter
Reynolds, J.C. (1978). Programming with Transition Diagrams. In: Gries, D. (eds) Programming Methodology. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-6315-9_13
Download citation
DOI: https://doi.org/10.1007/978-1-4612-6315-9_13
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6317-3
Online ISBN: 978-1-4612-6315-9
eBook Packages: Springer Book Archive