%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "1.02",
%%% date = "25 November 2005",
%%% time = "07:31:13 MST",
%%% filename = "acm-turing-award.bib",
%%% address = "University of Utah
%%% Department of Mathematics, 110 LCB
%%% 155 S 1400 E RM 233
%%% Salt Lake City, UT 84112-0090
%%% USA",
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 581 4148",
%%% URL = "http://www.math.utah.edu/~beebe",
%%% checksum = "59404 1532 7113 70190",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "ACM Turing Award; bibliography; BibTeX",
%%% supported = "yes",
%%% docstring = "This is a bibliography of tje ACM Turing
%%% Award Lectures. The official Web site for
%%% these awards is:
%%%
%%% http://www.acm.org/awards/taward.html
%%%
%%% There is also a list with links to author
%%% publication lists at
%%%
%%% http://www.informatik.uni-trier.de/~ley/db/journals/cacm/turing.html
%%%
%%% For convenience, here is a summary of the
%%% awards, with URLs for the official
%%% announcements of recent awards. Lectures are
%%% published in the same or following year,
%%% except as noted, and from 2002, some are
%%% available in online video formats:
%%%
%%% 1966 Alan J. Perlis
%%% 1967 Maurice V. Wilkes
%%% 1968 Richard W. Hamming
%%% 1969 Marvin L. Minsky
%%% 1970 James H. Wilkinson
%%% 1971 John McCarthy (published 1987)
%%% 1972 Edsger W. Dijkstra
%%% 1973 Charles W. Bachman
%%% 1974 Donald E. Knuth
%%% 1975 Allen Newell and Herbert A. Simon
%%% 1976 Dana S. Scott
%%% 1977 John Backus
%%% 1978 Robert W. Floyd
%%% 1979 Kenneth E. Iverson
%%% 1980 Charles Anthony Richard Hoare
%%% 1981 Edgar F. Codd
%%% 1982 Stephen A. Cook
%%% 1983 Dennis M. Ritchie and Ken Thompson
%%% 1984 Niklaus Wirth
%%% 1985 Richard M. Karp
%%% 1986 John E. Hopcroft and Robert E. Tarjan
%%% 1987 John Cocke
%%% 1988 Ivan E. Sutherland
%%% 1989 William (Velvel) M. Kahan (unpublished)
%%% 1990 Fernando J. Corbat{\'o}
%%% 1991 Robin Milner
%%% 1992 Butler Lampson (unpublished??)
%%% 1993 Juris Hartmanis and Richard Edwin Stearns
%%% 1994 Edward A. Feigenbaum and Raj Reddy
%%% 1995 Manuel Blum (unpublished)
%%% http://www.acm.org/announcements/95turingaward.html
%%% http://www.csc.villanova.edu/html/csc96/
%%% 1996 Amir Pnueli (only abstract published)
%%% http://www.acm.org/announcements/turing.html
%%% 1997 Douglas Engelbart (unpublished??)
%%% http://www.acm.org/announcements/turing98.html
%%% 1998 Jim Gray
%%% http://www.acm.org/announcements/turing2.html
%%% 1999 Frederick P. Brooks, Jr. (unpublished)
%%% http://www.acm.org/announcements/turing99.html
%%% 2000 Andrew Chi-Chih Yao (unpublished)
%%% http://www.acm.org/announcements/turing2000.html
%%% 2001 Ole Johan Dahl and Kristen Nygaard (unpublished)
%%% http://www.acm.org/announcements/turing_2001.html
%%% 2002 Ronald L. Rivest, Adi Shamir and Leonard M. Adleman
%%% http://www.acm.org/awards/turing_citations/rivest-shamir-adleman.html
%%% http://www.acm.org/announcements/turing_2002.html
%%% 2003 Alan Kay
%%% http://www.acm.org/announcements/turingaward.4-21-2004.html
%%% http://www.acm.org/talks/AlanKay/KayTuring.htm
%%% 2004 Kyoto Prize for Advanced Technology
%%% 2004 Vinton Cerf and Robert Kahn
%%% http://campus.acm.org/public/pressroom/press_releases/2_2005/turing_2_14_2005.cfm
%%%
%%% At version 1.02, the year coverage looked
%%% like this:
%%%
%%% 1967 ( 1) 1980 ( 1) 1993 ( 2)
%%% 1968 ( 1) 1981 ( 1) 1994 ( 2)
%%% 1969 ( 1) 1982 ( 1) 1995 ( 0)
%%% 1970 ( 1) 1983 ( 1) 1996 ( 2)
%%% 1971 ( 1) 1984 ( 2) 1997 ( 2)
%%% 1972 ( 1) 1985 ( 1) 1998 ( 1)
%%% 1973 ( 1) 1986 ( 1) 1999 ( 3)
%%% 1974 ( 1) 1987 ( 4) 2000 ( 0)
%%% 1975 ( 0) 1988 ( 2) 2001 ( 0)
%%% 1976 ( 1) 1989 ( 1) 2002 ( 3)
%%% 1977 ( 1) 1990 ( 1) 2003 ( 3)
%%% 1978 ( 1) 1991 ( 2) 2004 ( 1)
%%% 1979 ( 1) 1992 ( 0) 2005 ( 1)
%%%
%%% Article: 34
%%% Book: 1
%%% InProceedings: 2
%%% Misc: 7
%%% Proceedings: 3
%%% TechReport: 2
%%% Unpublished: 1
%%%
%%% Total entries: 50
%%%
%%% The checksum field above contains a CRC-16
%%% checksum as the first value, followed by the
%%% equivalent of the standard UNIX wc (word
%%% count) utility output of lines, words, and
%%% characters. This is produced by Robert
%%% Solovay's checksum utility.",
%%% }
%%% ====================================================================
%%% ====================================================================
%%% Acknowledgement abbreviations:
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|http://www.math.utah.edu/~beebe/|"}
%%% ====================================================================
%%% Institution abbreviations:
@String{inst-BERKELEY-CS = "Department of Computer Science, University
of California"}
@String{inst-BERKELEY-CS:adr = "Berkeley, CA, USA"}
%%% ====================================================================
%%% Journal abbreviations:
@String{j-J-ACM = "Journal of the ACM"}
@String{j-CACM = "Communications of the ACM"}
@String{j-SIGMOD = "SIGMOD Record (ACM Special Interest
Group on Management of Data)"}
%%% ====================================================================
%%% Publishers and their addresses:
@String{pub-ACM = "ACM Press"}
@String{pub-ACM:adr = "New York, NY 10036, USA"}
@String{pub-AW = "Ad{\-d}i{\-s}on-Wes{\-l}ey"}
@String{pub-AW:adr = "Reading, MA, USA"}
@String{pub-SV = "Spring{\-}er-Ver{\-}lag"}
@String{pub-SV:adr = "Berlin, Germany~/ Heidelberg,
Germany~/ London, UK~/ etc."}
%%% ====================================================================
%%% Bibliography entries sorted by year and then by citation key:
@Article{Perlis:1967:SAS,
author = "Alan J. Perlis",
title = "The Synthesis of Algorithmic Systems",
journal = j-J-ACM,
volume = "14",
number = "1",
pages = "1--9",
month = jan,
year = "1967",
CODEN = "JACOAH",
DOI = "http://doi.acm.org/10.1145/321371.321372",
ISSN = "0004-5411",
bibdate = "Mon Dec 05 19:37:58 1994",
acknowledgement = ack-nhfb,
remark = "This is the 1966 ACM Turing Award Lecture, and the
first award.",
}
@Article{Wilkes:1968:CTN,
author = "Maurice V. Wilkes",
title = "Computers Then and Now",
journal = j-J-ACM,
volume = "15",
number = "1",
pages = "1--7",
month = jan,
year = "1968",
CODEN = "JACOAH",
DOI = "http://doi.acm.org/10.1145/321439.321440",
ISSN = "0004-5411",
bibdate = "Mon Dec 05 19:45:38 1994",
abstract = "Reminiscences on the early developments leading to
large scale electronic computers show that it took much
longer than was expected for the first of the more
ambitious and fully engineered computers to be
completed and prove themselves in practical operation.
Comments on the present computer field assess the needs
for future development.",
acknowledgement = ack-nhfb,
remark = "This is the 1967 ACM Turing Award Lecture.",
}
@Article{Hamming:1969:OMV,
author = "R. W. Hamming",
title = "One Man's View of Computer Science",
journal = j-J-ACM,
volume = "16",
number = "1",
pages = "3--12",
month = jan,
year = "1969",
CODEN = "JACOAH",
DOI = "http://doi.acm.org/10.1145/321495.321497",
ISSN = "0004-5411",
bibdate = "Mon Dec 05 19:49:19 1994",
abstract = "A number of observations and comments are directed
toward suggesting that more than the usual engineering
flavor be given to computer science. The engineering
aspect is important because most present difficulties
in this field do not involve the theoretical question
of whether certain things can be done, but rather the
practical question of how can they be accomplished well
and simply. The teaching of computer science could be
made more effective by various alterations, for
example, the inclusion of a laboratory course in
programming, the requirement for a strong minor in
something other than mathematics, and more practical
coding and less abstract theory, as well as more
seriousness and less game playing.",
acknowledgement = ack-nhfb,
remark = "This is the 1968 ACM Turing Award Lecture.",
}
@Article{Minsky:1970:FCC,
author = "Marvin L. Minsky",
title = "Form and Content in Computer Science",
journal = j-J-ACM,
volume = "17",
number = "2",
pages = "197--215",
month = apr,
year = "1970",
CODEN = "JACOAH",
DOI = "http://doi.acm.org/10.1145/321574.321575",
ISSN = "0004-5411",
bibdate = "Mon Dec 5 19:52:01 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib",
acknowledgement = ack-nhfb,
remark = "This is the 1969 ACM Turing Award Lecture.",
}
@Article{Wilkinson:1971:SCN,
author = "J. H. Wilkinson",
title = "Some Comments from a Numerical Analyst",
journal = j-J-ACM,
volume = "18",
number = "2",
pages = "137--147",
month = apr,
year = "1971",
CODEN = "JACOAH",
DOI = "http://doi.acm.org/10.1145/321637.321638",
ISSN = "0004-5411",
bibdate = "Sat Dec 10 15:00:46 1994",
acknowledgement = ack-nhfb,
remark = "This is the 1970 ACM Turing Award Lecture. Subsequent
lectures are published in {\em Communications of the
ACM}. Wilkinson comments ``It is perhaps salutary to be
reminded that as early as 1946 Turing had considered
the possibility of working with both interval and
significant digit arithmetic and the report recalled
forgotten conversations, not to mention heated
arguments, which we had on this topic.'' He also says
``I think it is of vital importance that all the work
that has been expended on the development of
satisfactory algorithms should be made fully available
to the people who need to use it. I would go further
than this and claim that it is a social duty to see
that this is achieved.''",
}
@Article{Dijkstra:1972:HP,
author = "Edsger W. Dijkstra",
title = "The Humble Programmer",
journal = j-CACM,
volume = "15",
number = "10",
pages = "859--866",
month = oct,
year = "1972",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/355604.361591",
ISSN = "0001-0782",
bibdate = "Mon Jan 22 06:36:07 MST 2001",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Dijkstra72",
abstract = "We shall do a much better programming job, provided
that we approach the task with a full appreciation if
its tremendous difficulty, provided that we stick to
modest and elegant programming languages, provided that
we respect the intrinsic limitations of the human mind
and approach the task as Very Humble Programmers.",
acknowledgement = ack-nhfb,
oldlabel = "Dijkstra72",
remark = "This is the 1972 ACM Turing Award Lecture. The 1971
ACM Turing Award Lecture was not published until 1987
\cite{McCarthy:1987:GAI}.",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Dijkstra72",
}
@Article{Bachman:1973:PN,
author = "Charles W. Bachman",
title = "The Programmer as Navigator",
journal = j-CACM,
volume = "16",
number = "11",
pages = "653--658",
month = nov,
year = "1973",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/355611.362534",
ISSN = "0001-0782",
bibdate = "Mon Jan 22 06:22:31 MST 2001",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Bachman73",
note = "This is the 1973 ACM Turing Award Lecture.",
acknowledgement = ack-nhfb,
annote = "Turing award acceptance speech-general view of the
state of database work from a DBTG originator.",
classcodes = "C6110 (Systems analysis and programming); C6120 (File
organisation); C6130 (Data handling techniques)",
corpsource = "Honeywell Information Systems Inc., Waltham, MA, USA",
keywords = "access; addressing; data handling; database; file
organisation; network hierarchical data model CACM;
programmer; programming",
oldlabel = "Bachman73",
treatment = "G General Review",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bachman73",
}
@Article{Knuth:1974:CPA,
author = "Donald E. Knuth",
title = "Computer Programming as an Art",
journal = j-CACM,
volume = "17",
number = "12",
pages = "667--673",
month = dec,
year = "1974",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/361604.361612",
ISSN = "0001-0782",
bibdate = "Mon Jan 22 06:55:26 MST 2001",
bibsource = "Compendex database;
http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Knuth74",
note = "French translation, with three supplementary
paragraphs, in {\sl L'Informatique Nouvelle}, No.\ 64
(June 1975), 20--27. Japanese translation by Makoto
Arisawa in {\sl bit\/ \bf 7} (1975), 434--444;
reprinted in {\sl Kunusu Sensei no Program-Ron\/} (see
under Books), 2--19. English version reprinted with the
supplementary paragraphs in {\sl ACM Turing Award
Lectures: The First Twenty Years} (New York: ACM Press,
1987), 33--46; reprinted with corrections in
\cite[pp.~1--16]{Knuth:1992:LP}. Russian translation by
V. V. Martyn\t iuk in {\sl Lektsii laureatov premii
T'\t\i uringa\/} (Moscow: Mir, 1993), 48--64.",
abstract = "Discussion emphasizes that computer programming is an
art as well as a science.",
acknowledgement = ack-nhfb,
classcodes = "C6110 (Systems analysis and programming)",
classification = "723",
corpsource = "Stanford Univ., CA, USA",
journalabr = "Commun ACM",
keywords = "art; computer; computer programming; programming;
quality",
oldlabel = "Knuth74",
remark = "This is the 1974 ACM Turing Award Lecture.",
treatment = "G General Review; P Practical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Knuth74",
}
@Article{Newell:1976:CSE,
author = "Allen Newell and Herbert A. Simon",
title = "Computer Science as Empirical Inquiry: Symbols and
Search",
journal = j-CACM,
volume = "19",
number = "3",
pages = "113--126",
month = mar,
year = "1976",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/360018.360022",
ISSN = "0001-0782",
MRclass = "68-01",
MRnumber = "57 4555",
bibdate = "Mon Jan 22 07:09:14 MST 2001",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm19.html#NewellS76",
acknowledgement = ack-nhfb,
classcodes = "C1230 (Artificial intelligence); C6130 (Data handling
techniques)",
corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA",
keywords = "artificial intelligence; cognition; computer science;
empirical inquiry; heuristic programming; heuristic
search; list; list processing; physical symbol systems;
problem solving; processing; symbols; Turing",
oldlabel = "NewellS76",
remark = "This is the 1975 ACM Turing Award Lecture.",
treatment = "A Application; P Practical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/NewellS76",
}
@Article{Scott:1977:LPL,
author = "Dana S. Scott",
title = "Logic and Programming Languages",
journal = j-CACM,
volume = "20",
number = "9",
pages = "634--641",
month = sep,
year = "1977",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/359810.359826",
ISSN = "0001-0782",
MRclass = "68A05",
MRnumber = "56 10114",
MRreviewer = "Horst Reichel",
bibdate = "Mon Jan 22 07:20:11 MST 2001",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
http://dblp.uni-trier.de/db/journals/cacm/cacm20.html#Scott77",
abstract = "Logic has been long interested in whether answers to
certain questions are computable in principle, since
the outcome puts bounds on the possibilities of
formalization. It would seem that the understanding of
higher-level program features involves one with
infinite objects and forces one to pass through several
levels of explanation to go from the conceptual ideas
to the final simulation on a real machine. These levels
can be made mathematically exact if the right
abstractions can be found to represent the necessary
structures. In this paper, the author outlines his
approach to these problems, specifically his lambda
-calculus orientation.",
acknowledgement = ack-nhfb,
classcodes = "C4210 (Formal logic); C6140 (Programming languages)",
classification = "721; 723",
corpsource = "Math. Inst., Univ. of Oxford, Oxford, UK",
journalabr = "Commun ACM",
keywords = "automata theory --- Computability and Decidability;
computability and decidability; computability theory;
computational linguistics; computer metatheory;
computer programming languages; decision methods;
formal logic; methods of logic; programming languages;
semantical; syntactic formalization; theory",
oldlabel = "Scott77",
remark = "This is the 1976 ACM Turing Award Lecture.",
treatment = "A Application; T Theoretical or Mathematical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Scott77",
}
@Article{Backus:1978:CPL,
author = "John Backus",
title = "Can Programming Be Liberated From the {von Neumann}
Style? {A} Functional Style and its Algebra of
Programs",
journal = j-CACM,
volume = "21",
number = "8",
pages = "613--641",
month = aug,
year = "1978",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/359576.359579",
ISSN = "0001-0782",
bibdate = "Mon Jan 22 06:22:32 MST 2001",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1978.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.misc.bib;
http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#Backus78",
note = "Reproduced in ``Selected Reprints on Dataflow and
Reduction Architectures'' ed. S. S. Thakkar, IEEE,
1987, pp. 215-243.",
abstract = "Conventional programming languages are growing ever
more enormous, but not stronger. Inherent defects at
the most basic level cause them to be both fat and
weak: their primitive word-at-a-time style of
programming inherited from their common ancestor, the
von Neumann computer; their division of programming
into a world of expressions and a world of statements;
their inability to effectively use powerful combining
forms for building new programs from existing ones; and
their lack of useful mathematical properties for
reasoning about programs. An alternative functional
style of programming is founded on the use of combining
forms for creating programs. Functional programs deal
with structured data, are often nonrepetitive and
nonrecursive, are hierarchically constructed, do not
name their arguments, and do not require the complex
machinery of procedure declarations to become generally
applicable. Combining forms can use high level programs
to build still higher level ones in a style not
possible in conventional languages.",
acknowledgement = ack-nhfb,
annote = "Conventional programming languages are growing ever
more enormous, but not stronger. Inherent defects at
the most basic level cause them to be both fat and
weak: their primitive word-at-a-time style of
programming inherited from their common ancestor - the
von Neumann computer, their close coupling of semantics
to state transitions, their division of programming
into a world of expressions and a world of statements,
their inability to effectively \ldots{}",
classcodes = "C6140 (Programming languages)",
classification = "723",
corpsource = "IMB Res. Lab., San Jose, CA, USA",
descriptors = "Programming language; reliability; future outlook; von
Neumann computer; applicative computing system;",
journalabr = "Commun ACM",
keywords = "4.29; 5.20; 5.24; 5.26; algebra of programs;
applicative computing systems; combining forms;
computer metatheory; conventional languages; CR
categories: 4.20; functional style; grecommended91; Key
words and phrases: functional programming;
metacomposition; models of computing systems; program
correctness; program termination; program
transformation; programming languages; Rhighnam;
structured data; theory ak; Turing Award Lecture; von
Neuman style; von Neumann computers; von Neumann
languages",
oldlabel = "Backus78",
remark = "This is the 1977 ACM Turing Award Lecture.",
treatment = "T Theoretical or Mathematical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Backus78",
}
@Article{Floyd:1979:PP,
author = "Robert W. Floyd",
title = "The Paradigms of Programming",
journal = j-CACM,
volume = "22",
number = "8",
pages = "455--460",
month = aug,
year = "1979",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/359138.359140",
ISSN = "0001-0782",
bibdate = "Mon Jan 22 06:40:01 MST 2001",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/constr.logic.bib;
http://dblp.uni-trier.de/db/journals/cacm/cacm22.html#Floyd79",
acknowledgement = ack-nhfb,
classcodes = "C6110 (Systems analysis and programming)",
corpsource = "Dept. of Computer Sci., Stanford Univ., Stanford, CA,
USA",
keywords = "computer programs; languages; paradigms; programming;
structural programming",
oldlabel = "Floyd79",
remark = "This is the 1978 ACM Turing Award Lecture.",
treatment = "G General Review",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Floyd79",
}
@Article{Iverson:1980:NTT,
author = "Kenneth E. Iverson",
title = "Notation as a Tool of Thought",
journal = j-CACM,
volume = "23",
number = "8",
pages = "444--465",
month = aug,
year = "1980",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/358896.358899",
ISSN = "0001-0782",
MRclass = "00A25 (68-02)",
MRnumber = "82b:00007",
MRreviewer = "B. Brainerd",
bibdate = "Tue Dec 26 13:35:07 1995",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib",
acknowledgement = ack-nhfb,
keywords = "CACM apl programming languages",
remark = "This is the 1979 ACM Turing Award Lecture.",
}
@Article{Hoare:1981:EOC,
author = "Charles Anthony Richard Hoare",
title = "The {Emperor}'s Old Clothes",
journal = j-CACM,
volume = "24",
number = "2",
pages = "75--83",
year = "1981",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/358549.358561",
ISSN = "0001-0782",
bibdate = "Mon Jan 22 06:50:25 MST 2001",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Hoare81",
note = "This is the 1980 ACM Turing Award Lecture, delivered
at ACM'80, Nashville, Tennessee, October 27, 1980.",
acknowledgement = ack-nhfb,
oldlabel = "Hoare81",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hoare81",
}
@Article{Codd:1982:RDP,
author = "E. F. Codd",
title = "Relational Database: {A} Practical Foundation for
Productivity",
journal = j-CACM,
volume = "25",
number = "2",
pages = "109--117",
month = feb,
year = "1982",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/358396.358400",
ISSN = "0001-0782",
bibdate = "Mon Feb 12 14:34:33 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib
and
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib",
acknowledgement = ack-nhfb,
annote = "This is the 1981 ACM Turing Award Lecture, delivered
at ACM, Los Angeles, CA, Nov. 9, 1981.",
}
@Article{Cook:1983:OCC,
author = "Stephen A. Cook",
title = "An Overview of Computational Complexity",
journal = j-CACM,
volume = "26",
number = "6",
pages = "400--408",
month = jun,
year = "1983",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/358141.358144",
ISSN = "0001-0782",
MRclass = "68C25",
MRnumber = "84m:68035",
MRreviewer = "R. E. Ladner",
bibdate = "Tue Dec 26 13:35:07 1995",
acknowledgement = ack-nhfb,
keywords = "complexity of computing the matrix permanent",
remark = "This is the 1982 ACM Turing Award Lecture.",
}
@Article{Ritchie:1984:RSR,
author = "Dennis M. Ritchie",
title = "Reflections on Software Research",
journal = j-CACM,
volume = "27",
number = "8",
pages = "758--760",
month = aug,
year = "1984",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/358198.358207",
ISSN = "0001-0782",
bibdate = "Mon Jan 27 13:18:03 1997",
acknowledgement = ack-nhfb,
remark = "This is part one of the 1983 Turing Award Lecture.",
}
@Article{Thompson:1984:RTT,
author = "Ken Thompson",
title = "Reflections on Trusting Trust",
journal = j-CACM,
volume = "27",
number = "8",
pages = "761--763",
month = aug,
year = "1984",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/358198.358210",
ISSN = "0001-0782",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib",
acknowledgement = ack-nhfb,
keywords = "security unix",
remark = "This is part two of the 1983 Turing Award Lecture.",
}
@Article{Wirth:1985:PLD,
author = "Niklaus Wirth",
title = "From programming language design to computer
construction",
journal = j-CACM,
volume = "28",
number = "2",
pages = "160--164",
month = feb,
year = "1985",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/2786.2789",
ISSN = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/2789.html",
acknowledgement = ack-nhfb,
keywords = "design; human factors; languages",
remark = "This is the 1984 Turing Award Lecture.",
subject = "{\bf K.2}: Computing Milieux, HISTORY OF COMPUTING,
Software. {\bf D.3.2}: Software, PROGRAMMING LANGUAGES,
Language Classifications.",
}
@Article{Karp:1986:CCR,
author = "Richard M. Karp",
title = "Combinatorics, complexity, and randomness",
journal = j-CACM,
volume = "29",
number = "2",
pages = "98--109",
month = feb,
year = "1986",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/5657.5658",
ISSN = "0001-0782",
MRclass = "68Q15 (68Q25 68R05 68R10 90B10)",
MRnumber = "824 352",
bibdate = "Fri Apr 5 10:03:00 MST 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib;
http://www.acm.org/pubs/toc/",
note = "This is the 1985 ACM Turing Award Lecture. It traces
the development of combinatorial optimization and
computational complexity theory. It discusses
probabilistic algorithms and probabilistic analysis of
approximation algorithms for {\em NP}-complete
optimization problems.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/5658.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; performance; theory",
review = "ACM CR 8610-0921",
subject = "{\bf F.1.0}: Theory of Computation, COMPUTATION BY
ABSTRACT DEVICES, General. {\bf G.2.1}: Mathematics of
Computing, DISCRETE MATHEMATICS, Combinatorics. {\bf
K.2}: Computing Milieux, HISTORY OF COMPUTING, People.
{\bf F.0}: Theory of Computation, GENERAL. {\bf F.2.0}:
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, General. {\bf G.2.2}: Mathematics
of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf
F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Complexity Classes, Reducibility and
completeness. {\bf F.1.3}: Theory of Computation,
COMPUTATION BY ABSTRACT DEVICES, Complexity Classes,
Relations among complexity classes. {\bf K.2}:
Computing Milieux, HISTORY OF COMPUTING.",
}
@Article{Hopcroft:1987:CSE,
author = "John E. Hopcroft",
title = "Computer Science: The Emergence of a Discipline",
journal = j-CACM,
volume = "30",
number = "3",
pages = "198--202",
month = mar,
year = "1987",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/214748.214750",
ISSN = "0001-0782",
MRclass = "68-00",
MRnumber = "886 124",
bibdate = "Sat Apr 06 08:06:23 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/214750.html",
acknowledgement = ack-nhfb,
keywords = "human factors",
remark = "This is part one of the 1986 ACM Turing Award
Lecture.",
subject = "{\bf K.2}: Computing Milieux, HISTORY OF COMPUTING,
People. {\bf A.0}: General Literature, GENERAL,
Biographies/autobiographies. {\bf A.0}: General
Literature, GENERAL.",
}
@Article{McCarthy:1987:GAI,
author = "John McCarthy",
title = "Generality in artificial intelligence",
journal = j-CACM,
volume = "30",
number = "12",
pages = "1030--1035",
month = dec,
year = "1987",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/33447.33448",
ISSN = "0001-0782",
MRclass = "68T01 (68T05 68T20 68T30)",
MRnumber = "89k:68128",
MRreviewer = "Alexander George",
bibdate = "Sat Apr 06 08:06:23 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/33448.html",
abstract = "My 1971 Turing Award Lecture was entitled ``Generality
in Artificial Intelligence.'' The topic turned out to
have been overambitious in that I discovered I was
unable to put my thoughts on the subject in a
satisfactory written form at that time. It would have
been better to have reviewed my previous work rather
than attempt something new, but such was not my custom
at that time. I am grateful to ACM for the opportunity
to try again. Unfortunately for our science, although
perhaps fortunately for this project, the problem of
generality in artificial intelligence (AI) is almost as
unsolved as ever, although we now have many ideas not
available in 1971. This paper relies heavily on such
ideas, but it is far from a full 1987 survey of
approaches for achieving generality. Ideas are
therefore discussed at a length proportional to my
familiarity with them rather than according to some
objective criterion. It was obvious in 1971 and even in
1958 that AI programs suffered from a lack of
generality. It is still obvious; there are many more
details. The first gross symptom is that a small
addition to the idea of a program often involves a
complete rewrite beginning with the data structures.
Some progress has been made in modularizing data
structures, but small modifications of the search
strategies are even less likely to be accomplished
without rewriting. Another symptom is no one knows how
to make a general database of commonsense knowledge
that could be used by any program that needed the
knowledge. Along with other information, such a
database would contain what a robot would need to know
about the effects of moving objects around, what a
person can be expected to know about his family, and
the facts about buying and selling. This does not
depend on whether the knowledge is to be expressed in a
logical language or in some other formalism. When we
take the logic approach to AI, lack of generality shows
up in that the axioms we devise to express commonsense
knowledge are too restricted in their applicability for
a general commonsense database. In my opinion, getting
a language for expressing general commonsense knowledge
for inclusion in a general database is the key problem
of generality in AI. Here are some ideas for achieving
generality proposed both before and after 1971. I
repeat my disclaimer of comprehensiveness.",
acknowledgement = ack-nhfb,
keywords = "design; languages",
remark = "This is the 1971 Turing Award Lecture, sixteen years
late.",
review = "ACM CR 8807-0539",
subject = "{\bf I.2.0}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, General. {\bf K.2}: Computing Milieux,
HISTORY OF COMPUTING, Theory.",
}
@Article{Tarjan:1987:AD,
author = "Robert E. Tarjan",
title = "Algorithm Design",
journal = j-CACM,
volume = "30",
number = "3",
pages = "204--212",
month = mar,
year = "1987",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/214748.214752",
ISSN = "0001-0782",
MRclass = "68Q20 (68Q25)",
MRnumber = "886 125",
bibdate = "Tue Dec 26 13:35:07 1995",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/214752.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
remark = "This is part two of the 1986 ACM Turing Award
Lecture.",
subject = "{\bf F.2.0}: Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, General. {\bf K.2}:
Computing Milieux, HISTORY OF COMPUTING, People. {\bf
A.0}: General Literature, GENERAL,
Biographies/autobiographies.",
}
@Article{Cocke:1988:SPS,
author = "John Cocke",
title = "The search for performance in scientific processors:
the {Turing Award Lecture}",
journal = j-CACM,
volume = "31",
number = "3",
pages = "250--253",
month = mar,
year = "1988",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/42392.42394",
ISSN = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/42394.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; experimentation; languages;
performance",
remark = "This is the 1987 ACM Turing Award Lecture.",
review = "ACM CR 8907-0507",
subject = "{\bf K.2}: Computing Milieux, HISTORY OF COMPUTING,
Systems. {\bf A.0}: General Literature, GENERAL,
Biographies/autobiographies. {\bf K.2}: Computing
Milieux, HISTORY OF COMPUTING, Hardware. {\bf C.4}:
Computer Systems Organization, PERFORMANCE OF SYSTEMS.
{\bf C.1.0}: Computer Systems Organization, PROCESSOR
ARCHITECTURES, General.",
}
@Article{Peled:1988:JCA,
author = "Abraham Peled",
title = "{John Cocke}: {The} 1987 {ACM A. M. Turing Award}
recipient",
journal = j-CACM,
volume = "31",
number = "3",
pages = "249--249",
month = mar,
year = "1988",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/42392.42393",
ISSN = "0001-0782",
bibdate = "Mon Jan 22 07:12:04 MST 2001",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
http://dblp.uni-trier.de/db/journals/cacm/cacm31.html#Peled88;
http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/42393.html",
acknowledgement = ack-nhfb,
keywords = "human factors",
oldlabel = "Peled88",
subject = "{\bf A.0}: General Literature, GENERAL,
Biographies/autobiographies. {\bf K.2}: Computing
Milieux, HISTORY OF COMPUTING.",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Peled88",
}
@Article{Sutherland:1989:M,
author = "I. E. Sutherland",
title = "Micropipelines",
journal = j-CACM,
volume = "32",
number = "6",
pages = "720--738",
month = jun,
year = "1989",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/63526.63532",
ISSN = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/63532.html",
acknowledgement = ack-nhfb,
keywords = "design; performance",
remark = "This is the 1988 ACM Turing Award Lecture. The 1989
ACM Turing Award was given to William Kahan, but his
lecture was never published.",
subject = "{\bf B.5.1}: Hardware, REGISTER-TRANSFER-LEVEL
IMPLEMENTATION, Design, Control design. {\bf B.5.1}:
Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION,
Design, Data-path design. {\bf B.5.1}: Hardware,
REGISTER-TRANSFER-LEVEL IMPLEMENTATION, Design, Styles.
{\bf B.1.1}: Hardware, CONTROL STRUCTURES AND
MICROPROGRAMMING, Control Design Styles, Hardwired
control. {\bf B.7.1}: Hardware, INTEGRATED CIRCUITS,
Types and Design Styles, VLSI (very large scale
integration).",
}
@TechReport{Kahan:1990:BPA,
author = "W. Kahan",
title = "Better to prescribe arithmetic than describe it",
institution = inst-BERKELEY-CS,
address = inst-BERKELEY-CS:adr,
day = "21",
month = feb,
year = "1990",
bibdate = "Mon Apr 25 18:24:02 2005",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
ftp://ftp.math.utah.edu/pub/tex/bib/acm-turing-awards.bib",
note = "Turing Award Lecture presented at the ACM 18th Annual
Computer Science Conference on Cooperation, February
20--22, 1990, Sheraton Washington Hotel, Washington,
DC, USA, but never published. Some material from this
talk appears in later publications by W. Kahan.",
URL = "http://www.math.utah.edu/pub/bibnet/authors/k/kahan-william-m.html",
acknowledgement = ack-nhfb,
mynote = "Same talk given at Toronto 10 April 1990.",
}
@Article{Corbato:1991:BSW,
author = "Fernando J. Corbat{\'o}",
title = "On building systems that will fail",
journal = j-CACM,
volume = "34",
number = "9",
pages = "72--81",
month = sep,
year = "1991",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/114669.114686",
ISSN = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/114686.html",
acknowledgement = ack-nhfb,
keywords = "design; human factors; management; performance;
reliability; security",
remark = "This is the 1990 ACM Turing Award Lecture.",
subject = "{\bf C.4}: Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Reliability, availability, and
serviceability. {\bf C.2.0}: Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, General.
{\bf K.6.1}: Computing Milieux, MANAGEMENT OF COMPUTING
AND INFORMATION SYSTEMS, Project and People Management.
{\bf D.4.5}: Software, OPERATING SYSTEMS,
Reliability.",
}
@Article{Frenkel:1991:IFJ,
author = "Karen A. Frenkel",
title = "An Interview with {Fernando Jos{\'e} Corbat{\'o}}",
journal = j-CACM,
volume = "34",
number = "9",
pages = "82--90",
month = sep,
year = "1991",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/114669.114688",
ISSN = "0001-0782",
bibdate = "Sat Apr 06 08:06:44 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/114688.html",
acknowledgement = ack-nhfb,
keywords = "design; human factors; management; performance;
reliability",
subject = "{\bf K.2}: Computing Milieux, HISTORY OF COMPUTING.
{\bf C.4}: Computer Systems Organization, PERFORMANCE
OF SYSTEMS. {\bf C.2.0}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General. {\bf D.4.0}:
Software, OPERATING SYSTEMS, General.",
}
@Article{Frenkel:1993:IRM,
author = "Karen A. Frenkel",
title = "An interview with {Robin Milner}",
journal = j-CACM,
volume = "36",
number = "1",
pages = "90--97",
month = jan,
year = "1993",
CODEN = "CACMA2",
ISSN = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/151241.html",
acknowledgement = ack-nhfb,
keywords = "theory",
subject = "{\bf F.0}: Theory of Computation, GENERAL. {\bf K.2}:
Computing Milieux, HISTORY OF COMPUTING, People.",
}
@Article{Milner:1993:EIT,
author = "Robin Milner",
title = "Elements of interaction: {Turing Award Lecture}",
journal = j-CACM,
volume = "36",
number = "1",
pages = "78--89",
month = jan,
year = "1993",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/151233.151240",
ISSN = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/151240.html",
acknowledgement = ack-nhfb,
keywords = "languages; theory",
remark = "This is the 1991 ACM Turing Award Lecture.",
subject = "{\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal
Definitions and Theory, Semantics. {\bf D.3.2}:
Software, PROGRAMMING LANGUAGES, Language
Classifications, Concurrent, distributed, and parallel
languages. {\bf F.1.2}: Theory of Computation,
COMPUTATION BY ABSTRACT DEVICES, Modes of Computation,
Parallelism and concurrency. {\bf F.3.2}: Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
of Programming Languages, Algebraic approaches to
semantics. {\bf F.3.3}: Theory of Computation, LOGICS
AND MEANINGS OF PROGRAMS, Studies of Program
Constructs, Control primitives. {\bf F.3.3}: Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
of Program Constructs, Functional constructs. {\bf
F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Mathematical Logic, Lambda calculus
and related systems.",
}
@Article{Hartmanis:1994:TAL,
author = "Juris Hartmanis",
title = "{Turing Award Lecture}: On Computational Complexity
and the Nature of Computer Science",
journal = j-CACM,
volume = "37",
number = "10",
pages = "37--43",
month = oct,
year = "1994",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/194313.214781",
ISSN = "0001-0782",
bibdate = "Sat Apr 06 08:07:15 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/214781.html",
acknowledgement = ack-nhfb,
keywords = "human factors; theory",
remark = "This is part one of the 1993 ACM Turing Award
Lecture.",
subject = "{\bf F.0}: Theory of Computation, GENERAL. {\bf K.2}:
Computing Milieux, HISTORY OF COMPUTING, People.",
}
@Article{Stearns:1994:TAL,
author = "Richard Edwin Stearns",
title = "{Turing} Award Lecture: It's Time to Reconsider Time",
journal = j-CACM,
volume = "37",
number = "11",
pages = "95--99",
month = nov,
year = "1994",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/188280.188379",
ISSN = "0001-0782",
bibdate = "Sat Apr 06 08:07:20 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/188379.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; measurement; performance; theory",
remark = "This is part two of the 1993 ACM Turing Award
Lecture.",
subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY
ABSTRACT DEVICES, Complexity Classes. {\bf F.0}: Theory
of Computation, GENERAL.",
}
@Article{Feigenbaum:1996:TAL,
author = "Edward A. Feigenbaum",
title = "{Turing Award Lecture}: How the ``What'' Becomes the
``How''",
journal = j-CACM,
volume = "39",
number = "5",
pages = "97--104",
month = may,
year = "1996",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/229459.229471",
ISSN = "0001-0782",
bibdate = "Mon Jan 6 09:19:11 MST 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/cacm/229471.html",
acknowledgement = ack-nhfb,
remark = "This is part one of the 1995 ACM Turing Award
Lecture.",
subject = "{\bf I.2.1}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Applications and Expert Systems. {\bf
F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Models of Computation, Bounded-action devices.
{\bf I.2.0}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, General.",
}
@Article{Reddy:1996:TAL,
author = "Raj Reddy",
title = "{Turing Award Lecture}: To Dream The Possible Dream",
journal = j-CACM,
volume = "39",
number = "5",
pages = "105--112",
month = may,
year = "1996",
CODEN = "CACMA2",
DOI = "http://doi.acm.org/10.1145/229459.233436",
ISSN = "0001-0782",
bibdate = "Mon Jan 6 09:19:11 MST 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/cacm/233436.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; humanfactors",
remark = "This is part two of the 1995 ACM Turing Award
Lecture.",
subject = "{\bf I.2.0}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, General. {\bf I.2.6}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Learning.",
}
@InProceedings{Pnueli:1997:MTA,
author = "Amir Pnueli",
title = "{A. M. Turing Award Lecture}: Verification
engineering: a future profession",
crossref = "ACM:1997:PSA",
pages = "7--7",
year = "1997",
DOI = "http://doi.acm.org/10.1145/259380.259407",
bibdate = "Sat Nov 19 08:36:36 2005",
note = "This is the 1996 ACM Turing Award Lecture, but only
the abstract is published.",
acknowledgement = ack-nhfb,
}
@Misc{Engelbart:1998:CIF,
author = "Douglas Engelbart",
title = "Collective {IQ} and a Framework for Bootstrapping our
Society --- {ACM Turing Award Lecture}",
howpublished = "Talk at 1998 ACM Conference on Computer Supported
Cooperative Work (CSCW'98), Seattle, Washington, USA.
Also presented June 24, 1998 at Hypertext (HT'98) and
Digital Libraries (DL'98) combined conference, Marriott
City Center, Pittsburgh, PA, USA, but does not appear
in the proceedings of either conference",
month = nov,
year = "1998",
bibdate = "Sat Nov 19 08:12:37 2005",
URL = "http://www.acm.org/sigchi/cscw98/;
http://www.acm.org/sigchi/cscw98/program/plenaries.html#engelbart",
acknowledgement = ack-nhfb,
keywords = "Mr. Mouse",
}
@Unpublished{Brooks:1999:DDA,
author = "Frederick P. {Brooks, Jr.}",
title = "The Design of Design: {ACM Turing Award Lecture}",
year = "1999",
bibdate = "Sat Nov 19 07:20:07 2005",
note = "The Lecture was presented at the SIGGRAPH 2000
Conference. It was reported in \cite{Brooks:2002:IOS}
to appear in Communications of the ACM, but has yet to
be published.",
URL = "http://terra.cs.nps.navy.mil/DistanceEducation/online.siggraph.org/2001/SpecialSessions/2000TuringLecture-DesignOfDesign/session.html",
acknowledgement = ack-nhfb,
}
@TechReport{Gray:1999:WND,
author = "Jim Gray",
title = "What next? {A} dozen remaining {IT} problems",
type = "Technical report",
number = "TR-99-50",
institution = "Microsoft Research",
address = "San Francisco, CA, USA",
year = "1999",
bibdate = "Fri Nov 18 20:10:25 2005",
bibsource = "http://www.research.microsoft.com/~gray/",
note = "Also presented at SIGMOD '99 Conference, Philadelphia,
PA, USA, June 1--3, 1999, but not published as a paper
in the proceedings. A video of the lecture is included
in the electronic proceedings \cite{Delis:1999:PAS},
but is not accessible without a SIGMOD Authenticator
username and password.",
URL = "ftp://ftp.research.microsoft.com/pub/tr/tr-99-50.pdf;
http://research.microsoft.com/scripts/pubs/view.asp?TR_ID=MSR-TR-99-50",
acknowledgement = ack-nhfb,
}
@InProceedings{Brooks:2002:IOS,
author = "Frederick P. {Brooks, Jr.}",
title = "The {IBM Operating System\slash 360}",
crossref = "Broy:2002:SPC",
pages = "170--178",
year = "2002",
bibdate = "Sat Nov 19 07:28:29 2005",
acknowledgement = ack-nhfb,
}
@Misc{Madsen:2002:SSO,
author = "Ole Lehrmann Madsen",
title = "The {Scandinavian School of Object-Orientation --- in
memory of Ole-Johan Dahl and Kristen Nygaard}",
howpublished = "OOPSLA 2002 talk.",
address = "Ole-Johan Dahl and Kristen Nygaard---the founders of
object-oriented programming---passed away this summer
within just a few weeks of each other. The software
community has lost two great pioneers who, through
their collaboration in the 1960s leading to the Simula
language and object-oriented programming, have had
enormous influence on software technology. ``For their
role in the invention of object-oriented programming,
the most widely used programming model today,'' they
were given the A.M. Turing Award. (From the ACM press
release on February 6, 2002).\par
Kristen Nygaard was to give his Turing award lecture at
OOPSLA 2002 on Simula and its development. Simula was
originally designed as a simulation language, with the
purpose of supporting analysis of large and complex
systems. Because of this, the modelling capabilities of
languages always have been central to the Scandinavian
school of object orientation.",
day = "7",
month = nov,
year = "2002",
bibdate = "Sat Nov 19 07:34:38 2005",
URL = "http://oopsla.acm.org/oopsla2002/fp/files/spe-concepts.html;
http://heim.ifi.uio.no/~kristen/;
http://www.ifi.uio.no/in_memoriam_kristen/;
http://www.interesting-people.org/archives/interesting-people/200208/msg00032.html",
acknowledgement = ack-nhfb,
subjectdates = "Ole-Johan Dahl (1931 -- June 29, 2002); Kristen
Nygaard (1926 -- August 10, 2002)",
}
@Misc{Adleman:2003:TLP,
author = "Leonard M. Adleman",
title = "{Turing Lecture} on Pre {RSA} Days",
howpublished = "World-Wide Web slide presentation, video, and audio.",
year = "2003",
bibdate = "Sat Nov 19 07:46:28 2005",
URL = "http://www.acm.org/turingawardlecture/RSA/",
acknowledgement = ack-nhfb,
}
@Misc{Rivest:2003:TLE,
author = "Ronald L. Rivest",
title = "{Turing Lecture} on Early {RSA} Days",
howpublished = "World-Wide Web slide presentation, video, and audio.",
year = "2003",
bibdate = "Sat Nov 19 07:46:28 2005",
URL = "http://www.acm.org/turingawardlecture/RSA/",
acknowledgement = ack-nhfb,
}
@Misc{Shamir:2003:TLC,
author = "Adi Shamir",
title = "{Turing Lecture} on Cryptology: {A} Status Report",
howpublished = "World-Wide Web slide presentation, video, and audio.",
year = "2003",
bibdate = "Sat Nov 19 07:46:28 2005",
URL = "http://www.acm.org/turingawardlecture/RSA/",
acknowledgement = ack-nhfb,
}
@Misc{Kay:2004:ATL,
author = "Alan Kay",
title = "{ACM Turing Lecture}: Introductions To Computing
Should Be Child's Play",
howpublished = "World-Wide Web document.",
day = "26",
month = oct,
year = "2004",
bibdate = "Sat Nov 19 07:53:20 2005",
URL = "http://www.oopsla.org/2004/ShowEvent.do?id=421",
abstract = "Perhaps the most disturbing ``trend which became
reality'' over the last 25 years has been a
recharacterization and professing of the various
computing fields as though Computer Science and
Software Engineering have actually been invented and
can be taught in ways that parallel fields such as
physics and structural engineering. This is ``science
\& engineering envy'' pure and simple!\par
The result is that so much of what is taught in high
schools and universities looks backwards?not for
historical interest, which is almost absent, or even to
great ideas of the past?but (a) to emphasize what all
too often have been workarounds for what we don't yet
know how to do, and (b) to substitute vocational
training for real knowledge and perspective.\par
One of the most interesting characteristics of
computing in the best universities of the 1960s was
that the professors told the students that nothing much
of importance was known, and it was the duty of all to
try to invent a real computing science and software
engineering. This was a very healthy attitude and led
to many good starts towards qualitatively better
approaches to our exciting area of interest. Just as
``civilization'' is not a place or state, but a process
of people who are trying to be more civilized, real
computing is the process of people trying to make a
better notion of computing. The most progress will be
made by young people who have been encouraged to
criticize old conceptions and invent new ones with an
elevated notion of what constitutes a high threshold
for a good idea.\par
It is the duty of all enfranchised computerists to help
this happen. Since our paths of thinking are so
conditioned by the early environments we put so much
effort into learning, it is of critical importance to
pay the highest attention to the introductions to our
field for children, young adults and college students.
This talk is about how we might introduce computing to
beginners to help them see the real beauties and
possibilities of our field in a way that will both get
them fluent in the small amout of good stuff that is
known, and most importantly to encourage them to make
qualitative improvements in computing.",
acknowledgement = ack-nhfb,
}
@Misc{Cerf:2005:ATL,
author = "Vinton Cerf and Robert Kahn",
title = "{ACM Turing Lecture}: Assessing the {Internet}:
Lessons Learned, Strategies for Evolution, and Future
Possibilities",
howpublished = "World-Wide Web document",
day = "22",
month = aug,
year = "2005",
bibdate = "Sat Nov 19 08:06:33 2005",
URL = "http://www.sigcomm.org/sigcomm2005/turinglecture.html;
http://www.sigcomm.org/sigcomm2005/webcast.html;
http://beansidhe.isc-net.upenn.edu:8080/ramgen/seas/Turing.rm",
acknowledgement = ack-nhfb,
}
%%% ====================================================================
%%% Cross-referenced entries must come last:
@Book{Anonymous:1987:ATA,
author = "Anonymous",
booktitle = "{ACM Turing Award Lectures}: the first twenty years,
1966--1985",
title = "{ACM Turing Award Lectures}: the first twenty years,
1966--1985",
publisher = pub-ACM # " and " # pub-AW,
address = pub-ACM:adr # " and " # pub-AW:adr,
pages = "xviii + 483",
year = "1987",
ISBN = "0-201-07794-9",
ISBN-13 = "978-0-201-07794-0",
LCCN = "QA76.24 .A33 1987",
bibdate = "Mon Jun 06 17:50:49 2005",
bibsource = "z3950.loc.gov:7090/Voyager",
series = "ACM Press anthology series",
acknowledgement = ack-nhfb,
subject = "Electronic data processing; Computers",
}
@Proceedings{ACM:1997:PSA,
editor = "{ACM}",
booktitle = "{Proceedings of the sixteenth annual ACM symposium on
Principles of distributed computing 1997, Santa
Barbara, California, USA, August 21--24, 1997}",
title = "{Proceedings of the sixteenth annual ACM symposium on
Principles of distributed computing 1997, Santa
Barbara, California, USA, August 21--24, 1997}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "viii + 297",
year = "1997",
ISBN = "0-89791-952-1",
ISBN-13 = "978-0-89791-952-4",
LCCN = "QA76.9.D5 A33 1997",
bibdate = "Sat Nov 19 08:33:14 2005",
bibsource = "z3950.loc.gov:7090/Voyager",
note = "ACM order number 536970.",
acknowledgement = ack-nhfb,
subject = "Electronic data processing; Distributed processing;
Congresses",
}
@Proceedings{Delis:1999:PAS,
editor = "Alex Delis and Christos Faloutsos and Shahram
Ghandeharizadeh",
booktitle = "Proceedings of the 1999 ACM SIGMOD International
Conference on Management of Data: SIGMOD '99,
Philadelphia, PA, USA, June 1--3, 1999",
title = "Proceedings of the 1999 {ACM} {SIGMOD} International
Conference on Management of Data: {SIGMOD} '99,
Philadelphia, {PA}, {USA}, June 1--3, 1999",
volume = "28(2)",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xii + 602",
year = "1999",
ISBN = "????",
ISSN = "0163-5808",
LCCN = "QA1 .A87",
bibdate = "Wed Oct 25 08:47:40 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/",
series = j-SIGMOD,
URL = "http://www.sigmod.org/sigmod/disc/m_search.htm;
http://www.sigmod.org/sigmod/disc/m_plenary_talks.htm",
acknowledgement = ack-nhfb,
keywords = "SIGMOD '99",
}
@Proceedings{Broy:2002:SPC,
editor = "M. Broy and Ernst Denert",
booktitle = "Software pioneers: contributions to software
engineering",
title = "Software pioneers: contributions to software
engineering",
publisher = pub-SV,
address = pub-SV:adr,
pages = "728",
year = "2002",
ISBN = "3-540-43081-4",
ISBN-13 = "978-3-540-43081-0",
LCCN = "QA76.2.A2 S62 2002",
bibdate = "Sat Nov 19 07:27:22 MST 2005",
bibsource = "z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
remark = "Based on a conference organized by sd and m in Bonn,
Germany, June 2001.",
subject = "Computers; Biography; Electronic data processing
personnel; Biography; Software engineering; History",
}