ACM-TURING '12Pub Date : 2012-06-15DOI: 10.1145/2322176.2322186
E. Clarke
{"title":"Computable Real Numbers and Why They Are Still Important Today","authors":"E. Clarke","doi":"10.1145/2322176.2322186","DOIUrl":"https://doi.org/10.1145/2322176.2322186","url":null,"abstract":"Although every undergraduate in computer science learns about Turing Machines, it is not well known that they were originally proposed as a means of characterizing computable real numbers. For a long time, formal verifi cation paid little attention to computational applications that involve the manipulation of continuous quantities, even though such applications are ubiquitous. In recent years, however, there has been great interest in safety-critical hybrid systems involving both discrete and continuous behaviors, including autonomous automotive and aerospace applications, medical devices of various sorts, control programs for electric power plants, and so on. As a result, the formal analysis of numerical computation can no longer be ignored.\u0000 This talk focuses on one of the most successful verifi cation techniques, temporal logic model checking. Current industrial model checkers do not scale to handle realistic hybrid systems. The key to handling more complex systems is to make better use of the theory of the computable reals, and computable analysis more generally. new formal methods for hybrid systems should combine existing discrete methods in model checking with new algorithms based on computable analysis. In particular, this talk discusses a model checker currently being developed along these lines.","PeriodicalId":256350,"journal":{"name":"ACM-TURING '12","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129745265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-TURING '12Pub Date : 2012-06-15DOI: 10.1145/2322176.2322178
V. Cerf
{"title":"Welcome to the ACM Turing Centenary Program","authors":"V. Cerf","doi":"10.1145/2322176.2322178","DOIUrl":"https://doi.org/10.1145/2322176.2322178","url":null,"abstract":"Alan Turing’s wide-ranging interests ranged from the purely theoretical to the eminently practical. He contributed to our fundamental understanding of what can be computed through the invention of what we now refer to as the Universal Turing Machine. On the practical side, his work on the design of the ACE (Automatic Computing Engine) drew upon his wartime experience at Bletchley Park and blazed trails toward the breakthrough technology of stored-program computing.","PeriodicalId":256350,"journal":{"name":"ACM-TURING '12","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133678773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-TURING '12Pub Date : 2012-06-15DOI: 10.1145/2322176.2322185
D. Scott
{"title":"Lambda Calculus Then and Now","authors":"D. Scott","doi":"10.1145/2322176.2322185","DOIUrl":"https://doi.org/10.1145/2322176.2322185","url":null,"abstract":"A very fast development in the early 1930s, following Hilbert's codification of Mathematical Logic, led to the Incompleteness Theorems, Computable Functions, Undecidability Theorems, and the general formulation of recursive Function Theory. The so-called Lambda Calculus played a key role. The history of these developments will be traced, and the much later place of Lambda Calculus in Mathematics and Programming-Language Theory will be outlined.","PeriodicalId":256350,"journal":{"name":"ACM-TURING '12","volume":"223 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132684730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-TURING '12Pub Date : 2012-06-15DOI: 10.1145/2322176.2322190
V. Cerf, J. Hopcroft, R. Kahn, R. Rivest, A. Shamir
{"title":"Information, Data, Security in a Networked Future","authors":"V. Cerf, J. Hopcroft, R. Kahn, R. Rivest, A. Shamir","doi":"10.1145/2322176.2322190","DOIUrl":"https://doi.org/10.1145/2322176.2322190","url":null,"abstract":"The digital information revolution begins as giants such as Alan Turing, Claude Shannon and John von neumann, among many others, recognize the power of digital representations and programmable computers. Although rooted in the technology of his time, Vannevar Bush's portrait of the information revolution has emerged and fl ourished especially in the form of the World Wide Web resting atop the global Internet.\u0000 The panelists will explore some specifi cs of the digital information revolution, notably theory and practice in securing, authenticating and maintaining the integrity of information (Cerf); and roots of modern cryptography and current topics in this area (rivest and Shamir). They will also gain insight into the long-term problem of identifying, fi nding, and assuring the integrity of digital objects in the most general sense of that term (Kahn). Finally, they look at how our understanding of computer science is changing (Hopcroft) and how that evolution will affect the digital world in which are we spending an increasing fraction of our daily lives.","PeriodicalId":256350,"journal":{"name":"ACM-TURING '12","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131123891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-TURING '12Pub Date : 2012-06-15DOI: 10.1145/2322176.2322181
B. Lampson
{"title":"What Computers Do: Model, Connect and Engage","authors":"B. Lampson","doi":"10.1145/2322176.2322181","DOIUrl":"https://doi.org/10.1145/2322176.2322181","url":null,"abstract":"Every 30 years there is a new wave of things that computers do. Around 1950 they began to model events in the world (simulation), and around 1980 to connect people (communication). Since 2010 they have begun to engage with the physical world in a non-trivial way (embodiment—giving them bodies). Today there are sensor networks like the Inrix traffic information system, robots like the Roomba vacuum cleaner, and cameras that can pick out faces and even smiles. But these are just the beginning. In a few years we will have cars that drive themselves, glasses that overlay the person you are looking at with their name and contact information, telepresence systems that make most business travel unnecessary, and other applications as yet unimagined.\u0000 All computer systems are built on the physical foundation of hardware (steadily improving, according to Moore's law) and the intellectual foundations of algorithms, abstraction and probability. Their performance is determined by basic issues of latency, bandwidth, availability and complexity. In the future they will deal with uncertainty much better than today, and many of them will be safety-critical and hence much more dependable.","PeriodicalId":256350,"journal":{"name":"ACM-TURING '12","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129311311","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-TURING '12Pub Date : 2012-06-15DOI: 10.1145/2322176.2322179
C. J. V. Rijsbergen, C. Bachman, Kelly Gotlieb, Wendy Hall, W. Newman
{"title":"Turing the Man","authors":"C. J. V. Rijsbergen, C. Bachman, Kelly Gotlieb, Wendy Hall, W. Newman","doi":"10.1145/2322176.2322179","DOIUrl":"https://doi.org/10.1145/2322176.2322179","url":null,"abstract":"The panelists will discuss Alan Turing and Sara Turing, his mother, based on the personal experiences of the panelists. William newman will recount amusing incidents during the time Turing was a regular visitor at the newman home. Kelly gotlieb will describe his meetings with Turing at Manchester University during the early 1950s. Charlie Bachman and his wife met with Sara Turing in the mid-1970s, and Charlie will give an account of that meeting. Finally, Wendy Hall will describe the Turing Archive project in the UK and the Turing exhibition in the London Science Museum.","PeriodicalId":256350,"journal":{"name":"ACM-TURING '12","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117266666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-TURING '12Pub Date : 2012-06-15DOI: 10.1145/2322176.2322182
D. Malkhi, F. J. Corbató, E. Emerson, J. Sifakis, Ken Thompson
{"title":"Systems Architecture, Design, Engineering, and Verification — The Practice in Research and Research in Practice","authors":"D. Malkhi, F. J. Corbató, E. Emerson, J. Sifakis, Ken Thompson","doi":"10.1145/2322176.2322182","DOIUrl":"https://doi.org/10.1145/2322176.2322182","url":null,"abstract":"More than any other area in computer science, the interaction and boundary between science and engineering is blurred in the systems area, with cross fertilization from both directions. The systems panel will explore the past, present and future relationship between systems research and engineering practice.\u0000 They will discuss the relationship between systems research and engineering practices: when does systems innovation emanating from industry become an invention and when does academic research stop being science and become engineering? How does practice-driven research impact the real world and how does the real world reflect back on foundations? In what forms does technology create research challenges, and in what manner does applied research give solid base for development?\u0000 They will surmise about the future of systems research: What are the fundamental challenges posed by the scale of today's cloud computing systems and mega-size data centers? How to organize software of large-scale distributed executions or mega-ton lines of code? What new opportunities are enabled by novel technologies like flash memory and transactional memory? How to integrate hand-in-hand design of software and architecture?","PeriodicalId":256350,"journal":{"name":"ACM-TURING '12","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131926365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-TURING '12Pub Date : 2012-06-15DOI: 10.1145/2322176.2322184
J. Hartmanis, S. Cook, W. Kahan, R. Stearns, A. Yao
{"title":"The Turing Computational Model","authors":"J. Hartmanis, S. Cook, W. Kahan, R. Stearns, A. Yao","doi":"10.1145/2322176.2322184","DOIUrl":"https://doi.org/10.1145/2322176.2322184","url":null,"abstract":"The panel presentations will discuss the beauty and simplicity of the Turing machine formulation of the previously elusive concept of computability and the intuitively satisfying explanation of the power and limitations of computability. They will also review how the Turing machine model provided simple proofs of deep results in logic, including Gödel’s incompleteness theorem. The panel will also examine specifi c results in computer science infl uenced by the Turing machine model as well as how it shaped the development of computational complexity theory. Quantum computing will be discussed and its relationship to the classic Turing machine model. The panel will also discuss what Alan Turing might say about the Inevitable Fallibility of Software.","PeriodicalId":256350,"journal":{"name":"ACM-TURING '12","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122229292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-TURING '12Pub Date : 2012-06-15DOI: 10.1145/2322176.2322188
S. Graham, F. Allen, B. Liskov, N. Wirth
{"title":"Programming Languages — Past Achievements and Future Challenges","authors":"S. Graham, F. Allen, B. Liskov, N. Wirth","doi":"10.1145/2322176.2322188","DOIUrl":"https://doi.org/10.1145/2322176.2322188","url":null,"abstract":"The design of programming languages and their compile-time and run-time implementation are closely related, and are dependent on the underlying computational model. In the 1960s, 70s, and 80s many languages were designed, and many implementation strategies and computational models were explored. Since then, the commercial world has largely settled on a few legacy languages. Meanwhile, both the capabilities of computing systems and the ways in which they are used have changed dramatically. The panelists will summarize the lessons they have learned about language design, and also what has not been learned. They will consider how those lessons can be applied to the myriad application domains, architectural frameworks, user needs, and economic considerations that exist today, and will speculate about the future.","PeriodicalId":256350,"journal":{"name":"ACM-TURING '12","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131611362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM-TURING '12Pub Date : 2012-06-15DOI: 10.1145/2322176.2322189
C. Papadimitriou, L. Adleman, R. Karp, D. Knuth, R. Tarjan, L. Valiant
{"title":"An Algorithmic View of the Universe","authors":"C. Papadimitriou, L. Adleman, R. Karp, D. Knuth, R. Tarjan, L. Valiant","doi":"10.1145/2322176.2322189","DOIUrl":"https://doi.org/10.1145/2322176.2322189","url":null,"abstract":"In the years since Alan Turing, and following his lead, computer scientists advanced their understanding of computational phenomena by developing a very specialized, original and penetrating way of rigorous thinking. Now it turns out that this \"algorithmic\" way of thinking can be applied productively to the study of important phenomena outside computation proper (examples: the cell, the brain, the market, the universe, indeed mathematical truth itself). This development is an exquisite unintended consequence of the fact that there is latent computation underlying each of these phenomena, or the ways in which science studies them.","PeriodicalId":256350,"journal":{"name":"ACM-TURING '12","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130258437","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
