Structured program theorem: Difference between revisions

Revision as of 15:08, 12 July 2025

Revision as of 15:31, 12 July 2025

Line 93:

* {{cite journal |last=Ammarguellat |first=Z. |title=A control-flow normalization algorithm and its complexity |journal=IEEE Transactions on Software Engineering |volume=18 |issue=3 |pages=237–251 |year=1992 |doi=10.1109/32.126773 }}

* {{cite conference |last1=Ashcroft |first1=Edward |last2=Manna |first2=Zohar |author2-link=Zohar Manna|title=The translation of go to programs to 'while' programs |book-title=Proceedings of IFIP Congress |year=1971}}<ref>Reprinted, republished in {{harvnb|Yourdon|1979|pp=51–65}}</ref>

* {{cite journal |last=Bennett |first=C. H. |author-link=Charles H. Bennett (physicist)|title=Logical Reversibility of Computation |journal=IBM Journal of Research and Development |volume=17 |issue=6 |pages=525–532 |date=November 1973 |doi=10.1147/rd.176.0525 }}

Line 141:

* {{cite journal |last1=Yokoyama |first1=Tetsuo |last2=Axelsen |first2=Holger Bock |last3=Glück |first3=Robert |title=Fundamentals of reversible flowchart languages |journal=Theoretical Computer Science |date=January 2016 |volume=611 |pages=87–115 |doi=10.1016/j.tcs.2015.07.046|doi-access=free}}

* {{cite book |last=Yourdon |first=E. N. |author-link=Edward Yourdon |title=Classics in Software Engineering |publisher=Yourdon Press |___location=New York, NY|year=1979 |pages=49–50xi, 424 |isbn=978-0-917072-14-7 }}

==Further reading==