Content deleted Content added
Put reference list into alphabetical order. Updated dead links |
m →References: now the list is even more alphabetical |
||
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 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 }}
* {{cite journal |last1=Böhm |first1=Corrado |author-link1= Corrado Böhm |last2= Jacopini |first2= Giuseppe |author-link2= :it:Giuseppe Jacopini |date=May 1966 |title=Flow Diagrams, Turing Machines and Languages with Only Two Formation Rules |journal=[[Communications of the ACM]] |volume=9 |issue=5 |pages=366–371 |doi=10.1145/355592.365646 |citeseerx=10.1.1.119.9119 |s2cid=10236439}}
* {{cite report|last1= Burks|first1= Arthur W.|last2= Goldstine|first2= Herman|last3= von Neumann|first3= John|author1-link= Arthur W. Burks|author2-link= Herman Goldstine|author3-link = John von Neumann|title= Preliminary discussion of the Logical Design of an Electronic Computing Instrument|publisher= Institute for Advanced Study|___location= Princeton, NJ|year= 1947}}▼
* {{cite journal |last=Brender |first=Ronald F. |title=The BLISS programming language: a history |journal=Software: Practice and Experience |volume=32 |issue=10 |pages=955–981 |year=2002 |doi=10.1002/spe.470 |s2cid=45466625|url = https://www.cs.tufts.edu/~nr/cs257/archive/ronald-brender/bliss.pdf}}
▲* {{cite report|last1= Burks|first1= Arthur W.|last2= Goldstine|first2= Herman|last3= von Neumann|first3= John|author1-link= Arthur W. Burks|author2-link= Herman Goldstine|author3-link = John von Neumann|title= Preliminary discussion of the Logical Design of an Electronic Computing Instrument|publisher= Institute for Advanced Study|___location= Princeton, NJ|year= 1947}}
* {{cite journal |last=Cooper |first=David C. |title=Böhm and Jacopini's reduction of flow charts |journal=Communications of the ACM |volume=10 |issue=8 |page=463 |date=August 1967 |doi=10.1145/363534.363539 |doi-access=free }}
Line 110:
* {{cite book |last=Jorgensen |first=Paul C. |title=Software Testing: A Craftsman's Approach |edition=2nd |publisher=CRC Press |year=2002 |pages=150–153 |isbn=978-0-8493-0809-3 }}
* {{cite conference |last1=Kozen |first1=Dexter|author1-link=Dexter Kozen|last2=Tseng |first2=Wei-Lung Dustin |title=Mathematics of Program Construction – The Böhm–Jacopini Theorem is False, Propositionally |url= http://www.cs.cornell.edu/~kozen/papers/bohmjacopini.pdf|book-title=MPC 2008 |series=Lecture Notes in Computer Science |volume=5133 |pages=177–192 |year=2008 |doi=10.1007/978-3-540-70594-9_11 |isbn=978-3-540-70593-2 |citeseerx=10.1.1.218.9241 }}▼
* {{cite journal |last=Knuth |first=Donald |author-link=Donald Knuth|title=Structured Programming with go to Statements |journal=Computing Surveys |volume=6 |issue=4 |pages=261–301 |year=1974 |doi=10.1145/356635.356640 |s2cid=207630080 |citeseerx=10.1.1.103.6084 }}
* {{cite conference |last=Kosaraju |first=S. Rao |author-link=S. Rao Kosaraju|title=Analysis of structured programs |book-title=Proceedings of the Fifth Annual ACM Symposium on Theory of Computing |date=May 1973 |pages=240–252 |publisher=ACM}},{{cite journal |last=Kosaraju |first=S. Rao |author-mask=0|title=Analysis of Structured Programs |journal=Journal of Computer and System Sciences |volume=9 |issue=3 |pages=232–255 |year=1974 |orig-year=1973|doi=10.1016/S0022-0000(74)80043-7 }}
▲* {{cite conference |last1=Kozen |first1=Dexter|author1-link=Dexter Kozen|last2=Tseng |first2=Wei-Lung Dustin |title=Mathematics of Program Construction – The Böhm–Jacopini Theorem is False, Propositionally |url= http://www.cs.cornell.edu/~kozen/papers/bohmjacopini.pdf|book-title=MPC 2008 |series=Lecture Notes in Computer Science |volume=5133 |pages=177–192 |year=2008 |doi=10.1007/978-3-540-70594-9_11 |isbn=978-3-540-70593-2 |citeseerx=10.1.1.218.9241 }}
* {{cite book |last1=Louden |first1=Kenneth C. |last2=Lambert |first2=Kenneth A. |title=Programming Languages: Principles and Practices |edition=3rd |publisher=Cengage Learning |year=2011 |isbn=978-1-111-52941-3 }}
Line 135:
* {{cite web|author=University at Buffalo|title=CSE 111, Fall 2004, BOEHM-JACOPINI THEOREM |url=http://www.cse.buffalo.edu/faculty/sael/cse111/Fall2004/lectures/boehm-jacopini.html|archive-url=https://web.archive.org/web/20041122222935/http://www.cse.buffalo.edu/~rapaport/111F04/greatidea3.html |url-status=dead |archive-date=2004-11-22|publisher=University at Buffalo |date=2004-11-22 |access-date=2025-07-12}}
* {{cite book |last=Watt |first=David Anthony |author1-link=David Watt (computer scientist)|last2=Findlay |first2=William |title=Programming Language Design Concepts |publisher=John Wiley & Sons |year=2004 |isbn=978-0-470-85320-7 }}
* {{cite journal |last=Williams |first=M. H. |title=Flowchart Schemata and the Problem of Nomenclature |journal=The Computer Journal |volume=26 |issue=3 |pages=270–276 |year=1983 |doi=10.1093/comjnl/26.3.270 }}
* {{cite book |last=Yourdon |first=E. N. |title=Classics in Software Engineering |publisher=Yourdon Press |year=1979 |pages=49–50 |isbn=978-0-917072-14-7 }}▼
* {{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 |year=1979 |pages=49–50 |isbn=978-0-917072-14-7 }}
==Further reading==
| |||