• Pasarella E, Vidal M, Zoltan C and Royo Sales J. (2024). A computational framework based on the dynamic pipeline approach. Journal of Logical and Algebraic Methods in Programming. 10.1016/j.jlamp.2024.100966. 139. (100966). Online publication date: 1-Jun-2024.

    https://linkinghub.elsevier.com/retrieve/pii/S2352220824000245

  • Wu D, Ouyang J, Dai N, Wu M, Tan H, Deng H, Fan Y, Wang D and Jin Z. (2022). DeepBrain. Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies. 6:3. (1-27). Online publication date: 6-Sep-2022.

    https://doi.org/10.1145/3550334

  • Ullah M, Chatterjee S, Fagundes C, Lam C, Nahum-Shani I, Rehg J, Wetter D and Kumar S. (2022). mRisk. Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies. 6:3. (1-29). Online publication date: 6-Sep-2022.

    https://doi.org/10.1145/3550308

  • Blumenthal R. (2022). "Teach your children well" value-neutrality and CS202X. ACM SIGCAS Computers and Society. 50:2. (18-18). Online publication date: 1-Sep-2021.

    https://doi.org/10.1145/3557805.3557815

  • Bartolini C. (2017). Software Testing Techniques Revisited for OWL Ontologies. Model-Driven Engineering and Software Development. 10.1007/978-3-319-66302-9_7. (132-153).

    http://link.springer.com/10.1007/978-3-319-66302-9_7

  • Wang F, Schewe S and Wu J. (2015). Complexity of node coverage games. Theoretical Computer Science. 576:C. (45-60). Online publication date: 20-Apr-2015.

    https://doi.org/10.1016/j.tcs.2015.02.002

  • List M and Car D. (2011). A polymorphic reference counting implementation in Fortran 2003. ACM SIGPLAN Fortran Forum. 30:2. (4-27). Online publication date: 18-Jul-2011.

    https://doi.org/10.1145/2007333.2007334

  • Vu T. (2008). Goto elimination in program algebra. Science of Computer Programming. 73:2-3. (95-128). Online publication date: 1-Oct-2008.

    https://doi.org/10.1016/j.scico.2008.07.002

  • Ammann P, Offutt J and Xu W. Coverage criteria for state based specifications. Formal methods and testing. (118-156).

    /doi/10.5555/1806209.1806213

  • Ammann P, Offutt J and Xu W. Coverage Criteria for State Based Specifications. Formal Methods and Testing. 10.1007/978-3-540-78917-8_4. (118-156).

    http://link.springer.com/10.1007/978-3-540-78917-8_4

  • Levanoni Y and Petrank E. (2006). An on-the-fly reference-counting garbage collector for java. ACM Transactions on Programming Languages and Systems. 28:1. (1-69). Online publication date: 1-Jan-2006.

    https://doi.org/10.1145/1111596.1111597

  • Ledgard H. (2001). Technical opinion: The emperor with no clothes. Communications of the ACM. 44:10. (126-128). Online publication date: 1-Oct-2001.

    https://doi.org/10.1145/383845.383873

  • Fagin B. (2000). Using Ada-based robotics to teach computer science. ACM SIGCSE Bulletin. 32:3. (148-151). Online publication date: 1-Sep-2000.

    https://doi.org/10.1145/353519.343150

  • Last M, Daniels M, Almstrum V, Erickson C and Klein B. (2000). An international student/faculty collaboration. ACM SIGCSE Bulletin. 32:3. (128-131). Online publication date: 1-Sep-2000.

    https://doi.org/10.1145/353519.343140

  • Dick M, Postema M and Miller J. (2000). Teaching tools for software engineering education. ACM SIGCSE Bulletin. 32:3. (49-52). Online publication date: 1-Sep-2000.

    https://doi.org/10.1145/353519.343072

  • Exton C. (2000). Elucidate. ACM SIGCSE Bulletin. 32:3. (33-36). Online publication date: 1-Sep-2000.

    https://doi.org/10.1145/353519.343066

  • Hagan D and Markham S. (2000). Does it help to have some programming experience before beginning a computing degree program?. ACM SIGCSE Bulletin. 32:3. (25-28). Online publication date: 1-Sep-2000.

    https://doi.org/10.1145/353519.343063

  • Kolikant Y, Ben-Ari M and Pollack S. (2000). The anthropology semaphores. ACM SIGCSE Bulletin. 32:3. (21-24). Online publication date: 1-Sep-2000.

    https://doi.org/10.1145/353519.343061

  • Nelson D and Ng Y. (2000). Teaching computer networking using open source software. ACM SIGCSE Bulletin. 32:3. (13-16). Online publication date: 1-Sep-2000.

    https://doi.org/10.1145/353519.343056

  • Gregg D and Goul M. (1999). A proposal for an open DSS protocol. Communications of the ACM. 42:11. (91-96). Online publication date: 1-Nov-1999.

    https://doi.org/10.1145/319382.319400

  • Nezlek G, Jain H and Nazareth D. (1999). An integrated approach to enterprise computing architectures. Communications of the ACM. 42:11. (82-90). Online publication date: 1-Nov-1999.

    https://doi.org/10.1145/319382.319399

  • Oviatt S. (1999). Ten myths of multimodal interaction. Communications of the ACM. 42:11. (74-81). Online publication date: 1-Nov-1999.

    https://doi.org/10.1145/319382.319398

  • Ziarko W. (1999). Discovery through rough set theory. Communications of the ACM. 42:11. (54-57). Online publication date: 1-Nov-1999.

    https://doi.org/10.1145/319382.319393

  • Muggleton S. (1999). Scientific knowledge discovery using inductive logic programming. Communications of the ACM. 42:11. (42-46). Online publication date: 1-Nov-1999.

    https://doi.org/10.1145/319382.319390

  • Shapiro S. (1997). Splitting the Difference. IEEE Annals of the History of Computing. 19:1. (20-54). Online publication date: 1-Jan-1997.

    https://doi.org/10.1109/85.560729

  • Kiskis D and Shin K. (1996). A synthetic workload for a distributed real-time system. Real-Time Systems. 11:1. (5-18). Online publication date: 1-Jul-1996.

    https://doi.org/10.1007/BF00365518

  • Le Traon Y, Al Hayek G and Robach C. Testability-oriented hardware/software partitioning International Test Conference 1996. Test and Design Validity. 10.1109/TEST.1996.557131. 0-7803-3541-4. (725-731).

    http://ieeexplore.ieee.org/document/557131/

  • Muller B. Semantic preserving language conversion by simple pattern matching IEEE Symposium and Workshop on Engineering of Computer-Based Systems. 10.1109/ECBS.1996.494523. 0-8186-7355-9. (148-155).

    http://ieeexplore.ieee.org/document/494523/

  • Roberts E. (1995). Loop exits and structured programming. ACM SIGCSE Bulletin. 27:1. (268-272). Online publication date: 15-Mar-1995.

    https://doi.org/10.1145/199691.199815

  • Roberts E. Loop exits and structured programming. Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education. (268-272).

    https://doi.org/10.1145/199688.199815

  • Pant Y, Verner J and Henderson-Sellers B. (1995). S/C: a Software Size/Complexity Measure. Software Quality and Productivity. 10.1007/978-0-387-34848-3_50. (320-327).

    http://link.springer.com/10.1007/978-0-387-34848-3_50

  • Ferneley E, Howcroft D and Davies C. (1995). Complexity Measures for System Development Models. Software Quality and Productivity. 10.1007/978-0-387-34848-3_42. (273-278).

    http://link.springer.com/10.1007/978-0-387-34848-3_42

  • Kiskis D and Shin K. (1994). SWSL. IEEE Transactions on Software Engineering. 20:10. (798-811). Online publication date: 1-Oct-1994.

    https://doi.org/10.1109/32.328992

  • Zuse H. (1994). Foundations of the Validation of Object-Oriented Software Measures. Theorie und Praxis der Softwaremessung. 10.1007/978-3-663-14540-0_9. (136-213).

    http://link.springer.com/10.1007/978-3-663-14540-0_9

  • Hong S and Gerber R. (1993). Compiling real-time programs into schedulable code. ACM SIGPLAN Notices. 28:6. (166-176). Online publication date: 1-Jun-1993.

    https://doi.org/10.1145/173262.155106

  • Adams N, Curtis P and Spreitzer M. (1993). First-class data-type representations in SCHEMEXEROX. ACM SIGPLAN Notices. 28:6. (139-146). Online publication date: 1-Jun-1993.

    https://doi.org/10.1145/173262.155103

  • Anderson J and Lam M. (1993). Global optimizations for parallelism and locality on scalable parallel machines. ACM SIGPLAN Notices. 28:6. (112-125). Online publication date: 1-Jun-1993.

    https://doi.org/10.1145/173262.155101

  • Graham S, Lucco S and Sharp O. (1993). Orchestrating interactions among parallel computations. ACM SIGPLAN Notices. 28:6. (100-111). Online publication date: 1-Jun-1993.

    https://doi.org/10.1145/173262.155100

  • Cytron R and Gershbein R. (1993). Efficient accommodation of may-alias information in SSA form. ACM SIGPLAN Notices. 28:6. (36-45). Online publication date: 1-Jun-1993.

    https://doi.org/10.1145/173262.155094

  • Boyd M and Whalley D. (1993). Isolation and analysis of optimization errors. ACM SIGPLAN Notices. 28:6. (26-35). Online publication date: 1-Jun-1993.

    https://doi.org/10.1145/173262.155093

  • Adl-Tabatabai A and Gross T. (1993). Detection and recovery of endangered variables caused by instruction scheduling. ACM SIGPLAN Notices. 28:6. (13-25). Online publication date: 1-Jun-1993.

    https://doi.org/10.1145/173262.155092

  • Wahbe R, Lucco S and Graham S. (1993). Practical data breakpoints. ACM SIGPLAN Notices. 28:6. (1-12). Online publication date: 1-Jun-1993.

    https://doi.org/10.1145/173262.155091

  • Ramshaw L. (1988). Eliminating go to's while preserving program structure. Journal of the ACM. 35:4. (893-920). Online publication date: 1-Oct-1988.

    https://doi.org/10.1145/48014.48021

  • Iselin E. (1988). Conditional statements, looping constructs, and program comprehension: an experiments study. International Journal of Man-Machine Studies. 28:1. (45-66). Online publication date: 3-Jan-1988.

    https://doi.org/10.1016/S0020-7373(88)80052-X

  • Järvinen P. (1987). On Initialization and Exitialization in Program Design. Empirical Foundations of Information and Software Science III. 10.1007/978-1-4613-1895-8_12. (135-144).

    http://link.springer.com/10.1007/978-1-4613-1895-8_12

  • Cantone G, Cimitile A and Maresca P. (1986). A new methodological proposal for program maintenance. Microprocessing and Microprogramming. 18:1-5. (319-332). Online publication date: 1-Dec-1986.

    https://doi.org/10.1016/0165-6074(86)90060-8

  • Sedlmeyer R, Kearney J, Thompson W, Adler M and Gray M. Problems with software complexity measurement. Proceedings of the 1985 ACM thirteenth annual conference on Computer Science. (340-347).

    https://doi.org/10.1145/320599.320707

  • Ginburg A and Yoeli M. (1985). Reducibility of synchronization structures. Theoretical Computer Science. 10.1016/0304-3975(85)90172-0. 40. (301-314).

    http://linkinghub.elsevier.com/retrieve/pii/0304397585901720

  • Motoki T. (1984). An application of Cohen's result on star height to the theory of control structures. Journal of Computer and System Sciences. 29:3. (312-329). Online publication date: 1-Dec-1984.

    https://doi.org/10.1016/0022-0000(84)90002-3

  • Ramanath M and Solomon M. (1984). Jump Minimization in Linear Time. ACM Transactions on Programming Languages and Systems. 6:4. (527-545). Online publication date: 1-Oct-1984.

    https://doi.org/10.1145/1780.357262

  • Colombetti M and Guida G. (1984). Supporting control definition in programming languages. Computer Languages. 9:1. (1-23). Online publication date: 29-Aug-1984.

    https://doi.org/10.1016/0096-0551(84)90009-2

  • Stoyan H and Görz G. (1984). Literaturverzeichnis. LISP. 10.1007/978-3-642-71455-9_16. (346-350).

    http://www.springerlink.com/index/10.1007/978-3-642-71455-9_16

  • Soloway E, Bonar J and Ehrlich K. (1983). Cognitive strategies and looping constructs. Communications of the ACM. 26:11. (853-860). Online publication date: 1-Nov-1983.

    https://doi.org/10.1145/182.358436

  • Haring G and Schechtner O. (2006). On the realization of extended control structures in FORTRAN. Software: Practice and Experience. 10.1002/spe.4380130505. 13:5. (431-445). Online publication date: 1-May-1983.

    https://onlinelibrary.wiley.com/doi/10.1002/spe.4380130505

  • Lew A. (1982). On the emulation of flowcharts by decision tables. Communications of the ACM. 25:12. (895-905). Online publication date: 1-Dec-1982.

    https://doi.org/10.1145/358728.358739

  • Forman I. Global data flow analysis by decomposition into primes. Proceedings of the 6th international conference on Software engineering. (386-392).

    /doi/10.5555/800254.807781

  • Caio F, Guida G and Somalvico M. (1982). Problem solving as a basis for program synthesis: design and experimentation of the BIS system. International Journal of Man-Machine Studies. 10.1016/S0020-7373(82)80018-7. 17:2. (173-188). Online publication date: 1-Aug-1982.

    http://linkinghub.elsevier.com/retrieve/pii/S0020737382800187

  • Keohane J, Cherniavsky J and Henderson P. (1982). On Transforming Control Structures. SIAM Journal on Computing. 11:2. (268-286). Online publication date: 1-May-1982.

    https://doi.org/10.1137/0211021

  • Birrell A, Levin R, Schroeder M and Needham R. (1982). Grapevine. Communications of the ACM. 25:4. (260-274). Online publication date: 1-Apr-1982.

    https://doi.org/10.1145/358468.358487

  • Spector A. (1982). Performing remote operations efficiently on a local computer network. Communications of the ACM. 25:4. (246-260). Online publication date: 1-Apr-1982.

    https://doi.org/10.1145/358468.358478

  • Mitchell J and Dion J. (1982). A comparison of two network-based file servers. Communications of the ACM. 25:4. (233-245). Online publication date: 1-Apr-1982.

    https://doi.org/10.1145/358468.358475

  • Denning P. (1982). ACM president's letter: are operating systems obsolete?. Communications of the ACM. 25:4. (225-227). Online publication date: 1-Apr-1982.

    https://doi.org/10.1145/358468.358471

  • Ramanath M and Solomon M. Optimal code for control structures. Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (82-94).

    https://doi.org/10.1145/582153.582163

  • Laski J. (1982). Application of the goal invariant to the structuring of programs. ACM SIGPLAN Notices. 17:1. (27-36). Online publication date: 1-Jan-1982.

    https://doi.org/10.1145/947886.947890

  • Fle M and Roucairol G. (1982). On some syntactic equivalences of program schemas and related transformations. International Symposium on Programming. 10.1007/3-540-11494-7_10. (116-131).

    http://link.springer.com/10.1007/3-540-11494-7_10

  • Guida G. (1981). An effective preprocessor for structured FORTRAN: The HENTRAN system. International Journal of Computer & Information Sciences. 10.1007/BF01007885. 10:4. (283-297). Online publication date: 1-Aug-1981.

    http://link.springer.com/10.1007/BF01007885

  • Yau S, Chen-Chau Yang and Shatz S. (1981). An Approach to Distributed Computing System Software Design. IEEE Transactions on Software Engineering. 7:4. (427-436). Online publication date: 1-Jul-1981.

    https://doi.org/10.1109/TSE.1981.230845

  • Baker A and Zweben S. (1980). A Comparison of Measures of Control Flow Complexity. IEEE Transactions on Software Engineering. 6:6. (506-512). Online publication date: 1-Nov-1980.

    https://doi.org/10.1109/TSE.1980.230799

  • Harel D. (1980). On folk theorems. ACM SIGACT News. 12:3. (68-80). Online publication date: 1-Sep-1980.

    https://doi.org/10.1145/1008861.1008869

  • Mekly L and Yau S. (1980). Software Design Representation Using Abstract Process Networks. IEEE Transactions on Software Engineering. 6:5. (420-435). Online publication date: 1-Sep-1980.

    https://doi.org/10.1109/TSE.1980.230490

  • Harel D. (1980). On folk theorems. Communications of the ACM. 23:7. (379-389). Online publication date: 1-Jul-1980.

    https://doi.org/10.1145/358886.358892

  • Rosen B. (1980). Monoids for Rapid Data Flow Analysis. SIAM Journal on Computing. 9:1. (159-196). Online publication date: 1-Feb-1980.

    https://doi.org/10.1137/0209015

  • Culik K. (1980). What is a flowchart loop and about structured programming. ACM SIGPLAN Notices. 15:1. (45-57). Online publication date: 1-Jan-1980.

    https://doi.org/10.1145/954127.954131

  • Mateti P. (1980). Pascal versus C : A subjective comparison. Language Design and Programming Methodology. 10.1007/3-540-09745-7_3. (37-69).

    http://link.springer.com/10.1007/3-540-09745-7_3

  • Anastas M and Vaughan R. (1979). Direct architectural implementation of a requirements-oriented computing structure. ACM SIGMICRO Newsletter. 10:4. (93-100). Online publication date: 1-Dec-1979.

    https://doi.org/10.1145/1014188.803017

  • Hehner E. (1979). do considered od. Acta Informatica. 11:4. (287-304). Online publication date: 1-Dec-1979.

    https://doi.org/10.1007/BF00289091

  • Anastas M and Vaughan R. Direct architectural implementation of a requirements-oriented computing structure. Proceedings of the 12th annual workshop on Microprogramming. (93-100).

    /doi/10.5555/800093.803017

  • Laski J. (1979). On readability of programs with loops. ACM SIGPLAN Notices. 14:11. (73-83). Online publication date: 1-Nov-1979.

    https://doi.org/10.1145/988056.988064

  • Baker B and Kosaraju S. (1979). A Comparison of Multilevel break and next Statements. Journal of the ACM. 26:3. (555-566). Online publication date: 1-Jul-1979.

    https://doi.org/10.1145/322139.322151

  • Cherniavsky J, Keohane J and Henderson P. (1979). A note concerning top down program development and restricted exit control structures. Information Processing Letters. 10.1016/0020-0190(79)90099-1. 9:1. (8-12). Online publication date: 1-Jul-1979.

    http://linkinghub.elsevier.com/retrieve/pii/0020019079900991

  • Gordon R. (1979). Measuring Improvements in Program Clarity. IEEE Transactions on Software Engineering. 5:2. (79-90). Online publication date: 1-Mar-1979.

    https://doi.org/10.1109/TSE.1979.234163

  • Moya R and Ramos I. (1979). SP-Grammars. ACM SIGPLAN Notices. 14:1. (69-76). Online publication date: 1-Jan-1979.

    https://doi.org/10.1145/954051.954057

  • Arsac J. (1979). Syntactic source to source transforms and program manipulation. Communications of the ACM. 22:1. (43-54). Online publication date: 1-Jan-1979.

    https://doi.org/10.1145/359046.359057

  • Baker A and Zweben S. A comparison of measures of control flow complexity COMPSAC 79. Computer Software and The IEEE Computer Society's Third International Applications Conference, 1979.. 10.1109/CMPSAC.1979.762583. . (695-701).

    http://ieeexplore.ieee.org/document/762583/

  • Arsac J, Galtier C, Ruggiu G, Khai T and Vasseur J. (1979). The Edelweiss System. . 10.1016/S0065-2539(08)60307-8. (201-270).

    http://linkinghub.elsevier.com/retrieve/pii/S0065253908603078

  • Elshoff J and Marcotty M. (1978). On the use of the cyclomatic number to measure program complexity. ACM SIGPLAN Notices. 13:12. (29-40). Online publication date: 1-Dec-1978.

    https://doi.org/10.1145/954587.954590

  • Malik K and Lewis T. (1978). Design objectives for high level microprogramming languages. ACM SIGMICRO Newsletter. 9:4. (154-160). Online publication date: 1-Dec-1978.

    https://doi.org/10.1145/1014198.804325

  • Dearholt D and Valdés-Fallis G. (2008). Toward a probabilistic automata model of some aspects of code-switching. Language in Society. 10.1017/S0047404500005807. 7:3. (411-420). Online publication date: 1-Dec-1978.

    https://www.cambridge.org/core/product/identifier/S0047404500005807/type/journal_article

  • Malik K and Lewis T. Design objectives for high level microprogramming languages. Proceedings of the 11th annual workshop on Microprogramming. (154-160).

    /doi/10.5555/800132.804325

  • Hehner E. (1978). On removing the machine from the language. Acta Informatica. 10:3. (229-243). Online publication date: 1-Sep-1978.

    https://doi.org/10.1007/BF00264318

  • Lindstrom G. Control structure aptness. Proceedings of the 3rd international conference on Software engineering. (5-12).

    /doi/10.5555/800099.803184

  • Pratt T. (1978). Control Computations and the Design of Loop Control Structures. IEEE Transactions on Software Engineering. 4:2. (81-89). Online publication date: 1-Mar-1978.

    https://doi.org/10.1109/TSE.1978.231478

  • Weiner L. The roots of structured programming. Papers of the SIGCSE/CSA technical symposium on Computer science education. (243-254).

    https://doi.org/10.1145/990555.990636

  • Weiner L. (1978). The roots of structured programming. ACM SIGCSE Bulletin. 10:1. (243-254). Online publication date: 1-Feb-1978.

    https://doi.org/10.1145/990654.990636

  • Rosen B. Monoids for rapid data flow analysis. Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages. (47-59).

    https://doi.org/10.1145/512760.512767

  • Yaohan Chu . Interprocedure structure The IEEE Computer Society's Second International Computer Software and Applications Conference, 1978. COMPSAC '78.. 10.1109/CMPSAC.1978.810330. . (120-125).

    http://ieeexplore.ieee.org/document/810330/

  • Richard F and Ledgard H. (1977). A reminder for language designers. ACM SIGPLAN Notices. 12:12. (73-82). Online publication date: 1-Dec-1977.

    https://doi.org/10.1145/954618.954623

  • Yasumura M. (1977). Evolution of loop statements. ACM SIGPLAN Notices. 12:9. (124-129). Online publication date: 1-Sep-1977.

    https://doi.org/10.1145/954604.954615

  • Keller R. (1977). On control constructs for constructing programs. ACM SIGPLAN Notices. 12:9. (36-44). Online publication date: 1-Sep-1977.

    https://doi.org/10.1145/954604.954606

  • Woolley J. (1977). Fortran. ACM SIGPLAN Notices. 12:7. (112-125). Online publication date: 1-Jul-1977.

    https://doi.org/10.1145/954639.954649

  • Edwards R. (1977). Is Pascal a logical subset of Algol68 or not? Part One. ACM SIGPLAN Notices. 12:6. (184-191). Online publication date: 1-Jun-1977.

    https://doi.org/10.1145/872738.807161

  • Thomesse J. (1977). A New Set of Software Tools for Designing and Realizing Distributed Systems in Process Control. IFAC Proceedings Volumes. 10.1016/S1474-6670(17)66993-3. 10:4. (47-53). Online publication date: 1-Jun-1977.

    https://linkinghub.elsevier.com/retrieve/pii/S1474667017669933

  • Edwards R. Is Pascal a logical subset of Algol68 or not? Part One. Proceedings of the Strathclyde ALGOL 68 conference. (184-191).

    https://doi.org/10.1145/800238.807161

  • Jensen E and Kain R. (1977). The Honeywell Modular Microprogram Machine. ACM SIGARCH Computer Architecture News. 5:7. (17-28). Online publication date: 17-Mar-1977.

    https://doi.org/10.1145/633615.810648

  • Jensen E and Kain R. The Honeywell Modular Microprogram Machine. Proceedings of the 4th annual symposium on Computer architecture. (17-28).

    https://doi.org/10.1145/800255.810648

  • Lichtman Z. (2006). Interpretation control using a linear tree representation. Software: Practice and Experience. 10.1002/spe.4380070218. 7:2. (275-278). Online publication date: 1-Mar-1977.

    https://onlinelibrary.wiley.com/doi/10.1002/spe.4380070218

  • Hehner E. Structuring. Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages. (201-205).

    https://doi.org/10.1145/512950.512969

  • Rosen B. Applications of high level control flow. Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages. (38-47).

    https://doi.org/10.1145/512950.512955

  • Arsac J. (2011). Emploi de méthodes constructives en programmation. Un dossier : la fonction d'Ackermann. RAIRO. Informatique théorique. 10.1051/ita/1977110200911. 11:2. (91-112).

    http://www.rairo-ita.org/10.1051/ita/1977110200911

  • Newton G and Starkey J. (1977). SESPOOL, a language for systems programming. Computer Languages. 2:3. (75-91). Online publication date: 1-Jan-1977.

    https://doi.org/10.1016/0096-0551(77)90009-1

  • Thomesse J. (1977). A new set of software tools for designing and realizing distributed systems in process control. Annual Review in Automatic Programming. 10.1016/0066-4138(77)90008-8. 8. (47-53). Online publication date: 1-Jan-1977.

    http://linkinghub.elsevier.com/retrieve/pii/0066413877900088

  • Kaposi A. (1977). An engineer's guide to algorithmic structures. Computer-Aided Design. 10.1016/0010-4485(77)90064-1. 9:1. (58-65). Online publication date: 1-Jan-1977.

    http://linkinghub.elsevier.com/retrieve/pii/0010448577900641

  • Richard F and Ledgard H. A reminder for language designers. Design and Implementation of Programming Languages. 10.1007/BFb0021432. (345-389).

    http://link.springer.com/10.1007/BFb0021432

  • Lowther J and Motteler Z. (1976). Teaching good programming techniques. ACM SIGCSE Bulletin. 8:4. (10-11). Online publication date: 1-Dec-1976.

    https://doi.org/10.1145/382222.382457

  • McCabe T. A Complexity Measure. IEEE Transactions on Software Engineering. 10.1109/TSE.1976.233837. SE-2:4. (308-320).

    http://ieeexplore.ieee.org/document/1702388/

  • Maruyama K and Smith S. (1976). Optimal reorganization of distributed space disk files. Communications of the ACM. 19:11. (634-642). Online publication date: 1-Nov-1976.

    https://doi.org/10.1145/360363.360370

  • Eswaran K, Gray J, Lorie R and Traiger I. (1976). The notions of consistency and predicate locks in a database system. Communications of the ACM. 19:11. (624-633). Online publication date: 1-Nov-1976.

    https://doi.org/10.1145/360363.360369

  • Rubin F. (1976). Experiments in text file compression. Communications of the ACM. 19:11. (617-623). Online publication date: 1-Nov-1976.

    https://doi.org/10.1145/360363.360368

  • Wilcox T, Davis A and Tindall M. (1976). The design and implementation of a table driven, interactive diagnostic programming system. Communications of the ACM. 19:11. (609-616). Online publication date: 1-Nov-1976.

    https://doi.org/10.1145/360363.360367

  • Ledgard H and Cave W. (1976). Cobol under control. Communications of the ACM. 19:11. (601-608). Online publication date: 1-Nov-1976.

    https://doi.org/10.1145/360363.360366

  • Chu Y. Introducing a Software Design Language. Proceedings of the 2nd international conference on Software engineering. (297-304).

    /doi/10.5555/800253.807691

  • Welch J. Tab, a Program Design Language for the classroom. Proceedings of the sixth SIGCSE technical symposium on Computer science education. (48-53).

    https://doi.org/10.1145/800144.804754

  • Welch J. (1976). Tab, a Program Design Language for the classroom. ACM SIGCSE Bulletin. 8:3. (48-53). Online publication date: 1-Jul-1976.

    https://doi.org/10.1145/952991.804754

  • Archibald J. A dynamic (FORTRAN) programming system. Proceedings of the June 7-10, 1976, national computer conference and exposition. (917-925).

    https://doi.org/10.1145/1499799.1499924

  • Keller R. A modern beginning programming course. Proceedings of the June 7-10, 1976, national computer conference and exposition. (165-170).

    https://doi.org/10.1145/1499799.1499824

  • Sosa M, Mihm J and Browning T. Product Architecture and Quality: A Study of Open-Source Software Development. SSRN Electronic Journal. 10.2139/ssrn.1657870.

    http://www.ssrn.com/abstract=1657870