1995 - ACM Karl V. Karlstrom Outstanding Educator Award In recognition of his leadership in the training of several generations of computer science students. His visionary emphasis on critical thinking and mathematical precision in Computer Science has dramatically changed the face of computer science education. This viewpoint is exemplified by his widely used textbooks on compilers, on the science of programming, and on mathematical foundations for computer science; by his role in curriculum development; and by his training of graduate students who have seeded his view as successful educators at other universities.
1994 - ACM Fellow For co-authoring of 'An Axiomatic Proof Technique for Parallel Programs I', the best paper in the area of Programming Systems and Languages.
1990 - Fellow of the American Association for the Advancement of Science (AAAS)
1983 - Fellow of John Simon Guggenheim Memorial Foundation
His primary scientific interests are in Programming language, Discrete mathematics, Compiler, Deadlock and Correctness. Many of his studies on Programming language involve topics that are commonly interrelated, such as Theoretical computer science. His study in the field of Computational logic is also linked to topics like Vertex, Vizing's theorem and Multiple edges.
His research investigates the connection with Computational logic and areas like Calculus which intersect with concerns in Automated theorem proving. His Compiler study integrates concerns from other disciplines, such as Pascal, Font and Programmer. He has included themes like Theory of computation and Extension in his Deadlock study.
Programming language, Algorithm, Theoretical computer science, Software engineering and Discrete mathematics are his primary areas of study. His Programming language study deals with Notation intersecting with Mathematical proof. His work carried out in the field of Algorithm brings together such families of science as Simple and Calculus.
His work on Theoretical computer science is being expanded to include thematically relevant topics such as Assignment. In most of his Discrete mathematics studies, his work intersects topics such as Combinatorics. His Procedural programming research includes themes of Symbolic programming and Programming domain.
David Gries mainly investigates Programming language, Multimedia, Software engineering, Conversation and Algorithm. His Programming language study frequently involves adjacent topics like Theoretical computer science. The concepts of his Multimedia study are interwoven with issues in Technical documentation and Disk formatting.
His biological study spans a wide range of topics, including Virtual learning environment, Scalability, Correctness and Grading. His Conversation research is multidisciplinary, relying on both Speech recognition and Performance art. His Algorithm research is multidisciplinary, incorporating elements of First-order logic, Higher-order logic, Computational logic, Philosophy of logic and Calculus.
His primary areas of study are Programming language, Software engineering, Calculus, Dynamic logic and Java. His study in Recursion, Functional reactive programming, Declarative programming, Programming paradigm and Programming domain are all subfields of Programming language. His Software engineering study incorporates themes from Scalability, Computer science curriculum, Correctness, Software development process and Educational program.
His study in Calculus is interdisciplinary in nature, drawing from both Zeroth-order logic, Autoepistemic logic, Discrete mathematics and Computational logic. His study on First-order logic is often connected to Equational logic as part of broader study in Discrete mathematics. David Gries interconnects Philosophy of logic, Second-order logic, Mathematical logic, Gödel's completeness theorem and Horn clause in the investigation of issues within Computational logic.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
The science of programming
First-Order Logic and Automated Theorem Proving
Melvin Fitting;David Gries.
An axiomatic proof technique for parallel programs I
Susan Owicki;David Gries.
Acta Informatica (1976)
Computing As a Discipline
P.J. Denning;D.E. Comer;D. Gries;M.C. Mulder.
Pascal user manual and report
Kathleen Jensen;Niklaus Wirth;P. Brinch Hansen;D. Gries.
Compiler construction for digital computers
The Programming Language Ada Reference Manual American National Standards Institute, Inc. ANSI/MIL-STD-1815A-1983
G. Goos;J. Hartmanis;D. Barstow;W. Brauer.
Verifying properties of parallel programs: an axiomatic approach
Susan Owicki;David Gries.
Communications of The ACM (1976)
Jon Bentley;David Gries.
A Logical Approach to Discrete Math
David Gries;Fred B. Schneider.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: