http:^^www.cs.cornell.edu^info^people^gries^vita.html

来自「This data set contains WWW-pages collect」· HTML 代码 · 共 514 行 · 第 1/2 页

<LI>Horner's rule and the computation of linear recurrences.
      <em>IPL 25</em>, 4 (June 1987), 237-240. (with A. Pascoletti and L. Sbriz).
<LI>Programming pearls, guest oyster.
      <em>Comm. ACM 30</em>, 4 (April 1987), 284-290.
<LI>Mclaren's masterpiece.
      <em>Science of Computer Programming 8</em>, 2 (April 1987), 139-146.
      (with J.F. Prins).
<LI>In-situ inversion of a cyclic permutation.
      <em>IPL 24</em>, 1 (January 1987), 11-14.
      (with W.H.J. Feijen and A.J.M. van Gasteren).
<LI>Completeness and incompleteness of trace-based network proof systems.
      <em>Proc. Fourteenth Ann. ACM SIGACT-SIGPLAN Symp. Princ. Programming
      Languages</em>, January 1987, Munich.
      (with J. Widom and F.B. Schneider).
<LI>Programming methodology: making a science out of an art.
      <em>Engineering: Cornell Quarterly 20</em>, 2 (Fall 1985), 23-27.
      (with F.B. Schneider).
<LI>A model and temporal proof system for networks of processes.
      <em>Distributed Computing 1</em>, 1 (1986), 7-25. (with V. Nguyen,
      A. Demers, and S. Owicki).
<LI>A new notion of encapsulation.
      <em>Proc. SIGPLAN 85 Symp. Language Issues in Programming Environments</em>,
      Seattle, June 1985, 131-139. (with J. Prins).
<LI>Behavior: a temporal approach to process modeling.
      Conference on Logics of Programs, Brooklyn, June 1985.
      <em>LNCS 193</em> (1985), 237-254. (with V. Nguyen, A. Demers, and S. Owicki).
<LI>A model and temporal proof system for networks of processes.
      <em>Twelfth Ann. ACM Symp. Princ. Progr. Lang.</em>, New Orleans, January 1985,
      121-131. (with V. Nguyen and S. Owicki).
<LI>General correctness: a unification of partial and total correctness.
      <em>Acta Informatica 22</em> (1985), 67-84. (with D. Jacobs).
<LI>The emerging science of programming (Keynote Address).
      <em>6th Australian Computer Science Conference</em>, Sydney, Australia,
      February 12, 1983.
<LI>Towards a practical science of programming (Keynote Address).
      <em>2nd Conf. Foundations of Software Technology and Theoretical
      Computer Science</em>, Bangalore, India, December 13, 1982.
<LI>Fast fault-tolerant broadcasts.
      <em>Science of Computer Programming 4</em> (April 1984), 1-16.
      (with F.B. Schneider and R.D. Schlichting).
<LI>A note on a standard strategy for developing loop invariants and loops.
      <em>Science of Computer Programming 2</em> (1984), 207-214.
<LI>Finding repeated elements.
      <em>Science of Computer Programming 2</em> (November 1982), 143-152.
      (with J. Misra).
<LI>A proof technique for communicating sequential processes.  <em>Acta
      Informatica 15</em> (1980), 281-302. (with G. Levin).
<LI>Educating the programmer: notation, proofs and the development of programs.
      Invited lecture.  <em>Information Processing 80, Proc. IFIP Congress 80,</em>
      S. Lavington, (Ed.), North-Holland, New York, 1980, 935-944.
<LI>Computing a Fibonacci number in log time.
      <em>IPL 2</em> (October 1980), 68-69. (with G. Levin).
<LI>Assignment and procedure call proof rules.  <em>TOPLAS 2</em> (October 1980),
      564-579. (with G. Levin).
<LI>Controlled-density sorting.
      <em>IPL 10</em> (July 1980), 169-172. (with R. Melville).
<LI>Is sometime ever better than alway?  <em>TOPLAS 1</em> (October 1979), 258-265.
<LI>Eliminating the chaff.  In <em>Program Construction</em>, F.L. Bauer and M. Broy
      (Eds.), <em>LNCS 69</em> (1979), 70-74.
<LI>Current ideas in programming methodology.  In <em>Research Directions in
      Software Technology</em>, P. Wegner (Ed.), MIT Press, 1979, 254-275.
