COMPUTING SCIENCE Turing and Software Verification
نویسنده
چکیده
Modern society relies heavily on computer programs or 'software'. Nearly everyone is aware that software sometimes malfunctions – it has 'bugs'. In a little known paper from 1949, Alan Turing described a technique for Checking a Large Routine; this paper might have accelerated the development of the subject of reasoning about software by decades, but sadly this gem from Turing had little impact. The current paper sets out the challenge to which Turing was responding, compares his proposals to those that came in the late 1960s, reflects on the missing impact and offers a summary of the state of the art. © 2014 Newcastle University. Printed and published by Newcastle University, Computing Science, Claremont Tower, Claremont Road, Newcastle upon Tyne, NE1 7RU, England. Bibliographical details
منابع مشابه
Platform Dependent Verification: On Engineering Verification Tools for 21st Century
With the increase in complexity and degree of parallelism of computer systems, it became even more important to develop formal methods for ensuring their quality. Correctness and reliability became a must have flavor for business success, and therefore, various techniques for automated and semi-automated formal verification and analysis have been designed and successfully applied. Formal verifi...
متن کامل2 A Dialogue with Professor Joseph Sifakis about Concurrent Systems
Professor Joseph Sifakis, http://www-verimag.imag.fr/~sifakis, is a leading researcher well-known for his pioneering work in theoretical and practical aspects of concurrent systems specification and verification, notably the area of model-checking. His current research activities include component-based design, modelling, and analysis of real-time systems with focus on correct-byconstruction te...
متن کاملMachine Code and Metaphysics: A Perspective on Software Engineering
A major, but too-little-considered problem for Software Engineering (SE) is a lack of consensus concerning Computer Science (CS) and how this relates to developing unpredictable computing technology. We consider some implications for SE of computer systems differing scientific basis, exemplified with the International Standard Organisations Open Systems Interconnection (ISO-OSI) layered archite...
متن کاملCoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates
Termination is an important property of programs; notably required for programs formulated in proof assistants. It is a very active subject of research in the Turing-complete formalism of term rewriting. Over the years many methods and tools have been developed to address the problem of deciding termination for specific problems (since it is undecidable in general). Ensuring reliability of thos...
متن کاملHierarchies for solving Non-linear SMT problems
The desire to make an industrial process cheaper often assumes a high level of automatization of production facilities. Software, although being a set of instructions executed on a machine, is purely created by the human labour. This brings up a natural question. Why would not machines be able to synthesize software and to verify its correctness? Alan Turing proved in 1936 that checking whether...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014