Skip header Section
Skip Bibliometrics Section
The Science of ProgrammingJune 1987
- Author:
- David Gries
Abstract
No abstract available.
Cited By
Xue J, Cheng Z, Yang Q, You Z, Hu Q and Xie W Methodology and Platform of IS Code Generation Proceedings of the 2020 International Conference on Big Data in Management, (49-57)- Todorov V, Boulanger F and Taha S Formal verification of automotive embedded software Proceedings of the 6th Conference on Formal Methods in Software Engineering, (84-87)
- Walker H (2018). CLASSROOM VIGNETTESSoftware correctness and usefulness in the classroom, ACM Inroads, 9:1, (28-32), Online publication date: 30-Jan-2018.
- Ahrendt W, Chimento J, Pace G and Schneider G (2017). Verifying data- and control-oriented properties combining static and runtime verification, Formal Methods in System Design, 51:1, (200-265), Online publication date: 1-Aug-2017.
- Pearce D Array programming in Whiley Proceedings of the 4th ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming, (17-24)
- Khaireddine B, Zakharchenko A and Mili A A generic algorithm for program repair Proceedings of the 5th International FME Workshop on Formal Methods in Software Engineering, (65-71)
- Chaudhari D and Damani O (2017). Assumption propagation through annotated programs, Formal Aspects of Computing, 29:3, (495-530), Online publication date: 1-May-2017.
- Cheung A and Solar-Lezama A (2016). Computer-Assisted Query Formulation, Foundations and Trends in Programming Languages, 3:1, (1-94), Online publication date: 1-Jun-2016.
- Ahmadinejad S, Fong P and Safavi-Naini R Privacy and Utility of Inference Control Mechanisms for Social Computing Applications Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, (829-840)
- Walker H (2016). CLASSROOM VIGNETTESTeacher as coach, mentor, listener (part 1?), ACM Inroads, 7:1, (18-21), Online publication date: 12-Feb-2016.
- Pearce D Some usability hypotheses for verification Proceedings of the 6th Workshop on Evaluation and Usability of Programming Languages and Tools, (57-60)
- Drachova S, Hallstrom J, Hollingsworth J, Krone J, Pak R and Sitaraman M (2015). Teaching Mathematical Reasoning Principles for Software Correctness and Its Assessment, ACM Transactions on Computing Education, 15:3, (1-22), Online publication date: 28-Sep-2015.
- Verification condition generation for hybrid systems Proceedings of the 2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign, (238-247)
- Chaudhari D and Damani O Combining Top-Down and Bottom-Up Techniques in Program Derivation Revised Selected Papers of the 25th International Symposium on Logic-Based Program Synthesis and Transformation - Volume 9527, (244-258)
- Larson B (2014). Formal semantics for the PACEMAKER system specification, ACM SIGAda Ada Letters, 34:3, (47-60), Online publication date: 26-Nov-2014.
- Larson B Formal semantics for the PACEMAKER system specification Proceedings of the 2014 ACM SIGAda annual conference on High integrity language technology, (47-60)
- Henzinger T, Jhala R, Majumdar R and McMillan K (2014). Abstractions from proofs, ACM SIGPLAN Notices, 49:4S, (79-91), Online publication date: 1-Jul-2014.
- Furia C, Meyer B and Velder S (2014). Loop invariants, ACM Computing Surveys, 46:3, (1-51), Online publication date: 1-Jan-2014.
- Harris W, Jin G, Lu S and Jha S Validating Library Usage Interactively Proceedings of the 25th International Conference on Computer Aided Verification - Volume 8044, (796-812)
- Li T, Liu W, Mao X and Zhou H Introduction to programming Proceedings of the 18th ACM conference on Innovation and technology in computer science education, (324-324)
- Cheung A, Solar-Lezama A and Madden S (2013). Optimizing database-backed applications with query synthesis, ACM SIGPLAN Notices, 48:6, (3-14), Online publication date: 23-Jun-2013.
- Cheung A, Solar-Lezama A and Madden S Optimizing database-backed applications with query synthesis Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, (3-14)
- Beynon M Realising software development as a lived experience Proceedings of the ACM international symposium on New ideas, new paradigms, and reflections on programming and software, (229-244)
- Interactive verification of synchronous systems Proceedings of the Tenth ACM/IEEE International Conference on Formal Methods and Models for Codesign, (75-84)
- Ball T, Majumdar R, Millstein T and Rajamani S (2012). Automatic predicate abstraction of C programs, ACM SIGPLAN Notices, 47:4a, (37-47), Online publication date: 18-Jun-2012.
- Karfa C, Mandal C and Sarkar D (2012). Formal verification of code motion techniques using data-flow-driven equivalence checking, ACM Transactions on Design Automation of Electronic Systems, 17:3, (1-37), Online publication date: 1-Jun-2012.
- Gesell M and Schneider K A hoare calculus for the verification of synchronous languages Proceedings of the sixth workshop on Programming languages meets program verification, (37-48)
- Suter P, Köksal A and Kuncak V Satisfiability modulo recursive programs Proceedings of the 18th international conference on Static analysis, (298-315)
- Hague M and Lin A Model checking recursive programs with numeric data types Proceedings of the 23rd international conference on Computer aided verification, (743-759)
- Ratcliff S, White D and Clark J Searching for invariants using genetic programming and mutation testing Proceedings of the 13th annual conference on Genetic and evolutionary computation, (1907-1914)
- Srivastava S, Gulwani S, Chaudhuri S and Foster J Path-based inductive synthesis for program inversion Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, (492-503)
- Srivastava S, Gulwani S, Chaudhuri S and Foster J (2011). Path-based inductive synthesis for program inversion, ACM SIGPLAN Notices, 46:6, (492-503), Online publication date: 4-Jun-2011.
- Weißbach M and Zimmermann W Termination analysis of business process workflows Proceedings of the 5th International Workshop on Enhanced Web Service Technologies, (18-25)
- Ferreira J Designing an algorithmic proof of the two-squares theorem Proceedings of the 10th international conference on Mathematics of program construction, (140-156)
- Deneke W, Li W and Thompson C (2010). State driven semantic modeling of operators in ETL workflow, Journal of Computing Sciences in Colleges, 25:5, (27-33), Online publication date: 1-May-2010.
- Srivastava S, Gulwani S and Foster J From program verification to program synthesis Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (313-326)
- Srivastava S, Gulwani S and Foster J (2010). From program verification to program synthesis, ACM SIGPLAN Notices, 45:1, (313-326), Online publication date: 2-Jan-2010.
- Balliu M and Mastroeni I A weakest precondition approach to robustness Transactions on computational science X, (261-297)
- Furia C and Meyer B Inferring loop invariants using postconditions Fields of logic and computation, (277-300)
- Jeannet B, Loginov A, Reps T and Sagiv M (2010). A relational approach to interprocedural shape analysis, ACM Transactions on Programming Languages and Systems, 32:2, (1-52), Online publication date: 1-Jan-2010.
- Louhichi A, Mraihi O, Jilani L, Bsaies K and Mili A Relational Methods in the Analysis of While Loops Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science, (242-259)
- Mili A, Aharon S and Nadkarni C (2009). Mathematics for reasoning about loop functions, Science of Computer Programming, 74:11-12, (989-1020), Online publication date: 1-Nov-2009.
- Zhang A and Xie X Web services semantic model system Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication, (592-595)
- Mili A, Ben Ayed R, Aharon S and Nadkarni C (2009). Harnessing a Refinement Theory to Compute Loop Functions, Electronic Notes in Theoretical Computer Science (ENTCS), 243, (139-155), Online publication date: 1-Jul-2009.
- Blanco J, Losano L, Aguirre N, Novaira M, Permigiani S and Scilingo G (2009). An introductory course on programming based on formal specification and program calculation, ACM SIGCSE Bulletin, 41:2, (31-37), Online publication date: 25-Jun-2009.
- Valmari A Bisimilarity Minimization in O(m logn) Time Proceedings of the 30th International Conference on Applications and Theory of Petri Nets, (123-142)
- Solin K and von Wright J (2009). Enabledness and termination in refinement algebra, Science of Computer Programming, 74:8, (654-668), Online publication date: 1-Jun-2009.
- Morris J, Bunkenburg A and Tyrrell M (2009). Term transformers, ACM Transactions on Programming Languages and Systems, 31:4, (1-42), Online publication date: 1-May-2009.
- Caspersen M and Kolling M (2009). STREAM, ACM Transactions on Computing Education, 9:1, (1-29), Online publication date: 1-Mar-2009.
- Gibbons H (2009). Definite Descriptions and Dijkstra's Odd Powers of Odd Integers Problem, Electronic Notes in Theoretical Computer Science (ENTCS), 225, (83-98), Online publication date: 1-Jan-2009.
- Zingaro D (2008). Another approach for resisting student resistance to formal methods, ACM SIGCSE Bulletin, 40:4, (56-57), Online publication date: 30-Nov-2008.
- Gorbovitski M, Rothamel T, Liu Y and Stoller S Efficient runtime invariant checking Proceedings of the 2008 international workshop on dynamic analysis: held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2008), (43-49)
- Gries D A principled approach to teaching OO first Proceedings of the 39th SIGCSE technical symposium on Computer science education, (31-35)
- Bandyopadhyay A (2008). Weakest precondition based verification tool that models spatial ordering, ACM SIGSOFT Software Engineering Notes, 33:2, (1-5), Online publication date: 1-Mar-2008.
- Gries D (2008). A principled approach to teaching OO first, ACM SIGCSE Bulletin, 40:1, (31-35), Online publication date: 29-Feb-2008.
- Reisig W The Scholten/Dijkstra pebble game played straightly, distributedly, online and reversed Pillars of computer science, (589-595)
- Leivant D Reasoning in dynamic logic about program termination Pillars of computer science, (441-456)
- Lau K (2007). Using SPARK for a beginner's course on reasoning about imperative programs, ACM SIGAda Ada Letters, XXVII:3, (75-78), Online publication date: 17-Nov-2007.
- Braude E Cumulative subgoal fulfillment in software development Proceedings of the 11th IASTED International Conference on Software Engineering and Applications, (480-485)
- Lau K Using SPARK for a beginner's course on reasoning about imperative programs Proceedings of the 2007 ACM international conference on SIGAda annual international conference, (75-78)
- Hillebrand M and Paul W On the architecture of system verification environments Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing, (153-168)
- Hillebrand M and Paul W On the Architecture of System Verification Environments Hardware and Software: Verification and Testing, (153-168)
- Grando M and Mitrana V (2007). A Possible Connection Between Two Theories: Grammar Systems and Concurrent Programming, Fundamenta Informaticae, 76:3, (325-336), Online publication date: 1-Aug-2007.
- Scherpelz E, Lerner S and Chambers C Automatic inference of optimizer flow functions from semantic meanings Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation, (135-145)
- Scherpelz E, Lerner S and Chambers C (2007). Automatic inference of optimizer flow functions from semantic meanings, ACM SIGPLAN Notices, 42:6, (135-145), Online publication date: 10-Jun-2007.
- Lau K (2007). Active learning sheets for a beginner's course on reasoning about imperative programs, ACM SIGCSE Bulletin, 39:1, (198-202), Online publication date: 7-Mar-2007.
- Lau K Active learning sheets for a beginner's course on reasoning about imperative programs Proceedings of the 38th SIGCSE technical symposium on Computer science education, (198-202)
- Grando M and Mitrana V (2007). A Possible Connection Between Two Theories: Grammar Systems and Concurrent Programming, Fundamenta Informaticae, 76:3, (325-336), Online publication date: 1-Mar-2007.
- Ebnenasir A and Cheng B A pattern-based approach for modeling and analyzing error recovery Architecting dependable systems IV, (115-141)
- Ginat D On novices' local views of algorithmic characteristics Proceedings of the 2006 international conference on Informatics in Secondary Schools - Evolution and Perspectives: the Bridge between Using and Understanding Computers, (127-137)
- Caspersen M and Kölling M A novice's process of object-oriented programming Companion to the 21st ACM SIGPLAN symposium on Object-oriented programming systems, languages, and applications, (892-900)
- Kienzle J and Sendall S Addressing concurrency in object-oriented software development Proceedings of the 2006 conference of the Center for Advanced Studies on Collaborative research, (15-es)
- Dony I and Le Charlier B (2006). A tool for helping teach a programming method, ACM SIGCSE Bulletin, 38:3, (212-216), Online publication date: 26-Sep-2006.
- Kroening D and Weissenbacher G Counterexamples with loops for predicate abstraction Proceedings of the 18th international conference on Computer Aided Verification, (152-165)
- Bird R Improving saddleback search Proceedings of the 8th international conference on Mathematics of Program Construction, (82-89)
- Backhouse R and Michaelis D Exercises in quantifier manipulation Proceedings of the 8th international conference on Mathematics of Program Construction, (69-81)
- Solin K and von Wright J Refinement algebra with operators for enabledness and termination Proceedings of the 8th international conference on Mathematics of Program Construction, (397-415)
- Dony I and Le Charlier B A tool for helping teach a programming method Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education, (212-216)
- Evans D and Peck M Inculcating invariants in introductory courses Proceedings of the 28th international conference on Software engineering, (673-678)
- Semé D A CGM algorithm solving the longest increasing subsequence problem Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V, (10-21)
- Clarke L and Rosenblum D (2006). A historical perspective on runtime assertion checking in software development, ACM SIGSOFT Software Engineering Notes, 31:3, (25-37), Online publication date: 1-May-2006.
- Bingham J and Rakamarić Z A logic and decision procedure for predicate abstraction of heap-manipulating programs Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation, (207-221)
- Jones C (2006). Reasoning About Partial Functions in the Formal Development of Programs, Electronic Notes in Theoretical Computer Science (ENTCS), 145, (3-25), Online publication date: 1-Jan-2006.
- Liu Y, Stoller S, Gorbovitski M, Rothamel T and Liu Y Incrementalization across object abstraction Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (473-486)
- Liu Y, Stoller S, Gorbovitski M, Rothamel T and Liu Y (2005). Incrementalization across object abstraction, ACM SIGPLAN Notices, 40:10, (473-486), Online publication date: 12-Oct-2005.
- Yi X, Wang J and Yang X Verification of C Programs using Slicing Execution Proceedings of the Fifth International Conference on Quality Software, (109-116)
- van Ditmarsch H, van der Hoek W and Kooi B Dynamic epistemic logic with assignment Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, (141-148)
- Ralston A (2005). Do we need ANY mathematics in computer science curricula?, ACM SIGCSE Bulletin, 37:2, (6-9), Online publication date: 1-Jun-2005.
- Dougherty J and Wonnacott D Use and assessment of a rigorous approach to CS1 Proceedings of the 36th SIGCSE technical symposium on Computer science education, (251-255)
- Dougherty J and Wonnacott D (2005). Use and assessment of a rigorous approach to CS1, ACM SIGCSE Bulletin, 37:1, (251-255), Online publication date: 23-Feb-2005.
- Bruce K (2004). Controversy on how to teach CS 1, ACM SIGCSE Bulletin, 36:4, (29-34), Online publication date: 1-Dec-2004.
- Ball T A theory of predicate-complete test coverage and generation Proceedings of the Third international conference on Formal Methods for Components and Objects, (1-22)
- Ginat D (2004). Embedding instructive assertions in program design, ACM SIGCSE Bulletin, 36:3, (62-66), Online publication date: 1-Sep-2004.
- Ahlgren B, Brunner M, Eggert L, Hancock R and Schmid S Invariants Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture, (65-70)
- Dor N, Adams S, Das M and Yang Z Software validation via scalable path-sensitive value flow analysis Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis, (12-22)
- Dor N, Adams S, Das M and Yang Z (2004). Software validation via scalable path-sensitive value flow analysis, ACM SIGSOFT Software Engineering Notes, 29:4, (12-22), Online publication date: 1-Jul-2004.
- Bruce K Controversy on how to teach CS 1 Working group reports from ITiCSE on Innovation and technology in computer science education, (29-34)
- Ginat D Embedding instructive assertions in program design Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education, (62-66)
- Ginat D (2004). Algorithmic patterns and the case of the sliding delta, ACM SIGCSE Bulletin, 36:2, (29-33), Online publication date: 1-Jun-2004.
- Henkel J and Diwan A A Tool for Writing and Debugging Algebraic Specifications Proceedings of the 26th International Conference on Software Engineering, (449-458)
- Leow W, Khoo S and Sun Y Automated Generation of Test Programs from Closed Specifications of Classes and Test Cases Proceedings of the 26th International Conference on Software Engineering, (96-105)
- Henzinger T, Jhala R, Majumdar R and McMillan K Abstractions from proofs Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (232-244)
- Henzinger T, Jhala R, Majumdar R and McMillan K (2004). Abstractions from proofs, ACM SIGPLAN Notices, 39:1, (232-244), Online publication date: 1-Jan-2004.
- Lau T, Domingos P and Weld D Learning programs from traces using version space algebra Proceedings of the 2nd international conference on Knowledge capture, (36-43)
- Gegg-Harrison T, Bunce G, Ganetzky R, Olson C and Wilson J (2003). Studying program correctness by constructing contracts, ACM SIGCSE Bulletin, 35:3, (129-133), Online publication date: 1-Sep-2003.
- Gegg-Harrison T, Bunce G, Ganetzky R, Olson C and Wilson J Studying program correctness by constructing contracts Proceedings of the 8th annual conference on Innovation and technology in computer science education, (129-133)
- Ammons G, Mandelin D, Bodík R and Larus J Debugging temporal specifications with concept analysis Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation, (182-195)
- Hazzan O (2003). Application of computer science ideas to the presentation of mathematical theorems and proofs, ACM SIGCSE Bulletin, 35:2, (38-42), Online publication date: 1-Jun-2003.
- Ammons G, Mandelin D, Bodík R and Larus J (2003). Debugging temporal specifications with concept analysis, ACM SIGPLAN Notices, 38:5, (182-195), Online publication date: 9-May-2003.
- Jones C (2003). The Early Search for Tractable Ways of Reasoning about Programs, IEEE Annals of the History of Computing, 25:2, (26-49), Online publication date: 1-Apr-2003.
- Schmidt D Programming language semantics Encyclopedia of Computer Science, (1463-1466)
- London R and Craigen D Program verification Encyclopedia of Computer Science, (1458-1461)
- Gries D Loop invariant Encyclopedia of Computer Science, (1038-1040)
- Gries D (2002). Where is programming methodology these days?, ACM SIGCSE Bulletin, 34:4, (5-7), Online publication date: 1-Dec-2002.
- Wijesekera D and Jajodia S Policy algebras for access control the predicate case Proceedings of the 9th ACM conference on Computer and communications security, (171-180)
- Bettini C, Jajodia S, Wang X and Wijesekera D Provisions and obligations in policy management and security applications Proceedings of the 28th international conference on Very Large Data Bases, (502-513)
- Deng X, Dwyer M, Hatcliff J and Mizuno M Invariant-based specification, synthesis, and verification of synchronization in concurrent programs Proceedings of the 24th International Conference on Software Engineering, (442-452)
- Roman G, Julien C and Huang Q Formal Specification and Design of Mobile Systems Proceedings of the 16th International Parallel and Distributed Processing Symposium
- Kaivola R and Narasimhan N Formal Verification of the Pentium® 4 Floating-Point Multiplier Proceedings of the conference on Design, automation and test in Europe
- Henzinger T, Jhala R, Majumdar R and Sutre G Lazy abstraction Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (58-70)
- Abramov S and Glück R Principles of inverse computation and the Universal resolving algorithm The essence of computation, (269-295)
- Bird R, Gibbons J and Mu S Algebraic methods for optimization problems Algebraic and coalgebraic methods in the mathematics of program construction, (281-308)
- Doornbos H and Backhouse R Algebra of program termination Algebraic and coalgebraic methods in the mathematics of program construction, (203-235)
- Henzinger T, Jhala R, Majumdar R and Sutre G (2002). Lazy abstraction, ACM SIGPLAN Notices, 37:1, (58-70), Online publication date: 1-Jan-2002.
- Henderson P, Baldwin D, Dasigi V, Dupras M, Fritz J, Ginat D, Goelman D, Hamer J, Hitchner L, Lloyd W, Marion B, Riedesel C and Walker H (2001). Striving for mathematical thinking, ACM SIGCSE Bulletin, 33:4, (114-124), Online publication date: 1-Dec-2001.
- Ginat D (2001). Starting top-down, refining bottom-up, sharpening by zoom-in, ACM SIGCSE Bulletin, 33:4, (28-31), Online publication date: 1-Dec-2001.
- Henderson P, Baldwin D, Dasigi V, Dupras M, Fritz J, Ginat D, Goelman D, Hamer J, Hitchner L, Lloyd W, Marion B, Riedesel C and Walker H Striving for mathematical thinking Working group reports from ITiCSE on Innovation and technology in computer science education, (114-124)
- Pucella R (2001). Review of Dynamic Logic (Foundations of Computing), ACM SIGACT News, 32:4, (9-17), Online publication date: 1-Dec-2001.
- Ernst M Summary of Dynamically discovering likely program invariants Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
- Narasimhan N, Teica E, Radhakrishnan R, Govindarajan S and Vemuri R (2001). Theorem Proving Guided Development of Formal Assertions in a Resource-Constrained Scheduler for High-Level Synthesis, Formal Methods in System Design, 19:3, (237-273), Online publication date: 1-Oct-2001.
- Jilani L, Desharnais J and Mili A (2001). Defining and Applying Measures of Distance Between Specifications, IEEE Transactions on Software Engineering, 27:8, (673-703), Online publication date: 1-Aug-2001.
- Møller A and Schwartzbach M The pointer assertion logic engine Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, (221-231)
- Ball T, Majumdar R, Millstein T and Rajamani S Automatic predicate abstraction of C programs Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, (203-213)
- Dagdilelis V and Satratzemi M (2001). Post's Machine, Education and Information Technologies, 6:2, (123-141), Online publication date: 1-Jun-2001.
- Møller A and Schwartzbach M (2001). The pointer assertion logic engine, ACM SIGPLAN Notices, 36:5, (221-231), Online publication date: 1-May-2001.
- Ball T, Majumdar R, Millstein T and Rajamani S (2001). Automatic predicate abstraction of C programs, ACM SIGPLAN Notices, 36:5, (203-213), Online publication date: 1-May-2001.
- Hwang Y and Rine D Algorithms to detect chained-inference faults in information distribution systems Proceedings of the 2001 ACM symposium on Applied computing, (679-685)
- Chung I, Lee W, Yoon G and Kwon Y Program slicing based on specification Proceedings of the 2001 ACM symposium on Applied computing, (605-609)
- Ernst M, Cockrell J, Griswold W and Notkin D (2001). Dynamically Discovering Likely Program Invariants to Support Program Evolution, IEEE Transactions on Software Engineering, 27:2, (99-123), Online publication date: 1-Feb-2001.
- Ireland A and Stark J (2001). Proof planning for strategy development, Annals of Mathematics and Artificial Intelligence, 29:1-4, (65-97), Online publication date: 10-Jan-2001.
- Liu Y (2000). Efficiency by Incrementalization, Higher-Order and Symbolic Computation, 13:4, (289-313), Online publication date: 1-Dec-2000.
- van Lamsweerde A and Letier E (2000). Handling Obstacles in Goal-Oriented Requirements Engineering, IEEE Transactions on Software Engineering, 26:10, (978-1005), Online publication date: 1-Oct-2000.
- Okasaki C (2000). Breadth-first numbering, ACM SIGPLAN Notices, 35:9, (131-136), Online publication date: 1-Sep-2000.
- Okasaki C Breadth-first numbering Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, (131-136)
- Lev-Ami T, Reps T, Sagiv M and Wilhelm R (2000). Putting static analysis to work for verification, ACM SIGSOFT Software Engineering Notes, 25:5, (26-38), Online publication date: 1-Sep-2000.
- Lev-Ami T, Reps T, Sagiv M and Wilhelm R Putting static analysis to work for verification Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis, (26-38)
- Cavalcanti A and Naumann D (2000). A Weakest Precondition Semantics for Refinement of Object-Oriented Programs, IEEE Transactions on Software Engineering, 26:8, (713-728), Online publication date: 1-Aug-2000.
- Aagaard M, Jones R, Kaivola R, Kohatsu K and Seger C Formal verification of iterative algorithms in microprocessors Proceedings of the 37th Annual Design Automation Conference, (201-206)
- Ernst M, Czeisler A, Griswold W and Notkin D Quickly detecting relevant program invariants Proceedings of the 22nd international conference on Software engineering, (449-458)
- Lamsweerde A Formal specification Proceedings of the Conference on The Future of Software Engineering, (147-159)
- Armando A, Smaill A and Green I (1999). Automatic Synthesis of Recursive Programs, Automated Software Engineering, 6:4, (329-356), Online publication date: 1-Oct-1999.
- Ernst M, Cockrell J, Griswold W and Notkin D Dynamically discovering likely program invariants to support program evolution Proceedings of the 21st international conference on Software engineering, (213-224)
- Siddiqi J, Morrey I, Hibberd R and Buckberry G (1999). Understanding and exploring formal specifications, Annals of Software Engineering, 6:1-4, (411-432), Online publication date: 1-Apr-1999.
- Bjørner D and Cuéllar J (1999). Software engineering education, Annals of Software Engineering, 6:1-4, (365-409), Online publication date: 1-Apr-1999.
- Penix J and Alexander P (1999). Efficient Specification-Based Component Retrieval, Automated Software Engineering, 6:2, (139-170), Online publication date: 1-Apr-1999.
- Srinivasan A (1999). A Study of Two Sampling Methods for Analyzing Large Datasets with ILP, Data Mining and Knowledge Discovery, 3:1, (95-123), Online publication date: 1-Mar-1999.
- Gibbons J and Jones G (1998). The under-appreciated unfold, ACM SIGPLAN Notices, 34:1, (273-279), Online publication date: 1-Jan-1999.
- van Lamsweerde A and Willemet L (1998). Inferring Declarative Requirements Specifications from Operational Scenarios, IEEE Transactions on Software Engineering, 24:12, (1089-1114), Online publication date: 1-Dec-1998.
- van Lamsweerde A, Letier E and Darimont R (1998). Managing Conflicts in Goal-Driven Requirements Engineering, IEEE Transactions on Software Engineering, 24:11, (908-926), Online publication date: 1-Nov-1998.
- Cheng B A Discussion About Integrated Techniques Proceedings of the Second IEEE Workshop on Industrial Strength Formal Specification Techniques
- Jacobs B, van den Berg J, Huisman M, van Berkum M, Hensel U and Tews H (1998). Reasoning about Java classes, ACM SIGPLAN Notices, 33:10, (329-340), Online publication date: 1-Oct-1998.
- Jacobs B, van den Berg J, Huisman M, van Berkum M, Hensel U and Tews H Reasoning about Java classes Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (329-340)
- Gibbons J and Jones G The under-appreciated unfold Proceedings of the third ACM SIGPLAN international conference on Functional programming, (273-279)
- Arora A and Kulkarni S (1998). Designing Masking Fault-Tolerance via Nonmasking Fault-Tolerance, IEEE Transactions on Software Engineering, 24:6, (435-450), Online publication date: 1-Jun-1998.
- van Lamsweerde A and Letier E Integrating obstacles in goal-driven requirements engineering Proceedings of the 20th international conference on Software engineering, (53-62)
- Arora A and Kulkarni S (1998). Component Based Design of Multitolerant Systems, IEEE Transactions on Software Engineering, 24:1, (63-78), Online publication date: 1-Jan-1998.
- Boucher A (1997). Parallel Machines, Minds and Machines, 7:4, (543-551), Online publication date: 1-Nov-1997.
- Bogoiavlenski I, Clear A, Davies G, Flack H, Myers J, Rasala R, Goldweber M and Impagliazzo J (1997). Historical perspectives on the computing curriculum, ACM SIGCUE Outlook, 25:4, (94-111), Online publication date: 1-Oct-1997.
- Wong K (1997). Active message logical routing verification, ACM SIGICE Bulletin, 23:2, (2-24), Online publication date: 1-Oct-1997.
- Daugherty G Unification of the Models for Types, Classes and State Machines Proceedings of the Workshops on Object-Oriented Technology, (169-172)
- Goldweber M, Impagliazzo J, Bogoiavlenski I, Clear A, Davies G, Flack H, Myers J and Rasala R Historical perspectives on the computing curriculum (report of the ITiCSE '97 working group on historical perspectives in computing education) The supplemental proceedings of the conference on Integrating technology into computer science education: working group reports and supplemental proceedings, (94-111)
- Griffin T and Hull R (1997). A framework for implementing hypothetical queries, ACM SIGMOD Record, 26:2, (231-242), Online publication date: 1-Jun-1997.
- Griffin T and Hull R A framework for implementing hypothetical queries Proceedings of the 1997 ACM SIGMOD international conference on Management of data, (231-242)
- Wang C and Musser D (1997). Dynamic Verification of C++ Generic Algorithms, IEEE Transactions on Software Engineering, 23:5, (314-323), Online publication date: 1-May-1997.
- Matsuura S, Kuruma H and Honiden S (1997). EVA, IEEE Transactions on Software Engineering, 23:5, (296-313), Online publication date: 1-May-1997.
- Gersting J and Young F (1997). Content + experiences = curriculum, ACM SIGCSE Bulletin, 29:1, (325-329), Online publication date: 1-Mar-1997.
- Gersting J and Young F Content + experiences = curriculum Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education, (325-329)
- Dick S and Santen T (1997). Searching for a Global Search Algorithm, Automated Software Engineering, 4:1, (7-31), Online publication date: 1-Jan-1997.
- Blakley B The Emperor's old armor Proceedings of the 1996 workshop on New security paradigms, (2-16)
- Ward M (1996). Derivation of Data Intensive Algorithms by Formal Transformation, IEEE Transactions on Software Engineering, 22:9, (665-686), Online publication date: 1-Sep-1996.
- Okasaki C (1996). The role of lazy evaluation in amortized data structures, ACM SIGPLAN Notices, 31:6, (62-72), Online publication date: 15-Jun-1996.
- Okasaki C The role of lazy evaluation in amortized data structures Proceedings of the first ACM SIGPLAN international conference on Functional programming, (62-72)
- Colby L, Griffin T, Libkin L, Mumick I and Trickey H (1996). Algorithms for deferred view maintenance, ACM SIGMOD Record, 25:2, (469-480), Online publication date: 1-Jun-1996.
- Libkin L, Machlin R and Wong L (1996). A query language for multidimensional arrays, ACM SIGMOD Record, 25:2, (228-239), Online publication date: 1-Jun-1996.
- Colby L, Griffin T, Libkin L, Mumick I and Trickey H Algorithms for deferred view maintenance Proceedings of the 1996 ACM SIGMOD international conference on Management of data, (469-480)
- Libkin L, Machlin R and Wong L A query language for multidimensional arrays Proceedings of the 1996 ACM SIGMOD international conference on Management of data, (228-239)
- Abd-El-Hafiz S and Basili V (1996). A Knowledge-Based Approach to the Analysis of Loops, IEEE Transactions on Software Engineering, 22:5, (339-360), Online publication date: 1-May-1996.
- Ginat D (1996). Efficiency of algorithms for programming beginners, ACM SIGCSE Bulletin, 28:1, (256-260), Online publication date: 1-Mar-1996.
- Denman R (1996). Derivation of recursive algorithms for CS2, ACM SIGCSE Bulletin, 28:1, (9-13), Online publication date: 1-Mar-1996.
- Ginat D Efficiency of algorithms for programming beginners Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education, (256-260)
- Denman R Derivation of recursive algorithms for CS2 Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education, (9-13)
- Reeves S A Teaching and Support Tool for Building Formal Models of Graphical User-Interfaces Proceedings of the 1996 International Conference on Software Engineering: Education and Practice (SE:EP '96)
- Liu Y, Stoller S and Teitelbaum T Discovering auxiliary information for incremental computation Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (157-170)
- Raccoon L (1995). The chaos strategy, ACM SIGSOFT Software Engineering Notes, 20:5, (40-47), Online publication date: 1-Dec-1995.
- Kaplan H and Tarjan R Persistent lists with catenation via recursive slow-down Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, (93-102)
- Ng F, Butler G and Kay J (1995). An Intelligent Tutoring System for the Dijkstra-Gries Methodology, IEEE Transactions on Software Engineering, 21:5, (415-428), Online publication date: 1-May-1995.
- Gamble R (1995). Integrating a formal specification course with a software projects course via an editing tool, ACM SIGCSE Bulletin, 27:1, (312-316), Online publication date: 15-Mar-1995.
- Wadkins J (1995). Rigorous proofs of program correctness without formal logic, ACM SIGCSE Bulletin, 27:1, (307-311), Online publication date: 15-Mar-1995.
- Ginat D (1995). Loop invariants and mathematical games, ACM SIGCSE Bulletin, 27:1, (263-267), Online publication date: 15-Mar-1995.
- Gamble R Integrating a formal specification course with a software projects course via an editing tool Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education, (312-316)
- Wadkins J Rigorous proofs of program correctness without formal logic Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education, (307-311)
- Ginat D Loop invariants and mathematical games Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education, (263-267)
- Khrabrov A (1995). An Ada-like separate compilation style in C, ACM SIGAda Ada Letters, XV:2, (23-30), Online publication date: 1-Mar-1995.
- Raccoon L (1995). The chaos model and the chaos cycle, ACM SIGSOFT Software Engineering Notes, 20:1, (55-66), Online publication date: 1-Jan-1995.
- Wong K and McBride R Specification and verification of learning Proceedings of the 1994 ACM symposium on Applied computing, (6-9)
- Lau K, Bush V and Jinks P (1994). Towards an introductory formal programming course, ACM SIGCSE Bulletin, 26:1, (121-125), Online publication date: 12-Mar-1994.
- Denman R, Naumann D, Potter W and Richter G (1994). Derivation of programs for freshmen, ACM SIGCSE Bulletin, 26:1, (116-120), Online publication date: 12-Mar-1994.
- Kortright L (1994). From specific problem instances to algorithms in the introductory course, ACM SIGCSE Bulletin, 26:1, (71-75), Online publication date: 12-Mar-1994.
- Lau K, Bush V and Jinks P Towards an introductory formal programming course Proceedings of the twenty-fifth SIGCSE symposium on Computer science education, (121-125)
- Denman R, Naumann D, Potter W and Richter G Derivation of programs for freshmen Proceedings of the twenty-fifth SIGCSE symposium on Computer science education, (116-120)
- Kortright L From specific problem instances to algorithms in the introductory course Proceedings of the twenty-fifth SIGCSE symposium on Computer science education, (71-75)
- Bar-David T (1994). Object oriented librarianship, ACM SIGPLAN OOPS Messenger, 5:1, (1-5), Online publication date: 1-Jan-1994.
- Turpin R A logical approach to data structures Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering, (138-148)
- Turpin R (1993). A logical approach to data structures, ACM SIGSOFT Software Engineering Notes, 18:5, (138-148), Online publication date: 1-Dec-1993.
- Brown D (1993). Discrete mathematics II, ACM SIGCSE Bulletin, 25:4, (13-17), Online publication date: 1-Dec-1993.
- Arora A and Gouda M (1993). Closure and Convergence, IEEE Transactions on Software Engineering, 19:11, (1015-1027), Online publication date: 1-Nov-1993.
- Chuang T and Goldberg B Real-time deques, multihead Turing machines, and purely functional programming Proceedings of the conference on Functional programming languages and computer architecture, (289-298)
- Terwilliger R (1993). Toward tools to support the Gries/Dijkstra design process, ACM SIGSOFT Software Engineering Notes, 18:2, (50-59), Online publication date: 1-Apr-1993.
- Bergin J (1992). The object-oriented data structures course, ACM SIGPLAN OOPS Messenger, 4:2, (277-284), Online publication date: 1-Apr-1993.
- Kimm H Program transformation for the longest upsequence set problem Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, (609-613)
- Banâtre J and Le Métayer D (1993). Programming by multiset transformation, Communications of the ACM, 36:1, (98-111), Online publication date: 1-Jan-1993.
- Bergin J The object-oriented data structures course Addendum to the proceedings on Object-oriented programming systems, languages, and applications (Addendum), (277-284)
- Rösel A and Bailes P (1992). Identifying foundations of software engineering expertise, ACM SIGCSE Bulletin, 24:4, (52-64), Online publication date: 1-Dec-1992.
- Klarlund N Progress measures and stack assertions for fair termination Proceedings of the eleventh annual ACM symposium on Principles of distributed computing, (229-240)
- Jacob J (1992). Basic Theorems about Security, Journal of Computer Security, 1:3-4, (385-411), Online publication date: 1-May-1992.
- Li J Improvements to systematic program development Proceedings of the 30th annual ACM Southeast Regional Conference, (308-311)
- Romanenko A (1991). Inversion and metacomputation, ACM SIGPLAN Notices, 26:9, (12-22), Online publication date: 1-Sep-1991.
- Höft H (1991). Implementation of a non-deterministic loop, ACM SIGCSE Bulletin, 23:2, (24-28), Online publication date: 1-May-1991.
- Romanenko A Inversion and metacomputation Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (12-22)
- Pleasant J Systematic program development/proof using Dromey's method Proceedings of the 19th annual conference on Computer Science, (169-173)
- Maris J and Schroeder C Precursor for parallel development Proceedings of the 19th annual conference on Computer Science, (85-93)
- Whaley T (1991). A framework for program verification in the context of linked structures and pointer variables, ACM SIGCSE Bulletin, 23:1, (119-123), Online publication date: 1-Mar-1991.
- Astrachan O (1991). Pictures as invariants, ACM SIGCSE Bulletin, 23:1, (112-118), Online publication date: 1-Mar-1991.
- Whaley T A framework for program verification in the context of linked structures and pointer variables Proceedings of the twenty-second SIGCSE technical symposium on Computer science education, (119-123)
- Astrachan O Pictures as invariants Proceedings of the twenty-second SIGCSE technical symposium on Computer science education, (112-118)
- Bagherzadeh N, Heng S and Wu C (1991). A Parallel Asynchronous Garbage Collection Algorithm for Distributed Systems, IEEE Transactions on Knowledge and Data Engineering, 3:1, (100-107), Online publication date: 1-Mar-1991.
- Hvorecký J (1990). On a connection between programming and mathematics, ACM SIGCSE Bulletin, 22:4, (53-54), Online publication date: 1-Nov-1990.
- Garlan D (1990). The role of formal reusable frameworks, ACM SIGSOFT Software Engineering Notes, 15:4, (42-44), Online publication date: 1-Sep-1990.
- Garlan D The role of formal reusable frameworks Conference proceedings on Formal methods in software development, (42-44)
- Leveson N, Cha S, Knight J and Shimeall T (1990). The Use of Self Checks and Voting in Software Error Detection, IEEE Transactions on Software Engineering, 16:4, (432-443), Online publication date: 1-Apr-1990.
- Myers J The central role of mathematical logic in computer science Proceedings of the twenty-first SIGCSE technical symposium on Computer science education, (22-26)
- Henderson P Discrete mathematics as a precursor to programming Proceedings of the twenty-first SIGCSE technical symposium on Computer science education, (17-21)
- Myers J (1990). The central role of mathematical logic in computer science, ACM SIGCSE Bulletin, 22:1, (22-26), Online publication date: 1-Feb-1990.
- Henderson P (1990). Discrete mathematics as a precursor to programming, ACM SIGCSE Bulletin, 22:1, (17-21), Online publication date: 1-Feb-1990.
- Chen W A formal approach to program inversion Proceedings of the 1990 ACM annual conference on Cooperation, (398-403)
- van de Snepscheut J and Swenker J (1989). On the design of some systolic algorithms, Journal of the ACM, 36:4, (826-840), Online publication date: 1-Oct-1989.
- Etkin J and Zinky J (1989). Development Life Cycle of Computer Networks, IEEE Transactions on Software Engineering, 15:9, (1078-1089), Online publication date: 1-Sep-1989.
- Merritt S (1989). A top down unification of minimum cost spanning tree algorithms, ACM SIGCOMM Computer Communication Review, 19:4, (116-127), Online publication date: 1-Aug-1989.
- Merritt S A top down unification of minimum cost spanning tree algorithms Symposium proceedings on Communications architectures & protocols, (116-127)
- Ramsey N (1989). Developing formally verified Ada programs, ACM SIGSOFT Software Engineering Notes, 14:3, (257-265), Online publication date: 1-May-1989.
- Miriyala K and Harandi M (1989). Analogical approach to specification derivation, ACM SIGSOFT Software Engineering Notes, 14:3, (203-210), Online publication date: 1-May-1989.
- Ramsey N Developing formally verified Ada programs Proceedings of the 5th international workshop on Software specification and design, (257-265)
- Miriyala K and Harandi M Analogical approach to specification derivation Proceedings of the 5th international workshop on Software specification and design, (203-210)
- Blivens M and Soffa M Reuse of compiler analysis in a programming environment Proceedings of the 17th conference on ACM Annual Computer Science Conference, (368-373)
- Luker P (1989). Never mind the language, what about the paradigm?, ACM SIGCSE Bulletin, 21:1, (252-256), Online publication date: 1-Feb-1989.
- Gumb R (1989). A first course in program verification and the semantics of programming languages, ACM SIGCSE Bulletin, 21:1, (146-150), Online publication date: 1-Feb-1989.
- Mitchell W (1989). What is to become of programming?, ACM SIGCSE Bulletin, 21:1, (131-135), Online publication date: 1-Feb-1989.
- Luker P Never mind the language, what about the paradigm? Proceedings of the twentieth SIGCSE technical symposium on Computer science education, (252-256)
- Gumb R A first course in program verification and the semantics of programming languages Proceedings of the twentieth SIGCSE technical symposium on Computer science education, (146-150)
- Mitchell W What is to become of programming? Proceedings of the twentieth SIGCSE technical symposium on Computer science education, (131-135)
- Guaspari D Penelope, an Ada verification system Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment, (216-224)
- Holt R and Cordy J (1988). The Turing programming language, Communications of the ACM, 31:12, (1410-1423), Online publication date: 1-Dec-1988.
- Manber U (1988). Using induction to design algorithms, Communications of the ACM, 31:11, (1300-1313), Online publication date: 1-Nov-1988.
- Shepherd D (1988). Using mathematical logic and formal methods to write correct microcode, ACM SIGMICRO Newsletter, 19:1-2, (60-64), Online publication date: 1-Jun-1988.
- Damm W (1988). A Microprogramming Logic, IEEE Transactions on Software Engineering, 14:5, (559-574), Online publication date: 1-May-1988.
- Terwilliger R and Campbell R An early report on encompass Proceedings of the 10th international conference on Software engineering, (344-354)
- Craigen D, Kromodimoeljo S, Meisels I, Neilson A, Pase B and Saaltink M m-EVES: A tool for verifying software Proceedings of the 10th international conference on Software engineering, (324-333)
- Cherniak C (1988). Undebuggability and cognitive science, Communications of the ACM, 31:4, (402-412), Online publication date: 1-Apr-1988.
- Zahn C (1988). A phased programming paradigm, ACM SIGCSE Bulletin, 20:1, (9-12), Online publication date: 1-Feb-1988.
- Collins W (1988). The trouble with for-loop invariants, ACM SIGCSE Bulletin, 20:1, (1-4), Online publication date: 1-Feb-1988.
- Zahn C A phased programming paradigm Proceedings of the nineteenth SIGCSE technical symposium on Computer science education, (9-12)
- Collins W The trouble with for-loop invariants Proceedings of the nineteenth SIGCSE technical symposium on Computer science education, (1-4)
- Dromey R (1988). Systematic Program Development, IEEE Transactions on Software Engineering, 14:1, (12-29), Online publication date: 1-Jan-1988.
- Fullerton J (1987). An alternate design for Fortran 8X, ACM SIGPLAN Fortran Forum, 6:3, (31-40), Online publication date: 1-Dec-1987.
- Ashbacher C (1987). Two undergraduate courses in the theory of computation, ACM SIGCSE Bulletin, 19:4, (25-26), Online publication date: 1-Dec-1987.
- Agüero U and Sasgupta S (1987). A plausibility-driven approach to computer architecture design, Communications of the ACM, 30:11, (922-932), Online publication date: 1-Nov-1987.
- Hoare C, Hayes I, Jifeng H, Morgan C, Roscoe A, Sanders J, Sorensen I, Spivey J and Sufrin B (1987). Laws of programming, Communications of the ACM, 30:8, (672-686), Online publication date: 1-Aug-1987.
- Tech Correspondence C (1987). Technical correspondence, Communications of the ACM, 30:7, (632-634), Online publication date: 1-Jul-1987.
- Serbanati L Interform: a CAD system for program development Proceedings of the 9th international conference on Software Engineering, (190-197)
- Mills H, Basili V, Gannon J and Hamlet R Teaching principles of computer programming Proceedings of the 15th annual conference on Computer Science, (336-341)
- Berzins V, Gray M and Naumann D (1986). Abstraction-based software development, Communications of the ACM, 29:5, (402-415), Online publication date: 1-May-1986.
- Jarke M, Linnemann V and Schmidt J Data constructors Proceedings of the 11th international conference on Very Large Data Bases - Volume 11, (227-240)
- Kant E Understanding and automating algorithm design Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2, (1243-1253)
- Gries D and Prins J (1985). A new notion of encapsulation, ACM SIGPLAN Notices, 20:7, (131-139), Online publication date: 1-Jul-1985.
- Gries D and Prins J A new notion of encapsulation Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments, (131-139)
- Gerth R Transition logic Proceedings of the sixteenth annual ACM symposium on Theory of computing, (39-50)
- Damm W An axiomatization of low-level parallelism in microarchitectures Proceedings of the 17th annual workshop on Microprogramming, (314-323)
- Damm W (1984). An axiomatization of low-level parallelism in microarchitectures, ACM SIGMICRO Newsletter, 15:4, (314-323), Online publication date: 1-Dec-1984.
- Grant J (1984). A course in applied logic, ACM SIGCSE Bulletin, 16:3, (26-28), Online publication date: 1-Sep-1984.
- Chyou S Structure charts and program correctness proofs Proceedings of the 7th international conference on Software engineering, (486-498)
- Merrill G (1983). Proofs, program correctness, and software engineering, ACM SIGPLAN Notices, 18:12, (96-105), Online publication date: 1-Dec-1983.
- Wagner A and Dasgupta S (1983). Axiomatic proof rules for a machine-specific microprogramming language, ACM SIGMICRO Newsletter, 14:4, (151-158), Online publication date: 1-Dec-1983.
- Reimer M Solving the Phantom Problem by Predicative Optimistic Concurrency Control Proceedings of the 9th International Conference on Very Large Data Bases, (81-88)
- Remmers J (1983). Should we really teach more about the GOTO? (a reaction to an article by H.D. Shapiro), ACM SIGCSE Bulletin, 15:3, (36-39), Online publication date: 1-Sep-1983.
- Moitra A Synthesis of communicating processes Proceedings of the second annual ACM symposium on Principles of distributed computing, (123-130)
- Parnas D (1983). A generalized control structure and its formal definition, Communications of the ACM, 26:8, (572-581), Online publication date: 1-Aug-1983.
- Berztiss A Data processing and computer science theory Proceedings of the fourteenth SIGCSE technical symposium on Computer science education, (72-76)
- Culik K and Rizki M Logic versus mathematics in computer science education Proceedings of the fourteenth SIGCSE technical symposium on Computer science education, (14-20)
- Mili A A case for teaching program verification Proceedings of the fourteenth SIGCSE technical symposium on Computer science education, (2-6)
- Berztiss A (1983). Data processing and computer science theory, ACM SIGCSE Bulletin, 15:1, (72-76), Online publication date: 1-Feb-1983.
- Culik K and Rizki M (1983). Logic versus mathematics in computer science education, ACM SIGCSE Bulletin, 15:1, (14-20), Online publication date: 1-Feb-1983.
- Mili A (1983). A case for teaching program verification, ACM SIGCSE Bulletin, 15:1, (2-6), Online publication date: 1-Feb-1983.
- Masters M and Kuchinski M (1983). Software design prototyping using Ada, ACM SIGAda Ada Letters, II:4, (68-75), Online publication date: 1-Jan-1983.
- Elshoff J and Marcotty M (1982). Improving computer program readability to aid modification, Communications of the ACM, 25:8, (512-521), Online publication date: 1-Aug-1982.
Index Terms
- The Science of Programming
Recommendations
Introducing object-oriented programming into the computer science curriculum
In recent years, object-oriented programming languages and object-oriented program design have become increasingly popular. Dialects of many popular programming languages are now available which support the major concepts of object-oriented programming; ...
Introducing object-oriented programming into the computer science curriculum
SIGCSE '87: Proceedings of the eighteenth SIGCSE technical symposium on Computer science educationIn recent years, object-oriented programming languages and object-oriented program design have become increasingly popular. Dialects of many popular programming languages are now available which support the major concepts of object-oriented programming; ...
Comparing novice programing environments for use in secondary education: App Inventor for Android vs. Alice
Coding is part of logical thinking and is one of the basic skills which are known as '21st-century skills'. Coding acquisition is necessary as it is used in a wide range of occupations. However, computer programing is difficult to learn and programing ...