DOCSLIB.ORG

Turing Award Given to Founders of Model-Checking

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Turing Award Given to Founders of Model-Checking Mon Feb 4 07:27:17 2008 Pacific Time ADVISORY for Saturday, June 21 - Awards Banquet in San Francisco Association for Computing Machinery's Turing Award Honors Founders of Automatic Verification Technology That Enables Faster, More Reliable Designs; Researchers Created Model Checking Technique for Hardware and Software Designers NEW YORK, Feb. 4 (AScribe Newswire) -- ACM, the Association for Computing Machinery, has named Edmund M. Clarke, E. Allen Emerson, and Joseph Sifakis the winners of the 2007 A.M. Turing Award, widely considered the most prestigious award in computing, for their original and continuing research in a quality assurance process known as Model Checking. Their innovations transformed this approach from a theoretical technique to a highly effective verification technology that enables computer hardware and software engineers to find errors efficiently in complex system designs. This transformation has resulted in increased assurance that the systems perform as intended by the designers. The Turing Award, named for British mathematician Alan M. Turing, carries a $250,000 prize, with financial support provided by Intel Corporation and Google Inc. Clarke of Carnegie Mellon University, and Emerson of the University of Texas at Austin, working together, and Sifakis, working independently for the Centre National de la Recherche Scientifique at the University of Grenoble in France, developed this fully automated approach that is now the most widely used verification method in the hardware and software industries. ACM President Stuart Feldman said the work of Clarke, Emerson and Sifakis has had a major impact on designers and manufacturers of semiconductor chips. "These industries face a technology explosion in which products of unprecedented complexity have to operate as expected for companies to survive. This verification advance enabled these industries to shorten time to market and increase product integrity. Without the conceptual breakthrough pioneered by these researchers, we might still be stuck with chips that have many errors and would lack the power and speed of today's equipment. This is a great example of an industry-transforming technology arising from highly theoretical research," Feldman said. Model Checking as a standard procedure for quality assurance has enabled designers and manufacturers to address verification problems that span both hardware and software. It has also helped them to gain mathematical confidence that complex computer systems meet their specifications, and it has provided added security for a range of both common and critical computing applications. "Intel and the entire computing industry have been direct beneficiaries of the awardees' ground-breaking work," said Andrew Chien, Vice President in the Corporate Technology Group and Director of Research of Intel Corporation. "Our researchers and engineers have worked closely with Clarke, Emerson, and Sifakis for 15 years. Insights from their novel automatic verification results have been widely adopted by the entire industry. These Model Checking approaches provide dramatically better coverage when searching for design errors." "Google, like any contemporary technology company, owes a great deal of its success to the work of pioneering researchers who have come before," said Alan Eustace, Senior Vice President of Engineering at Google. "We are proud to honor the award winners for their innovative solution to a difficult and pervasive issue and we hope this will encourage and inspire those who now face the technology challenges of the future." Migrating From Pure Research to Industrial Reality 1 of 4 05-02-2008 15:18 Logical errors in digital circuit designs, software, and communication protocols are an important problem for system designers. They often result in delays in getting new products to market, failures of critical systems already in use, and expensive replacement of faulty hardware and patching of flawed software. Model Checking started as an academic research idea. The continuing research of Clarke, Emerson, and Sifakis as well as others in the international research community over the last 27 years led to the creation of new logics, as well as new algorithms and surprising theoretical results. This in turn has stimulated the creation of many Model Checking tools by both academic and industrial teams, resulting in the widespread industrial use of Model Checking. Many major hardware and software companies now rely heavily on Model Checking. Common examples include verification of the designs for integrated circuits such as microprocessors, as well as communication protocols, software device drivers, real-time embedded systems, and security algorithms. Among the beneficiaries of Model Checking are personal computer users, medical device makers, and nuclear power plant operators. As computerized systems pervade daily life, consumers rely on digital controllers to supervise critical functions of cars, airplanes, and industrial plants. Digital switching technology has replaced analog components in the telecommunications industry, and security protocols enable e-commerce applications and privacy. Wherever significant investments or human lives are at risk, quality assurance for the underlying hardware and software components becomes paramount. Background In 1981, Edmund Clarke and Allen Emerson working in the U.S., and Joseph Sifakis working independently in France with J.P. Queille, authored seminal papers that founded what has become the highly successful field of Model Checking. This verification technology offers two advantages. It provides an algorithmic means of determining whether an abstract model, such as a hardware or software design, satisfies a formal specification, such as a temporal logic formula (i.e. a pattern for a sequence of events). In addition, it identifies the counter-examples that show the source of the problem, which must be addressed should the stated property specification not hold. A drawback of the Model Checking approach, known as the state-explosion problem, seemed to limit its applicability to small designs of mainly academic interest. Randal Bryant, Edmund Clarke, Allen Emerson and Kenneth McMillan invented Symbolic Model Checking, which greatly extended the size and complexity of systems that could be verified. It also led to the widespread adoption of Model Checking by the computer hardware industry. For this invention, Bryant, Clarke, Emerson, and McMillan received the 1998 Paris Kanellakis Award for Theory and Practice from ACM. In 1999, they also received the Allen Newell Award for Research Excellence from Carnegie Mellon University. Sifakis, together with Thomas A. Henzinger and Sergio Yovine, extended the Model Checking approach to address verification of real time systems. In 2001, Sifakis received the Centre National de la Recherche Scientifique Silver Medal. Edmund M. Clarke Dr. Clarke is the FORE Systems Professor of Computer Science and Professor of Electrical and Computer Engineering at Carnegie Mellon University. He has served on the editorial boards of numerous journals and is the former editor-in-chief of Formal Methods in Systems Design. He is a co-founder with Robert Kurshan, Amir Pnueli, and Joseph Sifakis of the International Conference on Computer Aided Verification (CAV) and serves on the steering committee. He received a Technical Excellence Award from the Semiconductor Research Corporation in 1995, and the IEEE Harry M. Goode Memorial Award in 2004. He is a Fellow of ACM and the IEEE Computer Society, and was elected to the National Academy of Engineering in 2005. Dr. Clarke was awarded a B.A. degree in mathematics from the University of Virginia and a M.A. degree in mathematics from Duke University. He earned a Ph.D. degree in computer science from Cornell University, and has taught at Duke University and Harvard University. E. Allen Emerson Dr. Emerson is an Endowed Professor in Computer Sciences at the University of Texas at Austin. He was a co-recipient of the 2006 Test-of-Time Award from the IEEE Symposium on Logic in Computer 2 of 4 05-02-2008 15:18 Science (LICS) for his research on efficient Model Checking in the propositional mu-calculus, a highly expressive temporal logic, with Chin-Laung Lei. He has served on the editorial boards of several leading journals in applied logic and formal methods, including ACM Transactions for Computational Logic, Formal Aspects of Computing, and Formal Methods in Systems Design. He serves on the steering committee of the International Symposium on Automated Technology for Verification and Analysis (ATVA) as well as the International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI). Dr. Emerson received a B.S. degree in mathematics from University of Texas at Austin, and a Ph.D. in applied mathematics from Harvard University. Joseph Sifakis Dr. Sifakis is the founder of Verimag Laboratory, a leading research center for embedded systems in Grenoble, France, where he was director from 1993-2006. He is Research Director of Centre National de la Recherche Scientifique, and Director of the CARNOT Institute on Intelligent Software and Systems in Grenoble. Dr. Sifakis is a member of the editorial board of several journals, and the scientific coordinator of the Artist2 and ArtistDesign European Networks of Excellence on Embedded Systems Design. He is co-founder with Edmund Clarke, Robert Kurshan, and Amir Pnueli of the International Conference on Computer Aided Verification (CAV). He earned a degree
Load more

