Software Reliability

Computer

Volumn 4, Issue 1, 1971, Pages 21-27

  Elspas, Bernard ^a   Gree, Milton W ^a   Levitt, Karl N ^a  

^a Computer Science Group Stanford Research Group ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 5344247851     PISSN: 00189162     EISSN: None     Source Type: Trade Journal    
DOI: 10.1109/C-M.1971.216741     Document Type: Article

References (22)

1. W. Kocher, “A Survey of Current Debugging Concepts,” Wolf Research and Development Corp., Blandensburg, Maryland, NASA Document No. N69-35613 (1969).
2. R. Grisham, “The Debugging System AIDS,” Proc. 1970 Spring Joint Computer Conference, AFIPS Press.
3. E. W. Dijkstra, “GO TO Statement Considered Harmful,” Communications of the ACM, Vol. 11, No.3, pp. 147–148 (1968).
4. J. R. Rice, “The GO TO Statement Reconsidered,” Com munications of the ACM, Vol. 11, No.8, pp 538 (1968).
5. P. J. H. King, “Decision Table,” The Computer Journal, Vol. 10, pp. 136–142 (1967).
6. H. H. Goldstine and J. Von Neumann, “Planning and Coding Problems for an Electronic Computer Instrument,” Part 2, Vol. 1–3 John Von Neumann Collected Works, Vol. 5, pp. 8–235, A. H. Taub (Ed) (Pergammon Press, New York, 1963).
7. P. Naur, “Proof of Algorithms by General Snapshots,” BIT, Vol. 6, No.4, pp. 310–316 (1966).
8. R. W. Floyd, “Assigning Meanings to Programs,” Proceed ings of a Symposium in Applied Mathematics, Mathematical Aspects of Computer Science, Vol. 19, pp. 19–32, J. T. Schwartz (Ed) (American Mathematical Society, Providence, Rhode Island, 1967).
9. R. L. London, “Computer Programs can be Proved Correct,” Proceedings of the Fourth Systems Symposium-Formal Systems and Non-Numerical Problem Solving by Computers, held at Case-Western Reserve University, (1968).
10. R. L. London, “Certification of the Algorithm Treesort,” Com munications of the ACM, Vol. 13, No.6, pp. 371–373 (1970).
11. C. A. R. Hoare, “An Axiomatic Basis for Computer Programming,” Communications of the ACM, Vol. 12, No. 10 (1969).
12. E. W. Dijkstra, “A Constructive Approach to the Problem of Program Correctness,” BIT, Vol. 8, No.3, pp. 174–186 (1968).
13. E. W. Dijkstra, Notes on Structured Programming, Technische Hogeschool, Eindhoven (1969).
14. P. Naur, “Programming by Action Clusters,” BIT, Vol. 9, pp. 250–258 (1969).
15. Z. Manna, “Properties of Programs and the First-Order Predicate Calculus,” Journal of the ACM, Vol. 16, No.2, pp. 244–255 (1969).
16. Z. Manna, “The Correctness of Programs,” Journal of Com puter and System Sciences, Vol. 3, No.2, pp. 119–127 (1969).
17. Z. Manna and A. Pnueli, “Formalization of Properties of Recursively Defined Functions,” ACM Symposium of Theory of Computing, pp. 201–210 (1969).
18. Z. Manna and R. J. Waldinger, “Towards Automatic Program Synthesis,” Communications of the ACM, (to appear).
19. D. Luckman, “The Resolution Principle in Theorem Proving,” Machine Intelligence 1, Collins and Michie (Eds.), (American Elsevier, Inc., New York 1967).
20. C. Green, “Theorem Proving by Resolution as a Basis for Question-Answering Systems,” Machine Intelligence 4, Mich ie and Meltzer (EdS.), (Edinburg University Press, Edinburgh 1969).
21. J. A. Robinson, “A Machine Oriented Logic Based on the Resolution Principle,” Journal of the ACM, Vol. 12, No.1, (1965).
22. J. C. King and R. W. Floyd, “Interpretation Oriented Theorem Prover Over Integers,” Second Annual ACM Symposium on Theory of Computing, pp. 169–179 (1970).