C. Strachey, An impossible program, Computer Journal, Vol. 7, No. 4, January 1965, p. 313. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Software Analysis and Model Checking - Holzmann (Correct)
....to software verification, there are some flies in the ointment again that often prevent us from claiming more than best effort results. For fundamental reasons, model checking techniques cannot be applied blindly to arbitrary program code written in the currently popular programming languages (cf. [S65]) To apply a model checking algorithm we need to create an abstract, finitary, representation of the source code: a verification model. The verification model is traditionally constructed by hand, and is therefore subject to human error. Human error can introduce both defects that the real system ....
C. Strachey, An impossible program, Computer Journal, Vol. 7, No. 4, January 1965, p. 313.
Automating Software Feature Verification - Holzmann, Smith (2000) (9 citations) (Correct)
....2. Mechanized model extraction It is known that it is not possible to devise an algorithm that could prove arbitrary properties of arbitrary C or C programs. It is not even possible to mechanically prove a single specific, property such as program termination for arbitrary programs [T36][S65]. So if we want to be able to render proofs, we have no choice but to restrict ourselves to a smaller class of programs. An example of such a class is the set of all finite state programs: programs that on any given input can generate only a finite number of possible program states (i.e. memory ....
Strachey, C., An impossible program. Computer Journal, Vol. 7, No. 4, p. 313, January 1965.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC