DAVID GRIES - Cornell University

7. Eliminating the chaff —again. Banquet speech at Marktoberdorf 1996. In M. Broy and B. Schieder
(eds.) Mathematical Methods in Program Development. NATO ASI Series, Series F: Computer and
Systems Sciences 158, Springer Verlag 1997, 1–7.
8. Foundations for calculational logic. Ibid, 83–126.
9. The once and future programmer: our educational dilemma (Banquet speech). Third Annual Northeastern
Conference, the Consortium for Computing in Small Colleges. Fairfield, CT, 24 April 1998.
10. Adding the everywhere operator to propositional logic. Journal of Logic and Computation 8, 1
(February 1998). (With F.B. Schneider).
11. KMP string matching revisited. IPL 64 (1997), 217–223. (with E.M. Reingold and K.J. Urban).
12. Formal justification of underspecification for S5. IPL 64, 3 (Nov. 1997), 115–121. (with E ˙ Aaron).
13. What’s education for? Address at the Opening Convocation, Daniel Webster College, 6 September
1996.
14. Data refinement and the transform. Deductive Program Design (M. Broy, ed.), AASI Vol. F152,
Springer Verlag, pp. 205-232, 1996.
15. The need for education in useful formal logic. IEEE Computer (April 1966), 29-30.
16. Avoiding the undefined by underspecification. In J. van Leeuwen (Ed.). Computer Science Today.
Springer Verlag Lecture Notes in Computer Science 1000, October 1995, 366–373.
17. Teaching math more effectively through calculational proofs. The Mathematical Monthly (October
1995), 691–697. (with F.B. Schneider).
18. A new approach to teaching discrete mathematics. PRIMUS V, 2 (June 1995), 113–138. (with F.B.
Schneider).
19. Equational propositional logic. IPL 53, 3 (February 1995), 145–152. (with Fred B. Schneider).
20. Documents mean more than just paper! Mathl. Comput. Modeling 26, 1 (1997), 45-53. (With T.V.
Raman).
21. Documents mean more than just paper! Proc. Second International Workshop on the Principles of
Document Processing, April 1994 (with T.V. Raman).
22. Data refinement and the transform. In Broy (ed.), Program Design Calculi. NATO ASI Series F,
118, Springer-Verlag, Heidelberg, 1993. pp. 92-119.
23. Computer Science, Academic. Encyclopedia of Computer Science, Third Edition (A. Ralston and
E.D. Reilly, eds.), Van Nostrand Reinhold, New York, 1993, p. 322-323 (with D. Marsh).
24. Loop invariant. Encyclopedia of Computer Science, Third Edition (A. Ralston and E.D. Reilly,
eds.), Van Nostrand Reinhold, New York, 1993, p. 796-797.
25. Trace-based network proof systems: expressiveness and completeness. TOPLAS 14, 3 (July 1992),
396-416. (with J. Widom and F.B. Schneider).
26. A new programming language. Proc. Software Technology Conference 1992, Los Angeles, California,
27-29 April 1992, pp. 97-101.
27. A constructive proof of Vizing’s theorem. IPL 41, 3 (March 1992), 131-133. (with J. Misra).
28. On progress in programming. In Broy, M. (ed.). Informatik und Mathematik, Springer Verlag,
Heidelberg, 1991, pp. 297-302.
29. Teaching calculation and discrimination: a more effective curriculum. Comm. ACM 34, 3 (March
1991), 44-55.
30. Binary to decimal, one more time. In Beauty is our Business (W.H.J. Feijen et al, eds.), Springer
Verlag, New York, 1990, pp. 141-148.
31. The transform —a new language construct. Structured Programming 11 (1990), 1-10. (with D.
Volpano).
32. An optimal parallel algorithm for generating combinations. IPL 33 (November 1989), 135-139.
(with S.E. Akl and I. Stojmenovic).
33. A hands-in-the-pocket presentation of a k-majority vote algorithm. In Formal development of pro-
5