Structured program theorem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Structured program theorem" in English language version.

Last modified: 08:57:27, 28 July 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

3117doi.org

2^nd place

2110semanticscholar.org

15^th place

8^th place

114psu.edu

299^th place

159^th place

32web.archive.org

1^st place

32cambridge.org

209^th place

151^st place

31cornell.edu

308^th place

253^rd place

31ru.nl

7,619^th place

6,271^st place

22loc.gov

63^rd place

47^th place

22adsabs.harvard.edu

14^th place

9^th place

21stanford.edu

194^th place

182^nd place

11buffalo.edu

4,409^th place

2,820^th place

11springer.com

182^nd place

172^nd place

11tufts.edu

192^nd place

165^th place

11books.google.com

3^rd place

11usenix.org

7,359^th place

4,657^th place

11openjit.org

low place

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Bennett 1973. Bennett, C. H. (November 1973). "Logical Reversibility of Computation". IBM Journal of Research and Development. 17 (6): 525–532. Bibcode:1973IBMJ...17..525B. doi:10.1147/rd.176.0525.
The original paper is McCabe 1976. For a secondary exposition see Jorgensen 2002. McCabe, Thomas J. (December 1976). "A Complexity Measure". IEEE Transactions on Software Engineering. SE-2 (4): 315–318. Bibcode:1976ITSEn...2..308M. doi:10.1109/tse.1976.233837. S2CID 9116234. Jorgensen, Paul C. (2002). Software Testing: A Craftsman's Approach (2nd ed.). CRC Press. pp. 150–153. ISBN 978-0-8493-0809-3.

books.google.com (Global: 3^rd place; English: 3^rd place)

The original paper is McCabe 1976. For a secondary exposition see Jorgensen 2002. McCabe, Thomas J. (December 1976). "A Complexity Measure". IEEE Transactions on Software Engineering. SE-2 (4): 315–318. Bibcode:1976ITSEn...2..308M. doi:10.1109/tse.1976.233837. S2CID 9116234. Jorgensen, Paul C. (2002). Software Testing: A Craftsman's Approach (2nd ed.). CRC Press. pp. 150–153. ISBN 978-0-8493-0809-3.

buffalo.edu (Global: 4,409^th place; English: 2,820^th place)

cse.buffalo.edu

University at Buffalo 2004. University at Buffalo (22 November 2004). "CSE 111, Fall 2004, BOEHM-JACOPINI THEOREM". University at Buffalo. Archived from the original on 22 November 2004. Retrieved 12 July 2025.

cambridge.org (Global: 209^th place; English: 151^st place)

Böhm 1964. Böhm, Corrado (1964). "On a family of Turing machines and the related programming language" (PDF). ICC Bulletin. 3: 185–194.
Böhm 1964, p. 191, Main result of this paper. Böhm, Corrado (1964). "On a family of Turing machines and the related programming language" (PDF). ICC Bulletin. 3: 185–194.

cornell.edu (Global: 308^th place; English: 253^rd place)

cs.cornell.edu

Kozen & Tseng 2008. Kozen, Dexter; Tseng, Wei-Lung Dustin (2008). "Mathematics of Program Construction – The Böhm–Jacopini Theorem is False, Propositionally" (PDF). MPC 2008. Lecture Notes in Computer Science. Vol. 5133. pp. 177–192. CiteSeerX 10.1.1.218.9241. doi:10.1007/978-3-540-70594-9_11. ISBN 978-3-540-70593-2. {{cite conference}}: Cite uses deprecated parameter |citeseerx= (help)

doi.org (Global: 2^nd place; English: 2^nd place)

