-
1
-
-
85053040052
-
-
Stanford University, October
-
Dershowitz, N., and Z. Manna, Inference Rules for Program Annotation, A. I. Memo AIM 303, Stanford University, October 1977.
-
(1977)
Inference Rules for Program Annotation, A. I. Memo AIM 303
-
-
Dershowitz, N.1
Manna, Z.2
-
2
-
-
0037580800
-
-
Stanford Research Institute, Stanford, Calif., SRI Project 2686, July
-
Elspas, B., The Semiautomatic Generation of Inductive Assertions for Proving Program Correctness, Stanford Research Institute, Stanford, Calif., SRI Project 2686, July 1974.
-
(1974)
The Semiautomatic Generation of Inductive Assertions for Proving Program Correctness
-
-
Elspas, B.1
-
4
-
-
0016486505
-
A synthesizer of inductive assertions
-
March
-
German, S. M. and B. Wegbreit, A Synthesizer of Inductive Assertions, IEEE Trans. on Software Engineering, SE-1, 1(March 1975), pp. 68-75.
-
(1975)
IEEE Trans. on Software Engineering
, vol.SE-1
, Issue.1
, pp. 68-75
-
-
German, S.M.1
Wegbreit, B.2
-
5
-
-
0014973676
-
Proof of a program: FIND
-
Jan.
-
Hoare, C. A. R., Proof of a Program: FIND, Comm. ACM 14, 1(Jan. 1971), pp. 39-45.
-
(1971)
Comm. ACM
, vol.14
, Issue.1
, pp. 39-45
-
-
Hoare, C.A.R.1
-
6
-
-
0000972249
-
An axiomatic definition of the programming language pascal
-
Hoare, C. A. R. and N. Wirth, An Axiomatic Definition of the Programming Language Pascal, Acta Informatica, Vol. 2, 1973, pp. 335-355.
-
(1973)
Acta Informatica
, vol.2
, pp. 335-355
-
-
Hoare, C.A.R.1
Wirth, N.2
-
7
-
-
85053068640
-
-
Stanford A. I. Memo, forthcoming
-
Huet, G., D. Luckham, and D. Oppen, Extended Pascal Semantics for Proving the Absence of Common Runtime Errors, Stanford A. I. Memo, forthcoming.
-
Extended Pascal Semantics for Proving the Absence of Common Runtime Errors
-
-
Huet, G.1
Luckham, D.2
Oppen, D.3
-
8
-
-
0003577991
-
-
second edition, Springer-Verlag, New York
-
Jensen, K. and N. Wirth, Pascal User Manual and Report, second edition, Springer-Verlag, New York, 1975.
-
(1975)
Pascal User Manual and Report
-
-
Jensen, K.1
Wirth, N.2
-
9
-
-
0016941016
-
Logical analysis of programs
-
April
-
Katz, S. M. and Z. Manna, Logical Analysis of Programs, Comm. ACM 19, 4(April 1976), pp. 188-206.
-
(1976)
Comm. ACM
, vol.19
, Issue.4
, pp. 188-206
-
-
Katz, S.M.1
Manna, Z.2
-
10
-
-
0003657590
-
-
Addison Wesley, Reading Mass.
-
Knuth, D. C., The Art of Computer Programming, Vol. I - Fundamental Algorithms, Addison Wesley, Reading Mass., 1968, pp. 417.
-
(1968)
The Art of Computer Programming, Vol. I - Fundamental Algorithms
, pp. 417
-
-
Knuth, D.C.1
-
11
-
-
84976765076
-
-
Stanford A. I. Memo AIM-278, March
-
Luckham, D. and N. Suzuki, Automatic Program Verification V: Verification Oriented Proof Rules for Arrays, Records, and Pointers, Stanford A. I. Memo AIM-278, March 1976.
-
(1976)
Automatic Program Verification V: Verification Oriented Proof Rules for Arrays, Records, and Pointers
-
-
Luckham, D.1
Suzuki, N.2
-
12
-
-
85053046482
-
A simplifier based on efficient decision algorithms
-
Nelson, C. G., and D. Oppen, A Simplifier Based on Efficient Decision Algorithms, these proceedings.
-
These Proceedings
-
-
Nelson, C.G.1
Oppen, D.2
-
16
-
-
84976775198
-
The synthesis of loop predicates
-
Feb.
-
Wegbreit, B., The Synthesis of Loop Predicates, Comm. ACM 17, 2(Feb. 1974), pp. 102-112.
-
(1974)
Comm. ACM
, vol.17
, Issue.2
, pp. 102-112
-
-
Wegbreit, B.1
-
17
-
-
84976773567
-
Program development by stepwise refinement
-
April
-
Wirth, N., Program Development by Stepwise Refinement, Comm. ACM 14, 4(April 1971), pp. 221-227.
-
(1971)
Comm. ACM
, vol.14
, Issue.4
, pp. 221-227
-
-
Wirth, N.1
|