-
1
-
-
84932362103
-
-
Cherniavsky, J., Kamin, S.: A complete and consistent Hoare axiomatics for a simple programming language. Proceedings of the 4th POPL, 1977.
-
-
-
-
2
-
-
84932344269
-
-
Clarke, E. M.: Programming language constructs for which it is impossible to obtain good Hoare-like axiom systems. Proceedings of the 4th POPL, 1977.
-
-
-
-
3
-
-
84932395895
-
-
Cook, S. A.: Axiomatic and interpretative semantics for an algol fragment. Technical Report 79, Department of Computer Science, University of Toronto, 1975 (to be published in SCICOMP).
-
-
-
-
4
-
-
84932303466
-
-
Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of Programs by construction or approximation of Fixpoints. Proceedings of the 4th POPL, 1977.
-
-
-
-
5
-
-
84932355122
-
-
deBakker, J. W., Meertens, L. G. L. Th.: On the completeness of the induction assertion method. Mathematical Centre, December 1973.
-
-
-
-
6
-
-
84932338961
-
-
de Bakker, J. W.: Fixed point semantics and Dijkstra's fundamental invariance theorem. Mathematical Centre, January 1975.
-
-
-
-
7
-
-
84932367273
-
-
deBakker, J. W.: Flow of control in the proof theory of structured programming. Mathematical Centre, 1975.
-
-
-
-
8
-
-
84932395615
-
-
Dijkstra, E. E.: A simple axiomatic basis for programming language constructs. Lecture notes from the International Summer School on Structured Programming and Programmed Structures, Munich, Germany, 1973.
-
-
-
-
9
-
-
84932393271
-
-
Donahue, J.: Mathematical semantics as a complementary definition for axiomatically defined programming language constructs. Technical Report CSRG-45, Computer Systems Research Group, University of Toronto, December 1974.
-
-
-
-
10
-
-
84932337700
-
-
Floyd, R. W.: Assigning meaning to programs. In: Mathematical Aspects of Computer Science Proc. Symposia in Applied Mathematics (Schwartz, J. T., ed.), Vol. 19, pp. 19–32. Amer. Math. Soc. 1967.
-
-
-
-
11
-
-
84932343938
-
-
Fokkinga, M. C.: Inductive assertion patterns for recursive procedures. Techn. University Delft Report, 1973.
-
-
-
-
12
-
-
84932358266
-
-
Gerhart, S. L.: Proof theory of partial correctness verification systems. SIAM J. Comput. 5 (1976).
-
-
-
-
13
-
-
84932341470
-
-
Gorelick, G.: A complete axiomatic system for proving assertions about recursive and nonrecursive programs. Technical Report No. 75, Department of Computer Science, University of Toronto, January 1975.
-
-
-
-
14
-
-
0001501615
-
An axiomatic approach to computer programming
-
(1969)
CACM
, vol.12
, pp. 322-329
-
-
Hoare, C.A.R.1
-
17
-
-
84932388345
-
-
Lipton, R.: A necessary and sufficient condition for the existence of Hoare Logics. 18 Annual Symposium on Foundations of Computer Science, 1977.
-
-
-
-
19
-
-
84932335309
-
-
McGowan, C., Misra, J.: A mathematical basis for Dijkstra-Hoare semantics. Technical Report No. 73-73, Center for Computer and Information Sciences, Brown University, November 1973.
-
-
-
-
21
-
-
84932378993
-
-
Owicki, S.: A consistent and complete deductive system for the verification of parallel programs. 8th Annual Symposium on Theory of Computing, 1976.
-
-
-
-
22
-
-
84932300565
-
-
Scott, D.: Outline of a mathematical theory of computation. Proceeding of Fourth Annual Princeton Conference on Information Science and Systems. Princeton, pp. 169–176, 1970.
-
-
-
-
24
-
-
84932376388
-
-
Suzuki, N., Ishihata, K.: Implementation of an array bound checker. Proceedings of the 4th POPL, 1977.
-
-
-
-
25
-
-
84932357183
-
-
Wand, M.: A new incompleteness result for Hoare's system. 8th Annual Symposium on Theory of Computing, 1976.
-
-
-
|