Kozen & Tseng 2008. Kozen, Dexter; Tseng, Wei-Lung Dustin (2008). "Mathematics of Program Construction – The Böhm–Jacopini Theorem is False, Propositionally" (PDF). MPC 2008. Lecture Notes in Computer Science. Vol. 5133. pp. 177–192. CiteSeerX 10.1.1.218.9241. doi:10.1007/978-3-540-70594-9_11. ISBN 978-3-540-70593-2. {{cite conference}}: Cite uses deprecated parameter |citeseerx= (help)
Böhm & Jacopini 1966. Böhm, Corrado; Jacopini, Giuseppe [in Italian] (May 1966). "Flow Diagrams, Turing Machines and Languages with Only Two Formation Rules". Communications of the ACM. 9 (5): 366–371. CiteSeerX 10.1.1.119.9119. doi:10.1145/355592.365646. S2CID 10236439. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help). Republished in Yourdon 1979, pp. 13–25
Harel 1980, p. 381. Harel, David (1980). "On Folk Theorems". Communications of the ACM. 23 (7): 379–389. doi:10.1145/358886.358892. S2CID 16300625.
Harel 1980, p. 383. Harel, David (1980). "On Folk Theorems". Communications of the ACM. 23 (7): 379–389. doi:10.1145/358886.358892. S2CID 16300625.
Harel 1980, p. 380. Harel, David (1980). "On Folk Theorems". Communications of the ACM. 23 (7): 379–389. doi:10.1145/358886.358892. S2CID 16300625.
Knuth 1974, p. 274. Knuth, Donald (1974). "Structured Programming with go to Statements". Computing Surveys. 6 (4): 261–301. CiteSeerX 10.1.1.103.6084. doi:10.1145/356635.356640. S2CID 207630080. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help). Republished in Yourdon 1979, pp. 259–321
Greibach 1975, Chapter 4. Structured Programs. Greibach, Sheila A. (1975). Greibach, Sheila A. (ed.). Theory of Program Structures: Schemes, Semantics, Verification. Lecture Notes in Computer Science. Vol. 36. Berlin, Heidelberg, New York: Springer-Verlag. doi:10.1007/BFb0023017. ISBN 978-3-540-07415-1. LCCN 75031780.
Yokoyama, Axelsen & Glück 2016. Yokoyama, Tetsuo; Axelsen, Holger Bock; Glück, Robert (January 2016). "Fundamentals of reversible flowchart languages". Theoretical Computer Science. 611: 87–115. doi:10.1016/j.tcs.2015.07.046.
Bennett 1973. Bennett, C. H. (November 1973). "Logical Reversibility of Computation". IBM Journal of Research and Development. 17 (6): 525–532. Bibcode:1973IBMJ...17..525B. doi:10.1147/rd.176.0525.
Cooper 1967. Cooper, David C. (August 1967). "Böhm and Jacopini's reduction of flow charts". Communications of the ACM. 10 (8): 463. doi:10.1145/363534.363539.
Dijkstra 1968. Dijkstra, Edsger (1968). "Go To Statement Considered Harmful". Communications of the ACM. 11 (3): 147–148. doi:10.1145/362929.362947. S2CID 17469809.. Republished in Yourdon 1979, pp. 29–33
Roberts 1995. Roberts, E. (1995). "Loop Exits and Structured Programming: Reopening the Debate" (PDF). ACM SIGCSE Bulletin. 27 (1): 268–272. doi:10.1145/199691.199815. Archived (PDF) from the original on 25 July 2014.
Kosaraju 1973,^[28] cited by Knuth 1974. Kosaraju, S. Rao (May 1973). "Analysis of structured programs". Proceedings of the Fifth Annual ACM Symposium on Theory of Computing. ACM. pp. 240–252.,"Analysis of Structured Programs". Journal of Computer and System Sciences. 9 (3): 232–255. 1974 [1973]. doi:10.1016/S0022-0000(74)80043-7. Knuth, Donald (1974). "Structured Programming with go to Statements". Computing Surveys. 6 (4): 261–301. CiteSeerX 10.1.1.103.6084. doi:10.1145/356635.356640. S2CID 207630080. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help). Republished in Yourdon 1979, pp. 259–321
Brender 2002, pp. 960–965. Brender, Ronald F. (2002). "The BLISS programming language: a history" (PDF). Software: Practice and Experience. 32 (10): 955–981. doi:10.1002/spe.470. S2CID 45466625.
The original paper is McCabe 1976. For a secondary exposition see Jorgensen 2002. McCabe, Thomas J. (December 1976). "A Complexity Measure". IEEE Transactions on Software Engineering. SE-2 (4): 315–318. Bibcode:1976ITSEn...2..308M. doi:10.1109/tse.1976.233837. S2CID 9116234. Jorgensen, Paul C. (2002). Software Testing: A Craftsman's Approach (2nd ed.). CRC Press. pp. 150–153. ISBN 978-0-8493-0809-3.
Williams 1983, pp. 274–275. Williams, M. H. (1983). "Flowchart Schemata and the Problem of Nomenclature". The Computer Journal. 26 (3): 270–276. doi:10.1093/comjnl/26.3.270.
Ramshaw 1988. Ramshaw, L. (1988). "Eliminating go to's while preserving program structure". Journal of the ACM. 35 (4): 893–920. doi:10.1145/48014.48021. S2CID 31001665.

