Browse by author
Lookup NU author(s): Emeritus Professor Cliff JonesORCiD
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
© Springer International Publishing AG 2017. Anyone who has written one knows how frustratingly difficult it can be to perfect a computer program. Some of the founding fathers of computing set out ideas for reasoning about software — one would say today ‘techniques for proving that a program satisfies its specification’. Alan Turing presented a paper entitled Checking a Large Routine that laid out a workable method for reasoning about programs. Sadly his paper had little impact. Understanding the problem faced, Turing’s proposal and what followed provides insight into how ideas evolve. Comparing three contributions from the 1940s with the current state of the art clarifies a problem that still costs society a fortune each year.
Author(s): Jones CB
Editor(s): Jarkko Kari, Florin Manea, Ion Petre
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 13th Conference on Computability in Europe (CiE 2017)
Year of Conference: 2017
Pages: 32-41
Online publication date: 12/05/2017
Acceptance date: 02/04/2016
Date deposited: 22/11/2017
ISSN: 0302-9743
Publisher: Springer Verlag
URL: https://doi.org/10.1007/978-3-319-58741-7_4
DOI: 10.1007/978-3-319-58741-7_4
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science
ISBN: 9783319587400
