Peter G. Neumann

Peter G. Neumann
Born 1932 (age 83–84)
Fields Computer science
Institutions SRI International
Alma mater Harvard University
Thesis Efficient Error-Limiting Codes (1961)
Doctoral advisor Anthony Gervin Oettinger[1]
Known for RISKS Digest
Multics operating system

Peter Gabriel Neumann (born 1932) is a computer-science researcher who has worked on the Multics operating system in the 1960s.[2] He edits the RISKS Digest columns for ACM Software Engineering Notes and Communications of the ACM.[3] He founded ACM SIGSOFT and is a Fellow of the ACM, IEEE,[4] and AAAS.[5]

Early life and education

Neumann studied at Harvard University (1950–1958), gaining a Ph.D. in 1961 after a Fulbright scholarship in Germany (1958–1960). While a student at Harvard, he had a two-hour breakfast with Albert Einstein on November 8, 1952. They discussed simplicity in design.[6]

Career

Neumann worked at Bell Labs from 1960 to 1970. He has worked at SRI International in Menlo Park, California since 1971.

Before the RISKS mailing list, Neumann was best known for the Provably Secure Operating System (PSOS).

Memberships and awards

Neumann has long served as moderator of RISKS Digest, and is a member of the ACCURATE project.

Neumann is the founding editor of ACM Software Engineering Notes (SEN), and is a fellow of the ACM.[7]

Selected publications

References

  1. ↑ Peter G. Neumann at the Mathematics Genealogy Project
  2. ↑ R. C. Daley and P. G. Neumann (1965). "A General-Purpose File System For Secondary Storage". 1965 Fall Joint Computer Conference. Archived from the original on 2012-11-10.
  3. ↑ http://queue.acm.org/risksforum.cfm
  4. ↑ http://www.ieee.org/membership_services/membership/fellows/alphabetical/nfellows.html
  5. ↑ http://php.aaas.org/about/aaas_fellows/list.php
  6. ↑ Markoff, John (30 Oct 2012). "Killing the Computer to Save It". The New York Times. New York Times. p. D1.
  7. ↑ Association for Computing Machinery. "ACM: Fellows Award / Peter G Neumann". Association for Computing Machinery. Archived from the original on 4 Oct 2006.


This article is issued from Wikipedia - version of the 4/11/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.