loc.gov (Global: 63^rd place; English: 47^th place)

lccn.loc.gov

Greibach 1975, Chapter 4. Structured Programs. Greibach, Sheila A. (1975). Greibach, Sheila A. (ed.). Theory of Program Structures: Schemes, Semantics, Verification. Lecture Notes in Computer Science. Vol. 36. Berlin, Heidelberg, New York: Springer-Verlag. doi:10.1007/BFb0023017. ISBN 978-3-540-07415-1. LCCN 75031780.
Yourdon 1979, pp. 49–50. Yourdon, E. N., ed. (1979). Classics in Software Engineering. New York, NY: Yourdon Press. pp. xi, 424. ISBN 978-0-917072-14-7. LCCN 79-63449.

openjit.org (Global: low place; English: low place)

Maruyama, Ogawa & Matsuoka 1999. Maruyama, Fuyuhiko; Ogawa, Hirotaka; Matsuoka, Satoshi (1999). "An Effective Decompilation Algorithm for Java Bytecodes" (PDF). www.openjit.org (in Japanese). Retrieved 12 July 2025.

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Kozen & Tseng 2008. Kozen, Dexter; Tseng, Wei-Lung Dustin (2008). "Mathematics of Program Construction – The Böhm–Jacopini Theorem is False, Propositionally" (PDF). MPC 2008. Lecture Notes in Computer Science. Vol. 5133. pp. 177–192. CiteSeerX 10.1.1.218.9241. doi:10.1007/978-3-540-70594-9_11. ISBN 978-3-540-70593-2. {{cite conference}}: Cite uses deprecated parameter |citeseerx= (help)
Böhm & Jacopini 1966. Böhm, Corrado; Jacopini, Giuseppe [in Italian] (May 1966). "Flow Diagrams, Turing Machines and Languages with Only Two Formation Rules". Communications of the ACM. 9 (5): 366–371. CiteSeerX 10.1.1.119.9119. doi:10.1145/355592.365646. S2CID 10236439. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help). Republished in Yourdon 1979, pp. 13–25
Knuth 1974, p. 274. Knuth, Donald (1974). "Structured Programming with go to Statements". Computing Surveys. 6 (4): 261–301. CiteSeerX 10.1.1.103.6084. doi:10.1145/356635.356640. S2CID 207630080. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help). Republished in Yourdon 1979, pp. 259–321
Kosaraju 1973,^[28] cited by Knuth 1974. Kosaraju, S. Rao (May 1973). "Analysis of structured programs". Proceedings of the Fifth Annual ACM Symposium on Theory of Computing. ACM. pp. 240–252.,"Analysis of Structured Programs". Journal of Computer and System Sciences. 9 (3): 232–255. 1974 [1973]. doi:10.1016/S0022-0000(74)80043-7. Knuth, Donald (1974). "Structured Programming with go to Statements". Computing Surveys. 6 (4): 261–301. CiteSeerX 10.1.1.103.6084. doi:10.1145/356635.356640. S2CID 207630080. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help). Republished in Yourdon 1979, pp. 259–321

ru.nl (Global: 7,619^th place; English: 6,271^st place)

cs.ru.nl

