Now showing items 13-32 of 59

    • A Conversation with Fred Schneider 

      Schneider, Fred B.; Gries, David (Internet-First University Press, 2015-09-09)
      Fred Schneider, an expert in concurrent and distributed systems and in computer and cybersecurity, shares insights about how his professional interests evolved, and provides sweeping views about how his field and department ...
    • A Conversation with John E. Hopcroft 

      Hopcroft, John E.; Gries, David (Internet-First University Press, 2015-07-21)
      This ACM Turing Award recipient talks about research, textbooks, working with graduate students, his role as a senior statesman of his field and concludes with some words of wisdom.
    • A Conversation with Richard W. Conway 

      Conway, Richard W.; Gries, David (Internet-First University Press, 2015-07-21)
      Dick Conway came to Cornell in 1949, as a freshman. He received the first PhD from Operations Research and Industrial Engineering (1958), was instrumental in the creation of the CS Department (1965) and was a founding ...
    • A Conversation with Robert L. Constable 

      Constable, Robert L.; Gries, David (Internet-First University Press, 2015-07-21)
      Over 40 years ago, Bob Constable and his students started designing a logical language for specifying programming tasks and mathematical problems. The system, called Nuprl, is known since 1984 for being able to synthesize ...
    • A Conversation with Tim Teitelbaum 

      Teitelbaum, Tim; Gries, David (Internet-First University Press, 2015-09-10)
      A discussion of the teaching of large, introductory courses in programming in the early days-using the Terak and Macintosh computers and the development of integrated programming environments that implement language-aware ...
    • Current Ideas on Programming Methodology 

      Gries, David (Cornell University, 1976-07)
    • Describing an Algorithm by Hopcroft 

      Gries, David (Cornell University, 1972-12)
      We give an algorithm, its correctness proof, and its proof of execution time bound, for finding the sets of equivalent states in a deterministic finite state automaton. The time bound is $K\cdotm\cdot\n\cdot\\log n$ where ...
    • Developing a Linear Algorithm for Cubing a Cyclic Permutation 

      Xue, Jinyun; Gries, David (Cornell University, 1986-09)
      A linear algorithm is developed for cubing a cyclic permutation stored as a function in an array. This continues work discussed in [0] and [1] on searching for disciplined methods for developing and describing algorithms ...
    • Developing Two of Arsac's Funny Algorithms 

      Gries, David (Cornell University, 1985-11)
      In Some Funny Program (Ecole Normale Superieure, Paris, June 1985) J. Arsac discusses several algorithms, but not from the standpoint of their development. Here, we develop the algorithms given their specification using ...
    • Educating the Programmer: Notation, Proofs, and the Development of Programs 

      Gries, David (Cornell University, 1980-04)
      The current state of affairs in programming is discussed. The opinion is expressed that effective programming requires more "mathematical maturity" than most programmers have. Further, education in formal logicc, which ...
    • Engineering: Cornell Quarterly, Vol.20, No.2 (Autumn 1985): Twenty Years of Computer Science at Cornell 

      Gries, David; Teitelbaum, Tim; Reps, Thomas; Schneider, Fred B.; Babaoglu, Ozalp; Birman, Kenneth P.; Toueg, Sam; Krafft, Dean B.; Solworth, Jon A.; Duke, Diane; Fish, Michele (Internet-First University Press, 1985)
      IN THIS ISSUE: Twenty Years of Computer Science at Cornell /2 David Gries ... Immediate Computation or How to Keep a Personal Computer Busy /12 Tim Teitelbaum and Thomas Reps ... Reaching Agreement: A Fundamental Task Even ...
    • Equational Propositional Logic 

      Gries, David; Schneider, Fred B. (Cornell University, 1994-09)
      We formalize equational propositional logic, prove that it is sound and complete, and compare the equational-proof style with the more traditional Hilbert style.
    • Fault-Tolerant Broadcasts 

      Schneider, Fred B.; Gries, David; Schlichting, Richard D. (Cornell University, 1983-09)
      A distributed program is presented that ensures delivery of a message to the functioning processors in a computer network, despite the fact that processors may fail at any time. All processor failures are assumedd to be ...
    • Finding Repeated Elements 

      Misra, Jayadev; Gries, David (Cornell University, 1982-07)
      Two algorithms are presented for finding the values that occur more than $n \div k$ times in array b[O:n-1]. The second algorithm requires time $O(n \log(k))$ and extra space $O(k)$. We prove that $O(n \log(k))$ is a ...
    • Formal Justification of Underspecification for S5 

      Aaron, Eric; Gries, David (Cornell University, 1997-02)
      We formalize the notion of underspecification as a means of avoiding problems with partial functions in modal logic S5 and some semantically related logics. For these logics, underspecification respects validity, so ...
    • Formal versus semiformal proof in teaching predicate logic 

      Gries, David (Cornell University, 1996-08)
      This space is left deliberately non-blank
    • Formalizations Of Substitution Of Equals For Equals 

      Gries, David; Schneider, Fred B. (Cornell University, 1998-05)
      Inference rule "substitution of equals for equals" has been formalized in terms of simple substitution (which performs a replacement even though a free occurrence of a variable is captured), contextual substitution (which ...
    • General Correctness: A Unification of Partial and Total Correctness 

      Jacobs, Dean; Gries, David (Cornell University, 1984-10)
      General correctness, which subsumes partial and total correctness, is defined for both weakest preconditions and strongest postconditions. Healthiness properties for general-correctness predicate transformers are more ...
    • Generating a Random Cyclic Permutation 

      Gries, David; Xue, Jinyun (Cornell University, 1986-09)
    • The Hopcroft-Tarjan Planarity Algorithm, Presentation and Improvements 

      Gries, David; Xue, Jinyun (Cornell University, 1988-04)
      We give a rigorous, yet, we hope, readable, presentation of the Hopcroft-Tarjan linear algorithm for testing the planarity of a graph, using more modern principles and techniques for developing and presenting algorithms ...