On the Search for Tractable Ways of Reasoning about Programs (2001)
| Citations: | 9 - 1 self |
BibTeX
@TECHREPORT{Jones01onthe,
author = {C. B. Jones},
title = {On the Search for Tractable Ways of Reasoning about Programs},
institution = {},
year = {2001}
}
OpenURL
Abstract
This paper traces the important steps in the history --up to around 1990-- of research on reasoning about programs. The main focus is on sequential imperative programs but some comments are made on concurrency. Initially, researchers focussed on ways of verifying that a program satifies its specification (or that two programs were equivalent). Over time it has become clear that post facto verification is only practical for small programs and attention turned to verification methods which support the development of programs; for larger programs it is necesary to exploit a notion of composability.