<LI>The Schorr-Waite graph marking algorithm.  <em>Acta Informatica 11</em> (1979),
      223-232.
<LI>A linear sieve algorithm for finding prime numbers.
      <em>Comm. ACM 21</em> (December 1978), 999-1003. (with J. Misra).
<LI>Parallel programming (invited lecture).  GI-8 Jahrestagung,
      <em>Springer Verlag Informatik Berichte 16</em> (October 1976)
      Berlin, Germany, 214-233.
<LI>The multiple assignment statement.
      <em>IEEE Trans. Softw. Eng. 4</em> (March 1978), 89-93.
<LI>Language facilities for programming user-computer dialogues.
      <em>IBM J. Research and Development 22</em> (March 1978), 148-158.
      Reprinted in E. Edmunds (ed.). <em>The Separable User Interface.</em>
      Academic Press, San Diego, 1992, pp. 97-128. (with J. LaFuente).
<LI>An exercise in proving parallel programs correct.
      <em>Comm. ACM 20</em> (December 1977), 921-930.
<LI>Some ideas on data types in high-level languages.
      <em>Comm. ACM 20</em> (June 1977), 414-420. (with N. Gehani).
<LI>An illustration of current ideas on the derivation of correctness proofs and
      correct programs.  <em>IEEE Trans. Softw. Eng. 2</em>
      (December 1976), 238-244.
<LI>Compiler.  <em>Encyclopedia of Computer Science and Technology 5</em>,
      Belzer, Holzman and Kent (Eds.), Markel Dekker Inc., New York, 206-243.
<LI>Error recovery and correction -an introduction to the literature.
      <em>Compiler Construction -an Advanced Course</em>, F.L. Bauer and J. Eickel
      (Eds.), <em>LNCS 21</em> (edition 2), Springer Verlag, New York, 1976, 627-638.
<LI>Some comments on programming language design (invited lecture).
      <em>Programmiersprachen: Fachtagung 1976</em>, H.J. Schneider and M. Nagl
      (Eds.), Informatik-Fachberichte I, Springer Verlag, Heidelberg, 1976, 235-252.
<LI>An axiomatic proof technique for parallel programs.  <em>Acta Informatica 6</em>
      (1976), 319-340. (with S. Owicki).
<LI>Verifying properties of parallel programs: an axiomatic approach.
      <em>Comm. ACM 19</em> (May 1976), 279-285. (with S. Owicki).
<LI>On structured programming -a reply to Smoliar.  <em>Comm. ACM 17</em>
      (November 1974), 655-657; also <em>Comm. ACM 18</em> (October 1975),
      600-601 and <em>Comm. ACM 19</em> (January 1976), 47-48.
<LI>What should we teach in an introductory programming course?  SIGCSE Bulletin 6,
      February 1974, 81-89.  (<em>Proc. 4th Symp. Computer Science Education.</em>)
<LI>Describing an algorithm by Hopcroft.  <em>Acta Informatica 2</em> (1973), 97-109.
<LI>Programming by induction.  <em>IPL 2</em> (1972), 100-107.
<LI>Program schemes with pushdown stores.  <em>SIAM J. Computing 1</em> (1972),
      242-268. (with R. Szymanski and S. Brown).
<LI>On classes of program schemata.  <em>SIAM J. Computing 1</em>, 1 (1972),
      66-118. (with R. Constable).
<LI>Automatic compiler writing techniques.  In <em>Systemprogrammierung</em>, 
      Ganzhorn, Schieferdecker, Endres (Ed.), Oldenbourg Verlag, Munich, 1972.
<LI>Translator writing systems.  <em>Comm. ACM 11</em>
      (February 1968), 77-113. (with J. Feldman).
<LI>The use of transition matrices in compiling.  <em>Comm. ACM 11</em>
      (January 1968), 26-34.
<LI>The ALCOR-ILLINOIS 7090/7040 post mortem dump.
      <em>Comm. ACM 10</em> (December 1967), 804-808.
      (with R. Bayer, M. Paul and H.R. Wiehle).
<LI>Characterizations of certain classes of norms.  <em>Numerische Mathematik 10</em> 
      (1967), 30-41.
<LI>Some results on fields of value of a matrix.  <em>SIAM J. Numerical 
      Analysis 4</em> (1967), 283-299. (with J. Stoer).
