|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
ACZEL, P. A note on program verification. Private communication, Jan. 1982.
|
 |
3
|
|
| |
4
|
BURSTALL, R.M. Program proving as hand simulation with a little induction. In Proceedings, IFIP Congress 1974. ELsevier North-Holland, New York, 1974, pp. 308-312.
|
| |
5
|
|
 |
6
|
|
| |
7
|
FLOYD, R.W. Assigning meanings to programs. In Proceedings of 19th Symposium on Applied Mathematics. American Mathematical Society, Providence, R.I., 1967, pp. 19-31.
|
| |
8
|
FRANCEZ, N., ANn PNUELI, A. A proof method for cyclic programs. Acta Inf. 9, 2 (Apr. 1978), 133-157.
|
| |
9
|
|
 |
10
|
|
 |
11
|
|
| |
12
|
HOARE, C.A.R. Proof of correctness of data representations. Acta Inf. 1, 4 (Nov. 1972), 271-281.
|
 |
13
|
|
 |
14
|
|
| |
15
|
|
| |
16
|
JONES, C.B. Development methods for computer programs including a notion of interference. Tech. Rep. PRG 25, Programming Research Group, Oxford Univ., Oxford, Eng., 1981.
|
| |
17
|
|
| |
18
|
|
| |
19
|
JONES, C.B. Constructing a theory of a data structure as an aid to program development. Acta Inf. 11, 2 (Jan. 1979), 119-137.
|
| |
20
|
JONES, C.B. Formal development of programs. Tech. Rep. TR 12.117, IBM Hursley Laboratory, England, June 1973.
|
 |
21
|
|
| |
22
|
KAHN, G. A preliminary theory for parallel programs. Tech. Rep. 6, IRIA, Le Chesnay, France, 1973.
|
| |
23
|
LAMPORT, L. The "Hoare logic" of concurrent programs. Acta Inf. 14, 1 (June 1980), 21-37.
|
| |
24
|
LAUER, P.E. Consistent formal theories of the semantics of programming languages. Tech. Rep TR25.121, IBM Laboratory Vienna, Nov. 1971.
|
| |
25
|
LEVIN, G.M., AND GRIES, D. A proof technique for communicating sequential processes. Acta Inf. 15, 3 (June 1981), 281-302.
|
 |
26
|
|
| |
27
|
|
| |
28
|
|
| |
29
|
|
| |
30
|
MORRIS, J.H., JR. A correctness proof using recursively defined functions. In Formal Semantics of Programming Languages, R. Rustin (Ed.). Prentice-Hall, Englewood Cliffs, N.J., 1972.
|
| |
31
|
NAUR, P. Proof of algorithms by general snapshots. BIT 6 (1966), 310-316.
|
| |
32
|
|
 |
33
|
|
| |
34
|
PLOTKIN, G.D. A power domain construction. SIAMJ. Comput. 5, 3 (Sept. 1976), 452-487.
|
| |
35
|
|
| |
36
|
SMYTH, M.B. Power domains. J. Comput. Syst. Sci. 16 (1978), 23-36.
|
| |
37
|
U.S. DEPT. OF DEFENSE. Reference Manual for the Ada Programming Language (Proposed standard document). July 1980.
|
| |
38
|
VON LAMSWEERDE, A., AND SINTZOFF, M. Formal derivation of strongly correct parallel programs. Tech. Rep. R338, MBLE, Belgium, Oct. 1976.
|
 |
39
|
|
| |
40
|
ZHOU, C.C., AND HOARE, C.A.R. Partial correctness of Communicating sequential processes. In Proceedings, 2d International Conference on Distributed Computing Systems (Apr. 1981).
|
| |
41
|
ZHOU, C.C., A~D HOARE, C.A.R. Partial correctness of communicating processes and protocols. Tech. Rep. PRG-20, Programming Research Group, Oxford Univ., Oxford, Eng., 1981.
|
CITED BY 36
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Bruno Mermet , Dominique Méry, Service specifications: to B, or not to B, Proceedings of the second workshop on Formal methods in software practice, p.62-69, March 04-05, 1998, Clearwater Beach, Florida, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Xinyu Feng , Zhaozhong Ni , Zhong Shao , Yu Guo, An open framework for foundational proof-carrying code, Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation, January 16-16, 2007, Nice, Nice, France
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
REVIEW
"Randal P. Leavitt : Reviewer"
C. B. Jones has produced a very interesting report. It summarizes the work
done during his two year stay at Oxford, and illustrates the extension of his
rigorous software development method to include the programming of concurrent
processes. The
more...
|