DOCSLIB.ORG

September 1996 Y Portfolio Ofresearch NSF Divisionslightlychanges Pnos

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

COMPUTING RESEARCH NEWS The News Journal of the Computing Research Association September 1996 Vol. 8/No. 4 NSF division slightly changes HPC Act about to expire; portfolio of research priorities renewal is not expected BY Richard B. Kieburtz BY Fred W. Weingarten One has to suspect that the The National Science Foundation’s research sponsorship programs in the CRA Staff acronym, HPCC, is about to sink Division of Computer and Computation Research (CCR) have undergone without a trace. (The Office of the a facelift, making room for a new program in experimental software On December 9 the High-Perfor- National Coordinator for HPCC, systems in fiscal 1997. The portfolio of research areas supported by the mance Computing Act will quietly division will not change radically, although there are some shifts in expire. No ceremony, no wake, no headed by John Toole, is changing its priorities. The new program is intended to enable researchers to conduct memorial service will mark the name to National Coordinator for significant experimental investigations, supporting projects of larger size occasion. Evidently no tears will be Computing, Information and Com- than have been typical in the past. shed in the administration, either, munication.) At hearings held earlier The impetus for change has come from a review of research in the even though the bill was closely this year by the House Science Computer and Information Science and Engineering Directorate, con- identified with Al Gore while he was Committee on a possible renewal of ducted by its external advisory committee last fall. The review team in the Senate. HPCC, the administration argued observed that as programs tried to stretch their budgets to support a So close was this identity, against reauthorization. rapidly increasing number of outstanding younger investigators, the President Bush was reluctant to sign There are several reasons offered average award had atrophied, losing about one-third of its spending power the legislation, despite its being for these changes, none of them over a 10-year period. A consequence has been a subtle shift in the kind of inherently bad for computing passed by heavy bipartisan majorities research that NSF grants have enabled, a shift away from experimental research. Some even find reasons for in both houses. Bush was concerned investigations toward less costly theoretical studies. The committee optimism from the last few years. Gore would run against him for recommended that NSF should provide ways to support top-quality First, the administration argues president and the issue might be experimental projects requiring more than average resources. It further that these changes, rather than raised in the campaign. recommended that team-oriented approaches, in which multiple investi- reflecting decreasing enthusiasm for gators can bring complementary expertise to a complex research activity, Bush was close to correct on the computing research, instead reflect should be encouraged and supported. first concern and very correct on the the continued broadening and The new program will address this need. It is intended to support second. For the first time ever, maturing of the program. Second, teams of investigators planning to undertake important investigations that computing research was at least any special initiative of this sort has a cannot easily be done in small fragments and to improve the quality of tangentially the subject of a presiden- natural trajectory of support. The experimental research in software systems and software engineering. A tial campaign, sneaking into debates public and politicians become bored word of caution is in order, however. No new funds are available in the under the guise of the National with the same old thing, and political Information Infrastructure. Now, four Continued on Page 9 interest in HPCC actually goes back years later, much has changed. Those more than a decade. Inside CRN curious about the candidates’ stands Finally, this presidential campaign on science policy will have to use an is different from the last one (they all Opinions .......................................... 2 Research News .............................. 9 electron microscope to find science are, of course). Four years ago the Expanding the Pipeline .................. 3-4 Washington Update ........................ 10 and technology, much less comput- CRA Conference at Snowbird ........ 5 Professional Opportunities ............. 11 Clinton/Gore campaign was trying to Association News ........................... 6-7 Technology Update ......................... 12 ing research, mentioned in the Awards and Honors ........................ 8 campaign. Continued on Page 9 Contrary to myth, CS&E doing well BY David Patterson • Print advertisements, cartoons, computer engineering end up getting CRA Board Chair movie trailers and even news shows programming jobs that have nothing PAID The following is an edited excerpt of a include e-mail addresses and URLs. to do with ME or CE. U.S. POSTAGE PERMIT NO. 3778 NONPROFIT ORG. talk David Patterson gave at the CRA • We are starting to see sympa- EECS departments at Berkeley, WASHINGTON, DC Conference at Snowbird in July. thetic characters who are in CS&E: the University of Michigan and the Myth #1: Compared to other the hit movie of 1996 is “Indepen- Massachusetts Institute of Technol- fields, computer science and engi- dence Day,” starring Jeff Goldblum as ogy historically have had many more neering (CS&E) is disadvantaged in an ecologically sensitive computer EE majors than CS majors. Starting attracting the best and brightest. genius who uses his computing skills in 1995-96, more than half of the (AKA: We need a TV show titled LA to literally save the planet. freshman who declared majors at Computer Engineer.) The reality is It can’t hurt that CS&E is the each school declared computer very different; our field is one of the field of one of the wealthiest people science as their major. These excel- most popular and attractive. in the world (Bill Gates), or that the lent public and private schools are Surely the pervasiveness of PCs Feb. 19, 1996, cover of Time maga- geographically distributed, so it seems and the World Wide Web will inspire zine featured 24-year-old Netscape plausible that this is a nationwide the curious to learn about the multimillionaire Marc Andreessen. trend. Freshman majors in 1996 underlying technology. I’m sure that colleagues in science would seem to be the leading We have two popular magazines and engineering fields are jealous of indicator for the senior majors in dedicated to computing that include our visibility and popularity. 2000. This sampling suggests to me articles explaining CS&E research; Myth #2: CS&E is shrinking, and that by that time we will have many for more than 25 years Byte magazine we will never match the mid-1980s CSEE departments. has popularized computing research, enrollments. (AKA: The academic sky My conclusion is that I expect and now we have the cool and is falling.) In contrast, I have noticed undergraduate CS&E majors to award-winning Wired magazine. How several small recent counter-examples. increase in popularity, provided our curriculum can leverage the excite- many other fields have such magazines? The College of Engineering at ment of the brave new world. The New York Times, the closest Berkeley has seen a shrinkage in Myth #3: CS&E is seen as a lesser we come to having a North Ameri- classical engineering at the under- field by our peers in engineering and can newspaper, dedicates every graduate level; the three most science. (AKA: Any field with the Monday’s Business section to popular majors are electrical engi- word “science” in the title is not one.) information technology. How many neering and computer science, This inferiority complex tends to other fields have one-seventh of the bioengineering and undeclared. be associated with the more senior mind share of such a newspaper? These are followed by mechanical, members of CS&E, but I’d like to Our society now includes many civil and industrial engineering. “cure” the complex in case it is signals that suggest the public should Moreover, I have been told many learn about computing technology: B.A.s in mechanical engineering or Continued on Page 7 CRA NW Ave. 1875 Connecticut Suite 718 DC 20009-5728 Washington, COMPUTING RESEARCH NEWS September 1996 Opinions Computing Research Association Electronic publishing plan a must their everyday concerns. We are pertaining to a given subject area or Board Officers BY Peter J. operating in a market of researchers interest. David A. Patterson Denning Chair In the May issue who think increasingly that printed This plan accomplishes the University of California, Berkeley of CRN (Page 2) journal publication is slow and objectives Ullman, Preparata and Mary Jane Irwin Jeff Ullman redundant compared with Web Savage discuss by moving toward all- Vice Chair wrote that the publication, of developers with many electronic research publication and Pennsylvania State University Internet is demands on their time, of educators dissemination without losing the Nancy G. Leveson changing the and students who want easy access to features of the current system that Secretary role of printed materials and of end-users who produce value for researchers. University of Washington journals because the Web—not the want rapid insights into changing In this context we developed a Michael R. Garey journals—is becoming the medium of technology. ACM is repositioning set of new copyright policies for Treasurer research communication. He its journals to produce new value cyberspace. We designed these Bell Labs, Lucent Technologies suggested that home page hits for these clients. policies to promote and facilitate Board Members (HPHs) become a measure of The electronic publishing plan is dissemination and recognize emerg- Alfred V. Aho research impact, replacing publica- the vehicle that will transport us to ing practices on the Web. The policy Columbia University tions in prestigious journals (PPJs). this destination. To generate value permits people using ACM materials Frances E.
Recommended publications
  • Computational Learning Theory: New Models and Algorithms

    Computational Learning Theory: New Models and Algorithms

    Computational Learning Theory: New Models and Algorithms by Robert Hal Sloan S.M. EECS, Massachusetts Institute of Technology (1986) B.S. Mathematics, Yale University (1983) Submitted to the Department- of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY June 1989 @ Robert Hal Sloan, 1989. All rights reserved The author hereby grants to MIT permission to reproduce and to distribute copies of this thesis document in whole or in part. Signature of Author Department of Electrical Engineering and Computer Science May 23, 1989 Certified by Ronald L. Rivest Professor of Computer Science Thesis Supervisor Accepted by Arthur C. Smith Chairman, Departmental Committee on Graduate Students Abstract In the past several years, there has been a surge of interest in computational learning theory-the formal (as opposed to empirical) study of learning algorithms. One major cause for this interest was the model of probably approximately correct learning, or pac learning, introduced by Valiant in 1984. This thesis begins by presenting a new learning algorithm for a particular problem within that model: learning submodules of the free Z-module Zk. We prove that this algorithm achieves probable approximate correctness, and indeed, that it is within a log log factor of optimal in a related, but more stringent model of learning, on-line mistake bounded learning. We then proceed to examine the influence of noisy data on pac learning algorithms in general. Previously it has been shown that it is possible to tolerate large amounts of random classification noise, but only a very small amount of a very malicious sort of noise.
  • Security Analysis of Cryptographically Controlled Access to XML Documents

    Security Analysis of Cryptographically Controlled Access to XML Documents

    Security Analysis of Cryptographically Controlled Access to XML Documents ¤ Mart´in Abadi Bogdan Warinschi Computer Science Department Computer Science Department University of California at Santa Cruz Stanford University [email protected] [email protected] ABSTRACT ments [4, 5, 7, 8, 14, 19, 23]. This line of research has led to Some promising recent schemes for XML access control em- e±cient and elegant publication techniques that avoid data ploy encryption for implementing security policies on pub- duplication by relying on cryptography. For instance, us- lished data, avoiding data duplication. In this paper we ing those techniques, medical records may be published as study one such scheme, due to Miklau and Suciu. That XML documents, with parts encrypted in such a way that scheme was introduced with some intuitive explanations and only the appropriate users (physicians, nurses, researchers, goals, but without precise de¯nitions and guarantees for the administrators, and patients) can see their contents. use of cryptography (speci¯cally, symmetric encryption and The work of Miklau and Suciu [19] is a crisp, compelling secret sharing). We bridge this gap in the present work. We example of this line of research. They develop a policy query analyze the scheme in the context of the rigorous models language for specifying ¯ne-grained access policies on XML of modern cryptography. We obtain formal results in sim- documents and a logical model based on the concept of \pro- ple, symbolic terms close to the vocabulary of Miklau and tection". They also show how to translate consistent poli- Suciu. We also obtain more detailed computational results cies into protections, and how to implement protections by that establish security against probabilistic polynomial-time XML encryption [10].
  • ITERATIVE ALGOR ITHMS for GLOBAL FLOW ANALYSIS By

    ITERATIVE ALGOR ITHMS for GLOBAL FLOW ANALYSIS By

    ITERATIVE ALGOR ITHMS FOR GLOBAL FLOW ANALYSIS bY Robert Endre Tarjan STAN-CS-76-547 MARCH 1976 COMPUTER SCIENCE DEPARTMENT School of Humanities and Sciences STANFORD UN IVERS ITY Iterative Algorithms for Global Flow Analysis * Robert Endre Tarjan f Computer Science Department Stanford University Stanford, California 94305 February 1976 Abstract. This paper studies iterative methods for the global flow analysis of computer programs. We define a hierarchy of global flow problem classes, each solvable by an appropriate generalization of the "node listing" method of Kennedy. We show that each of these generalized methods is optimum, among all iterative algorithms, for solving problems within its class. We give lower bounds on the time required by iterative algorithms for each of the problem classes. Keywords: computational complexity, flow graph reducibility, global flow analysis, graph theory, iterative algorithm, lower time bound, node listing. * f Research partially supported by National Science Foundation grant MM 75-22870. 1 t 1. Introduction. A problem extensively studied in recent years [2,3,5,7,8,9,12,13,14, 15,2'7,28,29,30] is that of globally analyzing cmputer programs; that is, collecting information which is distributed throughout a computer program, generally for the purpose of optimizing the program. Roughly speaking, * global flow analysis requires the determination, for each program block f , of a property known to hold on entry to the block, independent of the path taken to reach the block. * A widely used amroach to global flow analysis is to model the set of possible properties by a semi-lattice (we desire the 'lmaximumtl property for each block), to model the control structure of the program by a directed graph with one vertex for each program block, and to specify, for each branch from block to block, the function by which that branch transforms the set of properties.
  • Interview with James Mitchell

    Interview with James Mitchell

    Interview with James Mitchell Interviewed by: David C. Brock Recorded February 19, 2019 Santa Barbara, CA CHM Reference number: X8963.2019 © 2019 Computer History Museum Interview with James Mitchell Brock: Yeah. So, yeah, maybe we can talk about your transition from Carnegie Mellon to PARC and how that opportunity came about, and what your thinking was about joining the new lab. Mitchell: I basically finished my PhD and left in July of 1970. I had missed graduation that year, so my diploma says 1971. But, in fact, I'd been out working for a year by then, and at PARC, you know, there were a number of other grad students I knew, and two of them had gone to work for a start-up in Berkeley that-- there were two Berkeley computer science departments, and the engineering one left to form this company called Berkeley Computer Corporation with Mel Pirtle running it and Butler Lampson kind of a chief technical officer and Chuck Thacker and so on, and anyway the people that I-- the two other grad students that had gone already that I knew, when I was going out, I was starting to go around and interview in early 1970 because I knew I was close to being finished, and it was in those days because there were so few people who had PhDs in computer science and every university was trying to build a department, and industrial research places like Bell Labs were trying to hire people and so on, anywhere you went with a new PhD you got an offer.
  • The People Who Invented the Internet Source: Wikipedia's History of the Internet

    The People Who Invented the Internet Source: Wikipedia's History of the Internet

    The People Who Invented the Internet Source: Wikipedia's History of the Internet PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Sat, 22 Sep 2012 02:49:54 UTC Contents Articles History of the Internet 1 Barry Appelman 26 Paul Baran 28 Vint Cerf 33 Danny Cohen (engineer) 41 David D. Clark 44 Steve Crocker 45 Donald Davies 47 Douglas Engelbart 49 Charles M. Herzfeld 56 Internet Engineering Task Force 58 Bob Kahn 61 Peter T. Kirstein 65 Leonard Kleinrock 66 John Klensin 70 J. C. R. Licklider 71 Jon Postel 77 Louis Pouzin 80 Lawrence Roberts (scientist) 81 John Romkey 84 Ivan Sutherland 85 Robert Taylor (computer scientist) 89 Ray Tomlinson 92 Oleg Vishnepolsky 94 Phil Zimmermann 96 References Article Sources and Contributors 99 Image Sources, Licenses and Contributors 102 Article Licenses License 103 History of the Internet 1 History of the Internet The history of the Internet began with the development of electronic computers in the 1950s. This began with point-to-point communication between mainframe computers and terminals, expanded to point-to-point connections between computers and then early research into packet switching. Packet switched networks such as ARPANET, Mark I at NPL in the UK, CYCLADES, Merit Network, Tymnet, and Telenet, were developed in the late 1960s and early 1970s using a variety of protocols. The ARPANET in particular led to the development of protocols for internetworking, where multiple separate networks could be joined together into a network of networks. In 1982 the Internet Protocol Suite (TCP/IP) was standardized and the concept of a world-wide network of fully interconnected TCP/IP networks called the Internet was introduced.
  • Second International Computer Programming Education Conference

    Second International Computer Programming Education Conference

    Second International Computer Programming Education Conference ICPEC 2021, May 27–28, 2021, University of Minho, Braga, Portugal Edited by Pedro Rangel Henriques Filipe Portela Ricardo Queirós Alberto Simões OA S I c s – Vo l . 91 – ICPEC 2021 www.dagstuhl.de/oasics Editors Pedro Rangel Henriques Universidade do Minho, Portugal [email protected] Filipe Portela Universidade do Minho, Portugal [email protected] Ricardo Queirós Politécnico do Porto, Portugal [email protected] Alberto Simões Politécnico do Cávado e Ave, Portugal [email protected] ACM Classifcation 2012 Applied computing → Education ISBN 978-3-95977-194-8 Published online and open access by Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, Germany. Online available at https://www.dagstuhl.de/dagpub/978-3-95977-194-8. Publication date July, 2021 Bibliographic information published by the Deutsche Nationalbibliothek The Deutsche Nationalbibliothek lists this publication in the Deutsche Nationalbibliografe; detailed bibliographic data are available in the Internet at https://portal.dnb.de. License This work is licensed under a Creative Commons Attribution 4.0 International license (CC-BY 4.0): https://creativecommons.org/licenses/by/4.0/legalcode. In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the work under the following conditions, without impairing or restricting the authors’ moral rights: Attribution: The work must be attributed to its authors. The copyright is retained by the corresponding authors. Digital Object Identifer: 10.4230/OASIcs.ICPEC.2021.0 ISBN 978-3-95977-194-8 ISSN 1868-8969 https://www.dagstuhl.de/oasics 0:iii OASIcs – OpenAccess Series in Informatics OASIcs is a series of high-quality conference proceedings across all felds in informatics.
  • A Auxiliary Definitions

    A Auxiliary Definitions

    A Auxiliary Definitions This appendix contains auxiliary definitions omitted from the main text. Variables fun lvars :: com ⇒ vname set where lvars SKIP = {} lvars (x ::= e)={x} lvars (c1;; c2)=lvars c1 ∪ lvars c2 lvars (IF b THEN c1 ELSE c2)=lvars c1 ∪ lvars c2 lvars (WHILE b DO c)=lvars c fun rvars :: com ⇒ vname set where rvars SKIP = {} rvars (x ::= e)=vars e rvars (c1;; c2)=rvars c1 ∪ rvars c2 rvars (IF b THEN c1 ELSE c2)=vars b ∪ rvars c1 ∪ rvars c2 rvars (WHILE b DO c)=vars b ∪ rvars c definition vars :: com ⇒ vname set where vars c = lvars c ∪ rvars c Abstract Interpretation fun strip :: aacom⇒ com where strip (SKIP {P})=SKIP strip (x ::= e {P})=x ::= e © Springer International Publishing Switzerland 2014 281 T. Nipkow and G. Klein, Concrete Semantics, DOI 10.1007/978-3-319-10542-0 282 A Auxiliary Definitions strip (C 1;;C 2)=strip C 1;; strip C 2 strip (IF b THEN {P 1} C 1 ELSE {P 2} C 2 {P})= IF b THEN strip C 1 ELSE strip C 2 strip ({I } WHILE b DO {P} C {Q})=WHILE b DO strip C fun annos :: aacom⇒ a list where annos (SKIP {P})=[P] annos (x ::= e {P})=[P] annos (C 1;;C 2)=annos C 1 @ annos C 2 annos (IF b THEN {P 1} C 1 ELSE {P 2} C 2 {Q})= P 1 # annos C 1 @ P 2 # annos C 2 @ [Q] annos ({I } WHILE b DO {P} C {Q})=I # P # annos C @ [Q] fun asize :: com ⇒ nat where asize SKIP = 1 asize (x ::= e)=1 asize (C 1;;C 2)=asize C 1 + asize C 2 asize (IF b THEN C 1 ELSE C 2)=asize C 1 + asize C 2 + 3 asize (WHILE b DO C )=asize C + 3 definition shift :: (nat ⇒ a) ⇒ nat ⇒ nat ⇒ a where shift f n =(λp.
  • The Optical Mouse: Early Biomimetic Embedded Vision

    The Optical Mouse: Early Biomimetic Embedded Vision

    The Optical Mouse: Early Biomimetic Embedded Vision Richard F. Lyon Abstract The 1980 Xerox optical mouse invention, and subsequent product, was a successful deployment of embedded vision, as well as of the Mead–Conway VLSI design methodology that we developed at Xerox PARC in the late 1970s. The de- sign incorporated an interpretation of visual lateral inhibition, essentially mimicking biology to achieve a wide dynamic range, or light-level-independent operation. Con- ceived in the context of a research group developing VLSI design methodologies, the optical mouse chip represented an approach to self-timed semi-digital design, with the analog image-sensing nodes connecting directly to otherwise digital logic using a switch-network methodology. Using only a few hundred gates and pass tran- sistors in 5-micron nMOS technology, the optical mouse chip tracked the motion of light dots in its field of view, and reported motion with a pair of 2-bit Gray codes for x and y relative position—just like the mechanical mice of the time. Besides the chip, the only other electronic components in the mouse were the LED illuminators. Fig. 1 The Xerox optical mouse chip in its injection- molded dual-inline package (DIP) of clear plastic, with pins stuck into a conductive packaging foam. The bond wires connecting the chip’s pads to the lead frame are (barely) visible. Richard F. Lyon Google Inc., Mountain View CA, e-mail: [email protected] 1 2 Richard F. Lyon Fig. 2 The Winter 1982 Xe- rox World internal magazine cover featuring the Electron- ics Division and their 3-button mechanical and optical mouse developments, among other electronic developments.
  • Technology and Courage

    Technology and Courage

    Technology and Courage Ivan Sutherland Perspectives 96-1 In an Essay Series Published by SunLabs April 1996 _____________________________________________________________________________ © Copyright 1996 Sun Microsystems, Inc. Perspectives, a new and parallel series to the Sun Microsystems Laboratories Technical Report Series, is published by Sun Microsystems Laboratories, a division of Sun Microsystems, Inc. Printed in U.S.A. Unlimited copying without fee is permitted provided that the copies are not made nor distributed for direct commercial advantage, and credit to the source is given. Otherwise, no part of this work covered by copyright hereon may be reproduced in any form or by any means graphic, electronic, or mechanical, including photocopying, recording, taping, or storage in an information retrieval system, without the prior written permission of the copyright owner. TRADEMARKS Sun, Sun Microsystems, and the Sun logo are trademarks or registered trademarks of Sun Microsystems, Inc. UNIX is a registered trademark in the United States and other countries, exclusively licensed through X/Open Company, Ltd. All SPARC trademarks, including the SCD Compliant Logo, are trademarks or registered trademarks of SPARC International, Inc. SPARCstation, SPARCserver, SPARCengine, SPARCworks, and SPARCompiler are licensed exclusively to Sun Microsystems, Inc. All other product names mentioned herein are the trademarks of their respec- tive owners. For information regarding the SunLabs Perspectives Series, contact Jeanie Treichel, Editor-in-Chief <[email protected]>. For distribution issues, contact Amy Tashbook Hall, Assistant Editor <[email protected]>. _____________________________________________________________________________ Editor’s Notes About the series— The Perspectives series is a collection of essays written by individuals from Sun Microsystems Laboratories. These essays express ideas and opinions held by the authors on subjects of general rather than technical interest.
  • Statement on the Selection of Jeffrey Ullman for a Turing Award

    Statement on the Selection of Jeffrey Ullman for a Turing Award

    Statement on the Selection of Jeffrey Ullman for a Turing Award An Open Letter to Committee of the ACM A.M. Turing Award and ACM: Date: 04/16/2021 Professor Jeffrey D. Ullman of Stanford University has been chosen to receive the 2020 ACM A.M. Turing Award, generally regarded as the highest distinction in computing. While we agree that the technical and educational contributions of Professor Ullman could meet the bar for a “Nobel Prize of Computing”, we condemn the selection as one that directly goes against the Diversity and Inclusion (D & I) values that the Computer Science community, and the Association for Computing Machinery (ACM) in particular, aim to uphold. While we recognize Professor Ullman’s freedom of speech and freedom to hold and express his political views, we are concerned by his sustained discriminatory behavior against students and by ACM bestowing upon such a person an award named after Alan Turing, someone who suffered much discrimination in his tragic life [1]. ACM defines its mission as follows: “ACM is a global scientific and educational organization dedicated to advancing the art, science, engineering, and application of computing, serving both professional and public interests by fostering the open exchange of information and by promoting the highest professional and ethical standards.” Furthermore, ACM explicitly defines “Diversity and Inclusion” as one of its four core values [2]. We assert, based on documented evidence, that not only has Professor Ullman willfully violated the “highest professional and ethical standards” that ACM has the mission to uphold, but also that he has demonstrated a pattern of actively turning against the values of D & I for decades.
  • Conway-Suchman Conversation

    Conway-Suchman Conversation

    Conway Suchman Conversation Conway-Suchman conversation Lynn Conway, Lucy Suchman Published on: Mar 05, 2021 License: Creative Commons Attribution 4.0 International License (CC-BY 4.0) Conway Suchman Conversation Conway-Suchman conversation Preface by Lucy Suchman, 28 February 2021 In 1980, at Xerox’s Palo Alto Research Center (PARC), we entered into a rather extraordinary conversation. Computer architect and electrical engineer Lynn was then head of the LSI (Large-Scale Integration) Systems area at PARC, while I was a recently arrived Research Intern at PARC and PhD student in Anthropology at the University of California at Berkeley, in the very early stages of formulating plans for my doctoral thesis. Lynn was emerging from a period of intensive activity focused on the ‘multi-university, multi-project chip-design demonstration’ (MPC79), an initiative involving the creation of a new pedagogy and associated design and manufacturing process for the production of very large-scale integrated circuits (VLSI). At Lynn’s suggestion, we began an exchange born out of her desire to think anthropologically about what she had just experienced, and mine to deepen my understanding of her sociotechnical imaginary and practice. With Lynn’s endorsement, I recorded and transcribed our conversations, aided by an Alto computer and the text editor Bravo, both recently developed and in everyday use at PARC. The resulting text, which I printed out to share with Lynn and archived for herself in a 3-ring binder, was around 55 pages. We lost touch over the years following our respective departures from PARC until, in 2020, another PhD student, Philipp Sander, contacted Lynn to interview her.
  • Assembling a Prehistory for Formal Methods: a Personal View Thomas Haigh Thomas.Haigh@Gmail.Com

    Assembling a Prehistory for Formal Methods: a Personal View Thomas Haigh [email protected]

    Assembling A Prehistory for Formal Methods: A Personal View Thomas Haigh [email protected] University of Wisconsin—Milwaukee & Siegen University www.tomandmaria.com This is a preprint copy. Please quote and cite the final version, which will appear in a special issue of Formal Aspects of Computing devoted to historical work. Thanks to Cliff Jones and the anonymous reviewers for their encouragement and feedback on earlier drafts of this paper. Preprint Draft Haigh – Assembling a History for Formal Methods 2 Although I was pleased to be asked to contribute something to this volume I have a confession to make: I have never studied the history of formal methods. So this is not going to be a history of formal methods as much as a reflection on how such a story might be written. My plan is to triangulate from my personal experiences as a computer science student a quarter century ago, my Ph.D. training as a historian of science and technology, and my subsequent career researching and writing about various aspects of the history of computing. The fact that, despite a general familiarity with the literature on the history of computing, I don’t have a better grasp of the history of formal methods tells us a lot about the need for this special issue. Most of the history is so far locked up in the heads of participants, which is not a convenient place for the rest of us to find it. Stories written by participants or people with a personal connection to the events described are not usually the last word on historical events, but they are a vital starting point.