Now showing items 5-24 of 59

    • Assignment to Subscripted Variables 

      Gries, David (Cornell University, 1977-03)
      The assignment b(r):=e is investigated using two axiomatic definitions in order to gain an understanding of the problems involved with using arrays. It is seen that assignment to array elements leads to many of the ...
    • Avoiding the Undefined by Underspecification 

      Gries, David; Schneider, Fred B. (Cornell University, 1995-05)
      We use the appeal of simplicity and an aversion to complexity in selecting a method for handling partial functions in logic. We conclude that avoiding the undefined by using underspecifi- cation is the preferred choice.
    • A calculational proof of Andrews's challenge 

      Gries, David (Cornell University, 1996-08)
      This space is left deliberately non-blank
    • Cand and Cor Before and Then or Else in Ada 

      Gries, David (Cornell University, 1979-11)
    • Complete, Trace-based, Network Proof Systems: An Advisor's Perspective 

      Gries, David (Cornell University, 1987-08)
    • Completeness and Incompleteness of Trace-Based Network Proof Systems 

      Widom, Jennifer; Gries, David; Schneider, Fred B. (Cornell University, 1986-07)
      Most trace-based proof systems for networks of processes are known to be incomplete. Extensions to achieve completeness are generally complicated and cumbersome. In this paper, a simple trace logic is defined and two ...
    • A Conversation with Anil Nerode 

      Nerode, Anil; Gries, David (Internet-First University Press, 2014-10-16)
      Anil Nerode is the Goldwin Smith Professor of Mathematics. He joined the Cornell Math Department in 1959. His interests are in mathematical logic, the theory of automata, computability and complexity theory, the calculus ...
    • A Conversation with David Gries 

      Gries, David; Constable, Robert L. (Internet-First University Press, 2015-07-21)
      David Gries joined Cornell in 1969. He was chair of CS in the 1980s and associate dean of engineering for 8 years in the 2000s. His research was on compiler writing and areas related to formal programming methodology. ...
    • 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.