Abstract
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.
Cite
CITATION STYLE
Jones, C. B. (2017). Turing’s 1949 paper in context. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10307 LNCS, pp. 32–41). Springer Verlag. https://doi.org/10.1007/978-3-319-58741-7_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
