Social processes and proofs of theorems and programs

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 1977, Pages 206-214

  Demillo, Richard A ^a   Lipton, Richard J ^b   Perils, Alan J ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DESCARTES; LOGICAL CORRECTNESS; PRECISE DEFINITION; SOCIAL PROCESS;

EID: 85051854572     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/512950.512970     Document Type: Conference Paper

References (24)

1. S. Ulam, Adventures of a Mathematician, Scribner, 1975.
2. A. B. Kempe, "On the Geographical Problem of the Four Colors", Amer. J. Mathematics, V. 2, (1879), pp. 193-200.
3. P. J. Heawood, "Map Coloring Theorems", Quarterly J. Math. Oxford Ser., V. 24, (1890), pp. 322-339
4. J. L. Britton, "The Existence of Infinite Burnside Groups", in W. W. Boone, F. B. Cannonito and R. C. Lynden (eds.), World Problems, North-Holland, (1973), pp. 67-348.
5. G. Bari Kolata, "Mathematical Proof: The Genesis of a Reasonable Doubt", Science, Vol. 192, (1976), pp. 989-990.
6. A. Meyer, "The Inherent Computational Complexity of Theories of Ordered Sets: A Brief Survey", Proa. International Congress of Mathematicians, August 1974.
7. M. O. Rabin, private communication.
8. P. Erdos and J. Spencer, Probabilistic Methods in Combinatorics, Academic Press (1974).
9. J. Hadamard, "Sur la Distribution des Zeros de la Fonction ζ (s) et ses Consequences Arithmetiques", Bull. Soc. Math de France, V. 24, (1896), pp. 199-220.
10. P. J. Cohen, "The Independence of the Continuum Hypothesis", Proc. Nat. Acad. Sci., USA, Part I, V. 50, pp. 1143-1148(1963), Part II, V. 51, pp. 105-110, (1964).
11. J. B. Rosser, Simplified Independence Proofs, Academic Press, (1971).
12. A. Robinson, "Infinite Forcing in Model Theory", in J. E. Fenstad (ed.) Proc. Second Scandinavian Logic Symposium, North-Holland, (1971), pp. 317-340.
13. R. W. Clark, Einstein: The Life and Times, World (1971).
14. C. A. R. Hoare, "Algorithm 65: FIND", C. A. C. M., V. 4(7), (1961), pp. 321+.
15. D. Knuth, J. Morris, V. Pratt, "Fast Pattern Matching in Strings", to appear in SIAM J. Computing.
16. L. Stockmeyer, "The Complexity of Decision Problems in Automata Theory and Logic", MIT Thesis, (1974).
17. R. London, private communication.
18. J. Schwartz, "On Programming", NYU Courant Report, 1973.
19. (See also "A Comparison of MADCAP and SETL" by J. B. Morris, Los Alamos Sci. Lab, University of California, Los Alamos, NM, 1973.)
20. J. R. Rice, private communication.
21. W. A. Wulf, R. L. London, and M. Shaw, "Abstraction and Verification in Alphard", Carnegie-Mellon University, Computer Science Department Research Report, July 1976.
22. D. E. Knuth, The Art of Computer Programming, Vol. I (1969), Vol. II (1969), Vol III (1975), Addison-Wesley.
23. F. T. Baker, "Chief Programmer Team Management of Production Programming", IBM Systems Journal, Vol. 11, No. 1, (1972), pp. 56-73.
24. S. L. Gerhart and L. Yelowitz, "Observations of Fallibility in Applications of Modern Programming Methodologies", IEEE Transactions in Software Engineering, Vol. SE-2, No. 3(September 1976), pp. 195-207.