An Embedding Result for Labelled Programs.
Richard A. DeMillo, S. Rao Kosaraju · Defense Technical Information Center (DTIC) · 1977
It is shown that structured programs with n+1 labels can be simulated by structured programs with n labels by increasing the running time of the programs by at most a factor of 4. Two versions of this result are proved and in one version no node splitting operations are required in performing the simulation. (Author)