Recommended publications
  • Rivest, Shamir, and Adleman Receive 2002 Turing Award, Volume 50
    Rivest, Shamir, and Adleman Receive 2002 Turing Award Cryptography and Information Se- curity Group. He received a B.A. in mathematics from Yale University and a Ph.D. in computer science from Stanford University. Shamir is the Borman Profes- sor in the Applied Mathematics Department of the Weizmann In- stitute of Science in Israel. He re- Ronald L. Rivest Adi Shamir Leonard M. Adleman ceived a B.S. in mathematics from Tel Aviv University and a Ph.D. in The Association for Computing Machinery (ACM) has computer science from the Weizmann Institute. named RONALD L. RIVEST, ADI SHAMIR, and LEONARD M. Adleman is the Distinguished Henry Salvatori ADLEMAN as winners of the 2002 A. M. Turing Award, Professor of Computer Science and Professor of considered the “Nobel Prize of Computing”, for Molecular Biology at the University of Southern their contributions to public key cryptography. California. He earned a B.S. in mathematics at the The Turing Award carries a $100,000 prize, with University of California, Berkeley, and a Ph.D. in funding provided by Intel Corporation. computer science, also at Berkeley. As researchers at the Massachusetts Institute of The ACM presented the Turing Award on June 7, Technology in 1977, the team developed the RSA 2003, in conjunction with the Federated Computing code, which has become the foundation for an en- Research Conference in San Diego, California. The tire generation of technology security products. It award was named for Alan M. Turing, the British mathematician who articulated the mathematical has also inspired important work in both theoret- foundation and limits of computing and who was a ical computer science and mathematics.
    [Show full text]
  • Welcome to AI Matters 5(1)
    AI MATTERS, VOLUME 5, ISSUE 1 5(1) 2019 Welcome to AI Matters 5(1) Amy McGovern, co-editor (University of Oklahoma; [email protected]) Iolanda Leite, co-editor (Royal Institute of Technology (KTH); [email protected]) DOI: 10.1145/3320254.3320255 Issue overview receiving the 2018 ACM A.M. Turing Award! Welcome to the first issue of the fifth vol- ume of the AI Matters Newsletter! This issue opens with some news on a new SIGAI Stu- Submit to AI Matters! dent Travel Scholarship where we aim to en- Thanks for reading! Don’t forget to send courage students from traditionally underrep- your ideas and future submissions to AI resented geographic locations to apply and at- Matters! We’re accepting articles and an- tend SIGAI supported events. We also sum- nouncements now for the next issue. De- marize the fourth AAAI/ACM SIGAI Job Fair, tails on the submission process are avail- which continues to grow with the increasing able at http://sigai.acm.org/aimatters. popularity of AI. In our interview series, Marion Neumann interviews Tom Dietterich, an Emer- itus Professor at Oregon State University and one of the pioneers in Machine Learning. Amy McGovern is co- In our regular columns, we have a summary editor of AI Matters. She of recent and upcoming AI conferences and is a Professor of com- events from Michael Rovatsos. Our educa- puter science at the Uni- tional column this issue is dedicated to “biduc- versity of Oklahoma and tive computing”, one of Prolog’s most distinc- an adjunct Professor of tive features.
    [Show full text]
  • Turing's Influence on Programming — Book Extract from “The Dawn of Software Engineering: from Turing to Dijkstra”
    Turing's Influence on Programming | Book extract from \The Dawn of Software Engineering: from Turing to Dijkstra" Edgar G. Daylight∗ Eindhoven University of Technology, The Netherlands [email protected] Abstract Turing's involvement with computer building was popularized in the 1970s and later. Most notable are the books by Brian Randell (1973), Andrew Hodges (1983), and Martin Davis (2000). A central question is whether John von Neumann was influenced by Turing's 1936 paper when he helped build the EDVAC machine, even though he never cited Turing's work. This question remains unsettled up till this day. As remarked by Charles Petzold, one standard history barely mentions Turing, while the other, written by a logician, makes Turing a key player. Contrast these observations then with the fact that Turing's 1936 paper was cited and heavily discussed in 1959 among computer programmers. In 1966, the first Turing award was given to a programmer, not a computer builder, as were several subsequent Turing awards. An historical investigation of Turing's influence on computing, presented here, shows that Turing's 1936 notion of universality became increasingly relevant among programmers during the 1950s. The central thesis of this paper states that Turing's in- fluence was felt more in programming after his death than in computer building during the 1940s. 1 Introduction Many people today are led to believe that Turing is the father of the computer, the father of our digital society, as also the following praise for Martin Davis's bestseller The Universal Computer: The Road from Leibniz to Turing1 suggests: At last, a book about the origin of the computer that goes to the heart of the story: the human struggle for logic and truth.
    [Show full text]
  • Annual Report
    ANNUAL REPORT 2019FISCAL YEAR ACM, the Association for Computing Machinery, is an international scientific and educational organization dedicated to advancing the arts, sciences, and applications of information technology. Letter from the President It’s been quite an eventful year and challenges posed by evolving technology. for ACM. While this annual Education has always been at the foundation of exercise allows us a moment ACM, as reflected in two recent curriculum efforts. First, “ACM’s mission to celebrate some of the many the ACM Task Force on Data Science issued “Comput- hinges on successes and achievements ing Competencies for Undergraduate Data Science Cur- creating a the Association has realized ricula.” The guidelines lay out the computing-specific over the past year, it is also an competencies that should be included when other community that opportunity to focus on new academic departments offer programs in data science encompasses and innovative ways to ensure at the undergraduate level. Second, building on the all who work in ACM remains a vibrant global success of our recent guidelines for 4-year cybersecu- the computing resource for the computing community. rity curricula, the ACM Committee for Computing Edu- ACM’s mission hinges on creating a community cation in Community Colleges created a related cur- and technology that encompasses all who work in the computing and riculum targeted at two-year programs, “Cybersecurity arena” technology arena. This year, ACM established a new Di- Curricular Guidance for Associate-Degree Programs.” versity and Inclusion Council to identify ways to create The following pages offer a sampling of the many environments that are welcoming to new perspectives ACM events and accomplishments that occurred over and will attract an even broader membership from the past fiscal year, none of which would have been around the world.
    [Show full text]
  • Diffie and Hellman Receive 2015 Turing Award Rod Searcey/Stanford University
    Diffie and Hellman Receive 2015 Turing Award Rod Searcey/Stanford University. Linda A. Cicero/Stanford News Service. Whitfield Diffie Martin E. Hellman ernment–private sector relations, and attracts billions of Whitfield Diffie, former chief security officer of Sun Mi- dollars in research and development,” said ACM President crosystems, and Martin E. Hellman, professor emeritus Alexander L. Wolf. “In 1976, Diffie and Hellman imagined of electrical engineering at Stanford University, have been a future where people would regularly communicate awarded the 2015 A. M. Turing Award of the Association through electronic networks and be vulnerable to having for Computing Machinery for their critical contributions their communications stolen or altered. Now, after nearly to modern cryptography. forty years, we see that their forecasts were remarkably Citation prescient.” The ability for two parties to use encryption to commu- “Public-key cryptography is fundamental for our indus- nicate privately over an otherwise insecure channel is try,” said Andrei Broder, Google Distinguished Scientist. fundamental for billions of people around the world. On “The ability to protect private data rests on protocols for a daily basis, individuals establish secure online connec- confirming an owner’s identity and for ensuring the integ- tions with banks, e-commerce sites, email servers, and the rity and confidentiality of communications. These widely cloud. Diffie and Hellman’s groundbreaking 1976 paper, used protocols were made possible through the ideas and “New Directions in Cryptography,” introduced the ideas of methods pioneered by Diffie and Hellman.” public-key cryptography and digital signatures, which are Cryptography is a practice that facilitates communi- the foundation for most regularly used security protocols cation between two parties so that the communication on the Internet today.
    [Show full text]
  • 2021 ACM Awards Call for Nominations
    Turing Award The A. M. Turing Award is ACM's oldest and most prestigious award. It is presented annually to an individual or a group of individuals who have made lasting contributions of a technical nature to the computing community. The long-term influence of a candidate’s work is taken into consideration, but there should be a singular outstanding and trend-setting technical achievement that constitutes the claim of the award. The award is presented each June at the ACM Awards Banquet and is accompanied by a prize of $1,000,000 plus travel expenses to the banquet. Financial support for the award is provided by Google Inc. ACM Prize in Computing The ACM Prize in Computing recognizes an early to mid-career fundamental and innovative contribution in computing theory or practice that through, its impact, and broad implications, exemplifies the greatest achievements of the discipline. The candidate’s contribution should be relatively recent (typically within the last decade), but enough time should have passed to evaluate impact. While there are no specific requirements as to age or time since last degree requirements, the candidate typically would be approaching mid-career. The Prize carries a prize of $250,000. Financial support for the award is provided by Infosys Ltd. ACM Frances E. Allen Award for Outstanding Mentoring The Frances E. Allen Award for Outstanding Mentoring will be presented for the first time in 2021. This award will recognize individuals who have exemplified excellence and/or innovation in mentoring with particular attention to individuals who have shown outstanding leadership in promoting diversity, equity, and inclusion in computing.
    [Show full text]
  • Virginia Gold 212-626-0505 [email protected]
    Contact: Virginia Gold 212-626-0505 [email protected] ACM TURING AWARD GOES TO PIONEER WHO ADVANCED RELIABILITY AND CONSISTENCY OF COMPUTING SYSTEMS Microsoft’s Lamport Contributed to Theory and Practice of Building Distributed Computing Systems that Work as Intended NEW YORK, March 18, 2014 – ACM (Association for Computing Machinery) www.acm.org today named Leslie Lamport, a Principal Researcher at Microsoft Research, as the recipient of the 2013 ACM A.M. Turing Award for imposing clear, well-defined coherence on the seemingly chaotic behavior of distributed computing systems, in which several autonomous computers communicate with each other by passing messages. He devised important algorithms and developed formal modeling and verification protocols that improve the quality of real distributed systems. These contributions have resulted in improved correctness, performance, and reliability of computer systems. The ACM Turing Award, widely considered the “Nobel Prize in Computing,” carries a $250,000 prize, with financial support provided by Intel Corporation and Google Inc. ACM President Vint Cerf noted that “as an applied mathematician, Leslie Lamport had an extraordinary sense of how to apply mathematical tools to important practical problems. By finding useful ways to write specifications and prove correctness of realistic algorithms, assuring strong foundation for complex computing operations, he helped to move verification from an academic discipline to practical tool.” Lamport’s practical and widely used algorithms and tools have applications in security, cloud computing, embedded systems and database systems as well as mission-critical computer systems that rely on secure information sharing and interoperability to prevent failure. His notions of safety, where nothing bad happens, and liveness, where something good happens, contribute to the reliability and robustness of software and hardware engineering design.
    [Show full text]
  • Wirth All Poster V2
    COMPUTER DISTINGUISHED LECTURE SERIES SCIENCE by Prof. Niklaus Wirth, January 2015 DISTINGUISHED LECTURE 2015 LECTURE 1 “The Oberon System on a Field-Programmable 20 Gate Array (FPGA)” Tuesday RRS905, Sir Run Run Shaw Building, HSH Campus, HKBU 16:00-17:30 Distinguished Speaker LUNCHEON (Industry) 22 FSC 501, Fong Shu Chuen Library, HSH Campus, HKBU Thursday 12:00-14:00 Enquiry LECTURE 2 (PUBLIC) Tel: (852) 3411-2385 Email: [email protected] “Computers and Computing in 23 the Early Years” Website: http://www.comp.hkbu.edu.hk Friday RRS905, Sir Run Run Shaw Building, HSH Campus, HKBU 16:00-17:30 LECTURE 3 “The HDL Lola and its Translation to Verilog” 27 RRS905, Sir Run Run Shaw Building, HSH Campus, HKBU Tuesday 16:00-17:30 Biography The A.M. Turing Award, sometimes Niklaus Wirth was born in Winterthur, Switzerland, in 1934. He studied referred as the "Nobel Prize" of Computing, was electrical engineering at ETH (Federal Institute of Technology) in Zürich, graduated in named in honor of Alan Mathison Turing 1959, received an M.Sc. degree from Laval University in Quebec, and a Ph.D. from the (1912–1954) who made fundamental advances in computer architecture, algorithms, formalization of University of California at Berkeley in 1963. computing, and articial intelligence. It is the Wirth has been an Assistant Professor of Computer Science at Stanford annual prestigious technical award, given by the University (1963-67) and, after his return to Switzerland, a Professor of Informatics at Association for Computing Machinery, for major ETH from 1968 – 1999. His principal areas of contribution were programming contributions of lasting importance to computing.
    [Show full text]
  • A Debate on Teaching Computing Science
    Teaching Computing Science t the ACM Computer Science Conference last Strategic Defense Initiative. William Scherlis is February, Edsger Dijkstra gave an invited talk known for his articulate advocacy of formal methods called “On the Cruelty of Really Teaching in computer science. M. H. van Emden is known for Computing Science.” He challenged some of his contributions in programming languages and the basic assumptions on which our curricula philosophical insights into science. Jacques Cohen Aare based and provoked a lot of discussion. The edi- is known for his work with programming languages tors of Comwunications received several recommenda- and logic programming and is a member of the Edi- tions to publish his talk in these pages. His comments torial Panel of this magazine. Richard Hamming brought into the foreground some of the background received the Turing Award in 1968 and is well known of controversy that surrounds the issue of what be- for his work in communications and coding theory. longs in the core of a computer science curriculum. Richard M. Karp received the Turing Award in 1985 To give full airing to the controversy, we invited and is known for his contributions in the design of Dijkstra to engage in a debate with selected col- algorithms. Terry Winograd is well known for his leagues, each of whom would contribute a short early work in artificial intelligence and recent work critique of his position, with Dijkstra himself making in the principles of design. a closing statement. He graciously accepted this offer. I am grateful to these people for participating in We invited people from a variety of specialties, this debate and to Professor Dijkstra for creating the backgrounds, and interpretations to provide their opening.
    [Show full text]
  • Alan Mathison Turing and the Turing Award Winners
    Alan Turing and the Turing Award Winners A Short Journey Through the History of Computer TítuloScience do capítulo Luis Lamb, 22 June 2012 Slides by Luis C. Lamb Alan Mathison Turing A.M. Turing, 1951 Turing by Stephen Kettle, 2007 by Slides by Luis C. Lamb Assumptions • I assume knowlege of Computing as a Science. • I shall not talk about computing before Turing: Leibniz, Babbage, Boole, Gödel... • I shall not detail theorems or algorithms. • I shall apologize for omissions at the end of this presentation. • Comprehensive information about Turing can be found at http://www.mathcomp.leeds.ac.uk/turing2012/ • The full version of this talk is available upon request. Slides by Luis C. Lamb Alan Mathison Turing § Born 23 June 1912: 2 Warrington Crescent, Maida Vale, London W9 Google maps Slides by Luis C. Lamb Alan Mathison Turing: short biography • 1922: Attends Hazlehurst Preparatory School • ’26: Sherborne School Dorset • ’31: King’s College Cambridge, Maths (graduates in ‘34). • ’35: Elected to Fellowship of King’s College Cambridge • ’36: Publishes “On Computable Numbers, with an Application to the Entscheindungsproblem”, Journal of the London Math. Soc. • ’38: PhD Princeton (viva on 21 June) : “Systems of Logic Based on Ordinals”, supervised by Alonzo Church. • Letter to Philipp Hall: “I hope Hitler will not have invaded England before I come back.” • ’39 Joins Bletchley Park: designs the “Bombe”. • ’40: First Bombes are fully operational • ’41: Breaks the German Naval Enigma. • ’42-44: Several contibutions to war effort on codebreaking; secure speech devices; computing. • ’45: Automatic Computing Engine (ACE) Computer. Slides by Luis C.
    [Show full text]
  • An Interview with Tony Hoare ACM 1980 A.M. Turing Award Recipient
    1 An Interview with 2 Tony Hoare 3 ACM 1980 A.M. Turing Award Recipient 4 (Interviewer: Cliff Jones, Newcastle University) 5 At Tony’s home in Cambridge 6 November 24, 2015 7 8 9 10 CJ = Cliff Jones (Interviewer) 11 12 TH = Tony Hoare, 1980 A.M. Turing Award Recipient 13 14 CJ: This is a video interview of Tony Hoare for the ACM Turing Award Winners project. 15 Tony received the award in 1980. My name is Cliff Jones and my aim is to suggest 16 an order that might help the audience understand Tony’s long, varied, and influential 17 career. The date today is November 24th, 2015, and we’re sitting in Tony and Jill’s 18 house in Cambridge, UK. 19 20 Tony, I wonder if we could just start by clarifying your name. Initials ‘C. A. R.’, but 21 always ‘Tony’. 22 23 TH: My original name with which I was baptised was Charles Antony Richard Hoare. 24 And originally my parents called me ‘Charles Antony’, but they abbreviated that 25 quite quickly to ‘Antony’. My family always called me ‘Antony’, but when I went to 26 school, I think I moved informally to ‘Tony’. And I didn’t move officially to ‘Tony’ 27 until I retired and I thought ‘Sir Tony’ would sound better than ‘Sir Antony’. 28 29 CJ: Right. If you agree, I’d like to structure the discussion around the year 1980 when 30 you got the Turing Award. I think it would be useful for the audience to understand 31 just how much you’ve done since that award.
    [Show full text]
  • ACM Annual Report FY 2017
    ANNUAL REPORT 2017FISCAL YEAR ACM, the Association for Computing Machinery, is an international scientific and educational organization dedicated to advancing the arts, sciences, and applications of information technology. ACM COUNCIL President Vicki L. Hanson Vice President Cherri M. Pancake Secretary/Treasurer Elizabeth Churchill Past President Alexander L. Wolf SIG Governing Board Chair Jeanna Matthews Publications Board Co-Chairs Jack Davidson, Joseph A. Konstan Members-at-Large Gabriele Anderst-Kotis, Vinton G. Cerf, Susan Dumais, Elizabeth D. Mynatt, Pamela Samuelson, Eugene H. Spafford, Per Stenström SGB Council Representatives Paul Beame, Barbara Boucher Owens, Loren Terveen COUNCIL CHAIRS ACM Europe Dame Professor Wendy Hall ACM India Madhavan Mukund ACM China Yunhao Liu ACM-W Valerie Barr USACM Stuart Shapiro Education Board Mehran Sahami and Jane Chu Prey Practitioners Board Terry J. Coatta and Stephen Ibaraki ACM HEADQUARTERS Chief Executive Officer Bobby Schnabel Chief Operating Officer Patricia M. Ryan 2 Penn Plaza, Suite 701 New York, NY 10121-0701, USA Phone: +1-212-869-7440 2 ACM’S ANNUAL REPORT FOR FISCAL YEAR 2017 FY17 was a year in which ACM had many reasons to celebrate its past, present, and our hopes for the future. We stepped into this fiscal year gazing forward with the introduction of the ACM Future of Computing (ACM-FCA). This initiative—paramount to the organization’s future—provides a platform for the next generation of talented computing professionals to address what they see as the most pressing challenges facing the industry. I am pleased to report the response to the ACM-FCA was instant; in a matter of weeks we had an inaugural class of 46 selected from over 300 applicants from around the world.
    [Show full text]