Barendregt 2019, p. 12. Barendregt, Henk (6 November 2019). "Gems of Corrado Böhm" (PDF). Radboud University Nijmegen. Retrieved 6 December 2025.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Böhm & Jacopini 1966. Böhm, Corrado; Jacopini, Giuseppe [in Italian] (May 1966). "Flow Diagrams, Turing Machines and Languages with Only Two Formation Rules". Communications of the ACM. 9 (5): 366–371. CiteSeerX 10.1.1.119.9119. doi:10.1145/355592.365646. S2CID 10236439. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help). Republished in Yourdon 1979, pp. 13–25
Harel 1980, p. 381. Harel, David (1980). "On Folk Theorems". Communications of the ACM. 23 (7): 379–389. doi:10.1145/358886.358892. S2CID 16300625.
Harel 1980, p. 383. Harel, David (1980). "On Folk Theorems". Communications of the ACM. 23 (7): 379–389. doi:10.1145/358886.358892. S2CID 16300625.
Harel 1980, p. 380. Harel, David (1980). "On Folk Theorems". Communications of the ACM. 23 (7): 379–389. doi:10.1145/358886.358892. S2CID 16300625.
Knuth 1974, p. 274. Knuth, Donald (1974). "Structured Programming with go to Statements". Computing Surveys. 6 (4): 261–301. CiteSeerX 10.1.1.103.6084. doi:10.1145/356635.356640. S2CID 207630080. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help). Republished in Yourdon 1979, pp. 259–321
Dijkstra 1968. Dijkstra, Edsger (1968). "Go To Statement Considered Harmful". Communications of the ACM. 11 (3): 147–148. doi:10.1145/362929.362947. S2CID 17469809.. Republished in Yourdon 1979, pp. 29–33
Kosaraju 1973,^[28] cited by Knuth 1974. Kosaraju, S. Rao (May 1973). "Analysis of structured programs". Proceedings of the Fifth Annual ACM Symposium on Theory of Computing. ACM. pp. 240–252.,"Analysis of Structured Programs". Journal of Computer and System Sciences. 9 (3): 232–255. 1974 [1973]. doi:10.1016/S0022-0000(74)80043-7. Knuth, Donald (1974). "Structured Programming with go to Statements". Computing Surveys. 6 (4): 261–301. CiteSeerX 10.1.1.103.6084. doi:10.1145/356635.356640. S2CID 207630080. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help). Republished in Yourdon 1979, pp. 259–321
Brender 2002, pp. 960–965. Brender, Ronald F. (2002). "The BLISS programming language: a history" (PDF). Software: Practice and Experience. 32 (10): 955–981. doi:10.1002/spe.470. S2CID 45466625.
The original paper is McCabe 1976. For a secondary exposition see Jorgensen 2002. McCabe, Thomas J. (December 1976). "A Complexity Measure". IEEE Transactions on Software Engineering. SE-2 (4): 315–318. Bibcode:1976ITSEn...2..308M. doi:10.1109/tse.1976.233837. S2CID 9116234. Jorgensen, Paul C. (2002). Software Testing: A Craftsman's Approach (2nd ed.). CRC Press. pp. 150–153. ISBN 978-0-8493-0809-3.
Ramshaw 1988. Ramshaw, L. (1988). "Eliminating go to's while preserving program structure". Journal of the ACM. 35 (4): 893–920. doi:10.1145/48014.48021. S2CID 31001665.

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Greibach 1975, Chapter 4. Structured Programs. Greibach, Sheila A. (1975). Greibach, Sheila A. (ed.). Theory of Program Structures: Schemes, Semantics, Verification. Lecture Notes in Computer Science. Vol. 36. Berlin, Heidelberg, New York: Springer-Verlag. doi:10.1007/BFb0023017. ISBN 978-3-540-07415-1. LCCN 75031780.

stanford.edu (Global: 194^th place; English: 182^nd place)

cs.stanford.edu

Roberts 1995. Roberts, E. (1995). "Loop Exits and Structured Programming: Reopening the Debate" (PDF). ACM SIGCSE Bulletin. 27 (1): 268–272. doi:10.1145/199691.199815. Archived (PDF) from the original on 25 July 2014.

tufts.edu (Global: 192^nd place; English: 165^th place)

cs.tufts.edu

Brender 2002, pp. 960–965. Brender, Ronald F. (2002). "The BLISS programming language: a history" (PDF). Software: Practice and Experience. 32 (10): 955–981. doi:10.1002/spe.470. S2CID 45466625.

usenix.org (Global: 7,359^th place; English: 4,657^th place)

Proebsting & Watterson 1997. Proebsting, Todd A.; Watterson, Scott A. (1997). "Krakatoa: Decompilation in Java" (PDF). usenix.org. Retrieved 12 July 2025.

web.archive.org (Global: 1^st place; English: 1^st place)

University at Buffalo 2004. University at Buffalo (22 November 2004). "CSE 111, Fall 2004, BOEHM-JACOPINI THEOREM". University at Buffalo. Archived from the original on 22 November 2004. Retrieved 12 July 2025.
Roberts 1995. Roberts, E. (1995). "Loop Exits and Structured Programming: Reopening the Debate" (PDF). ACM SIGCSE Bulletin. 27 (1): 268–272. doi:10.1145/199691.199815. Archived (PDF) from the original on 25 July 2014.

Structured program theorem (English Wikipedia)

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

books.google.com (Global: 3rd place; English: 3rd place)

buffalo.edu (Global: 4,409th place; English: 2,820th place)

cse.buffalo.edu

cambridge.org (Global: 209th place; English: 151st place)

cornell.edu (Global: 308th place; English: 253rd place)