<LI>Some techniques used in the ALCOR-ILLINOIS 7090.
      <em>Comm. ACM 8</em> (August 1965), 496-500. (with M. Paul and H.R. Wiehle).
 </UL> 
<P><b>Published Reports</b>
<UL><LI>Computer science.
      <em>Cornell Engineering Quarterly 25</em>, 4 (Summer 1991), 21-23.
<LI>Die 150 wissenschaftlichen Nachtkommen von Prof.Dr.Dr.h.c.mult. F.L. Bauer.
      In Broy, M. (ed.). <em>Informatik und Mathematik</em>,
      Springer Verlag, Heidelberg, 1991, pp. 441-450.
<LI>The 1989-90 Taulbee survey.  <em>Computing Research News</em>
      (January 1991) and <em>Comm. ACM 35</em>, 1 (January 1992), 132-143.
      (with Dorothy Marsh).
<LI>The 1988-89 Taulbee survey.
      <em>Computing Research News 2</em>, 1 (January 1990) and
      <em>Comm. ACM 33</em>, 9 (September 1990),
      160-169.  (with Dorothy Marsh).
<LI>Computer languages.  In J.E. Hopcroft and K.W. Kennedy, ed.
      <em>Computer Science: achievements and opportunities</em>.
      Report of the NSF Advisory Committee for Computer
      Research.  SIAM, Philadelphia, 1989, pp. 15-28.  (with C.A.R. Hoare,
      K.W. Kennedy, F.C.N. Pereira, and D.S. Scott).
<LI>The Computer Worm.  (Report from the Commission of Preliminary Enquiry.
      Cornell University), Cornell University, 6 February 1989.  (with T. Eisenberg,
      J. Hartmanis, D. Holcomb, M.S. Lynn, and T. Santoro).
<LI>The 1988 Snowbird Report: a discipline matures.
      <em>Computer 22</em>, 2 (1989), 72-75.  (with T. Walker and P.R. Young).
<LI>Computing as a Discipline. Final report of ACM Task Force on the Core of
      Computer Science.
      <em>Computer 22</em>, 2 (1989), 63-70.  (with P.J. Denning,. D.E. Comer,
      M.C. Mulder, A. Tucker, A.J. Turner, and P.R. Young).
<LI>The 1987-88 Taulbee survey.  <em>Comm. ACM 32</em>, 10 (October 1989), 1217-1224;
      and <em>Computer 22</em>, 11 (November 1989),
      49-56. (with D. Marsh).
<LI>The 1986-87 Taulbee survey.  <em>Comm. ACM 31</em> (August 1988), 984-991;
      and <em>Computer 21</em> (August 1988), 53-61.  (with Dorothy Marsh).
<LI>The 1985-86 Taulbee survey.  <em>Comm. ACM 30</em> (August 1987), 688-694.
<LI>Meeting the basic research needs of computer science.  Report of
      the study group of the Advisory Committee for Computer Research,
      National science Foundation, December 1986. (with S.R. Kosaraju and
      M.J. Fischer).
<LI>The 1984-85 Taulbee survey.  <em>Comm. ACM 29</em> (Oct 1986), 972-977.
<LI>Twenty years of computer science at Cornell.
      <em>Engineering: Cornell Quarterly 20</em>, 2 (Fall 1985), 2-12.
<LI>Imbalance between growth and funding in academic
      computer science: two trends colliding.
      <em>Computer 19</em> (September 1986), 70-76, and
      <em>Comm. ACM 29</em> (September 1986), 870-878.
      (with R. Miller, R. Ritchie, and P. Young).
 </UL> 
<P><b>Other reports and reviews</b>
<UL>
<LI><A HREF = "Papers/Monotonicity.ps">On presenting monotonicity and on EA=>AE</A>.
     Tech. Rpt. TR95-1512, Computer Science Department, Cornell University,
      May 1995.
<LI>Teaching math more effectively through the design of calculational proofs.
      Tech. Rpt. 94-1415, March 1994. 
      Accepted for publication in the <em>Mathematical Monthly</em>, January 1995. 
<LI>A new approach to teaching mathematics.
      Tech. Rpt., Computer Science Department, Cornell University,
      February 1994.
      Accepted for publication in <em>PRIMUS</em>. (with F.B. Schneider).
<LI>A constructive proof of Vizing's theorem.
      Tech. Rpt., Computer Science Department, Cornell University, August 1991.
      (with J. Misra).
<LI>Forward, <em>Essays in Computing Science</em> by C.A.R. Hoare and C.B. Jones.
      Prentice Hall International, London, 1989.
<LI>The Hopcroft-Tarjan planarity algorithm, presentation and improvements.
      Tech. Rpt. 88-906, April 1988. (with J. Xue).
<LI>Presenting an algorithm to find the minimum edit distance.
      Tech. Rpt. 88-903, March 1988. (with B. Burkhart).
<LI>Inorder traversal of a binary tree and its inversion.
      Tech. Rpt. 87-876, November 1987.
      (with Jan L.A. van de Snepscheut).
<LI>Complete, trace-based, network proof systems: an advisor's perspective.
      Tech. Rpt. 87-865, Computer Science Department, Cornell University,
      September 1987.
<LI>Developing two of Arsac's funny algorithms.
      Tech. Rep. 85-711, Computer Science Department, Cornell University,
      November 1985.
<LI>The Gibbs Programming Environment.   IEEE International Conference
      on Computer Design: VLSI in Computers.  (ICCD '85), Oct 7 1985,
      Port Chester, NY.
<LI>The seven-eleven problem.
      Tech. Rep. 83-574, Computer Science, Cornell University, September 1983.
      (with P. Pritchard)
<LI>Review of R.G. Dromy's book <em>How to solve it by computer</em>.
      <em>Science of Computer Programming 3</em> (1983).
<LI>A reply to Susan Gerhart's review of <em>Craft</em> and <em>Science</em>.
      May 1982.
<LI>The science of programming answer book.
      Tech. Rep. 82-498, Computer Science, Cornell University,
      Ithaca, New York, June 1982.
<LI>The 711 problem.
      Tech. Rep. 82-493, Computer Science, Cornell University,
      Ithaca, New York, May 1982. (with J. Misra).
<LI>Finding the longest prefix. August 1981.
<LI>Notes on Mathematical Induction and Well-Founded Sets.
      November 1981.
<LI><b>Cand</b> and <b>Cor</b> before <b>and then</b> and <b>or else</b> in ADA;.
      Tech. Rep. 79-402, Computer Science,
      Cornell University, Ithaca, New York, May 1979.
<LI>Yet another exercise: using shared variables in two processes to provide
      starvation-free mutual exclusion.
      Tech. Rep. 79-372, Computer Science, Cornell University,
      Ithaca, New York, 1979.
<LI>Tutorial on the development of programs.  COMCON 77, September 1977. (with D.
      Parnas).
<LI>A note on iteration.
      Tech. Rep. 77-323, Computer Science, Cornell University,
      Ithaca, New York, September 1977.
<LI>A proof of correctness of Rem's semaphore implementation of the <em>with-when</em>
      statement.
      Tech. Rep. 77-314, Computer Science, Cornell University,
      Ithaca, New York, May 1977.
<LI>The use of comments on programming.  1976. (with R. Conway).
<LI>A student-written compiler.  Tutorial Software Document 1, DISE Task Force
      on Software Engineering, May 1975.
<LI>Recursion as a programming tool.
      Tech. Rep. 75-242, Computer Science, Cornell University,
      Ithaca, New York, May 1975.
<LI>A note on program development.  Tech. Rep. 74-202, Computer Science,
      Cornell University, Ithaca, New York, March 1974.
<LI>Using recipes to teach programming.  1970.
<LI>CIL: Compiler Implementation Language.
      SLAC Report 102, March 1969.
<LI>MPL: Mathematical Programming Language.  Computer Science Report, Computer
      Science Department, Stanford University, 1968. (with 7 others).
<LI><em>Ueber einige Klassen von Normen.</em>  Ph.D. Thesis, Technische Hochschule
      Muenchen, 1966.
<LI>ALCOR-ILLINOIS 7090 -an ALGOL compiler for the IBM 7090.  Report 6415,
      Rech. der Tech. Hochschule Munich, 1964. (with M. Paul and H.R. Wiehle).
<LI>The object program produced by the ALCOR-ILLINOIS 7090 compiler.  Report
      6412, Rech. der Tech. Hochschule Munich, 1964.
<LI>User's manual for the ALCOR-ILLINOIS 7090 ALGOL translator.  University of
      Illinois, September 1964, 120 pages. (with R. Bayer and E. Murphree Jr).
 </UL> 
<HR>

</BODY>