1

AMAREL, S. "An approach to heuristic problem solving and theorem prowng in the propositional calculus." In Systems and computer science, Hart and Takasu (Eds.), Univ. Toronto Press, Toronto, Ont., Canada, 1967.

2

ANDERSON, l:{. "Completeness results for E- esolution." In Proc. AFIPS 1970 SJCC, Vol. 36, AFIPS Press, Montvale, N.J., 653-656

3

Peter B. Andrews, Resolution With Merging, Journal of the ACM (JACM), v.15 n.3, p.367-381, July 1968  [doi>10.1145/321466.321469]

4

ANDREWS, P. B. "Resolution in type theory." Dept of Mathematics, Carnegie Mellon Univ., Pittsburgh, Pa, 1970

5

BURGE, W. H "Provlng the correctness of a compiler." IBM Research Rept RC 2111, Yorktown Heights, N.Y, June 1969

6

BURSTALL, R M "Proving properties of programs by structural induction." Computer J. 12, 1 (Feb 1969), 41-48

7

Alonzo Church, The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies), Princeton University Press, Princeton, NJ, 1985

8

COOPER, D. C "Program scheme equivalences and second order logic." In Machine ,ntelhgence 4, B. Meltzer and D. Mlchie (Eds.), American Elsevier Publ. Co., New York, 1969, 3-15.

9

DARI,INGTON, J. L. "Automatic theorem proving with equality substitution and mathematical induction." In Machine ~ntelligence 3, D. Miehm (Ed.), American Elsevier Publ. Co., New York, 1968, 113-127.

10

DAvis, M. Computability and unsolvabiIity McGraw-Hill Book Co , New York, 1958.

11

Martin Davis , Hilary Putnam, A Computing Procedure for Quantification Theory, Journal of the ACM (JACM), v.7 n.3, p.201-215, July 1960  [doi>10.1145/321033.321034]

12

DE BAKKER, J W. "Semantics of programming languages." In Advances ~n znformatwn systems sczence, Vol 2, J. T. Ton (Ed.), Plenum Press, New York, 1969.

13

DIJKSTRA, E. W. "A constructive approach to the problem of program correctness " BIT 8, 3 (1968), 174-186.

14

DIJKSTRA, E W. "Notes on structured programming." TH Rept 70-WSK-03, 2nd ed., Technische Hogeschool, Eindhoven, The Netherlands, April 1970.

15

ELsPAS, B.; M W. GREEN; AND K. N. LEVITT. "Software reliability." Computer 4, 1 (Jan.- Feb. 1971), 21-27

16

FLORENTIN, J J. "Language definitmn and computer validation " In Machine ~nteIligence S, D. Michie (Ed.), American Elsevier Publ. Co., New York, 1968, 33-41.

17

FLOYD, R W A protocol of an ~maginary program retailer. Preliminary draft, July 1967.

18

FLOYD, R. W. "Assigning meanings to programs." In Mathematical aspects of computer science, Vol. 19, J. T. Schwartz (Ed), Amer. Math. Soc , Providence, R.I, 1967, 19-32

19

GOLDSTINE, H. H.; AND J. YON NEUMANN "Planning and coding problems for an electronic computer instrument, part 2, vol 1-3." In John yon Neumann collected works, Vol. 5, A. H. Taub (General Ed.), Pergamon Press, New York, 1963, 80-235.

20

Donald Irvin Good, Toward a man-machine system for proving program correctness, 1970

21

GOVLD, W. E. "A matching procedure for ~-order logic." PhD Thesis, Princeton Univ., Princeton, N.J., 1966.

22

GREEN, C. "Application of theorem proving to problem solving." In Proc. Internat. Joznt Conf. on A rhfic~al InteIhgence, D. E. Walker and L. M. Norton (Eds.), Mitre Corp , Bedford, Mass., 1969, 219-239.

23

GREF~N, C. "The application of theorem proving to question-answering systems." Tech. Note 8, SRI Project 7494, Stanford Research Inst., Menlo Park, Calif., June 1969.

24

GREEN, C. "Theorem proving by resolution as a basis for question-answering systems." In Machine intelhgence ~4, B. Meltzer and D. Michie (Eds.), Edinburgh Univ. Press, Edinburgh, Scotland, 1969, 183-205

25

GREEN, M. W.; B. ELs~As; AND K. N. LEVITT. "Translation of recursive schemas into labelstack flow-chart schemas." Prehminary draft, Stanford Research Inst., Menlo Park, Calif., June 1971.

26

Per Brinch Hansen, The nucleus of a multiprogramming system, Communications of the ACM, v.13 n.4, p.238-241, April 1970  [doi>10.1145/362258.362278]

27

HAYES, P. J. "A machine-oriented formulation of the extended functmnal calculus " Stanford Artificial Intelligence Project, Memo 62; also appeared as Metamathematics Unit Report, Univ. Edinburgh, Scotland, 1969.

28

HEaBR.~ND, J. "Recherches sur la th~orie de la d6monstration." Travaux de la Societ6 des Sciences et des Lettres de Varsovm, Classe IiI, No. 33, Paris, 1930.

29

HEWlTT, C. "More comparative schematology." Artificial Intelligence Memo No. 207, Project MAC, MIT, Cambridge, Mass., Aug. 1970.

30

C. A. R. Hoare, An axiomatic basis for computer programming, Communications of the ACM, v.12 n.10, p.576-580, Oct. 1969  [doi>10.1145/363235.363259]

31

IANOV, Y. I. "The logical schemes of algorithms " In Problems of cybernetics, Vol 1, Translated from the Russmn by Nadler, Grifi~ths, Kms, and Muir, Pergamon Press, New York, 1960, 82-140

32

KAPLAN, D. M. "Proving things about programs." Presented at ~th Annual Pmnceton Conf. on Information Science and Systems, Princeton Univ, March 1970.

33

James Cornelius King, A program verifier, 1970

34

James C. King , Robert W. Floyd, An interpretation oriented theorem prover over integers, Proceedings of the second annual ACM symposium on Theory of computing, p.169-179, May 04-06, 1970, Northampton, Massachusetts, United States  [doi>10.1145/800161.805162]

35

KLEENE, S. C Introductwn to metamathemattes, D. Van Nostrand Co., Inc, Princeton, N.J., 1952.

36

KONIG, D. Theome der endlichen ur~d unendl~chen Graphen Chelsea Publ. Co., Bronx, N Y, 1950, 81

37

LANDIN, P. J ; AND ~. M. BURSTALL "Programs and their proofs: an algebraic approach." In Machzne ~ntell, gence 4, B. Meltzer and D. Mlchie (Eds.), American Elsevmr Publ. Co, New York, 1969

38

LEAVENWORTH, B. Review of paper by P Naur {"Programming by action clusters " BIT 9, 3 (1969), 250-258}. Computing Reviews ll, 7 (July 1970), Rev. 19,420

39

LONDON, }~. L. "Computer programs can be proved correct " In Proc ~th Systems Symposium-Formal Systems and Non-Numemcal Problem Solwng by Computers, held at Case Western Reserve Univ., November 1968, R. B. Banerji and M D. Mesarovic (Eds.), Springer Verlag, New York, 1970, 281-302.

40

Ralph L. London, Certification of algorithm 245 [M1]:treesort 3:proof of algorithms—a new kind of certification, Communications of the ACM, v.13 n.6, p.371-373, June 1970  [doi>10.1145/362384.362507]

41

LONDON, ~. L "Bibliography on proving the correctness of computer programs." In Machine ~ntellzgence 5, B Meltzer and D Michie (Eds.), American Elsevier Publ. Co., New York, 1970, 569-580.

42

LONDON, ~. L. "Software reliability through proving programs correct " Publ 71C 6-C, IEEE Computer Society, New York, March 1971

43

LONDON, }:{. L.; AND J. H. HA.LTON. "Proofs of algorithms for asymptotic series " Computer Sciences Tech Rept No. 54A, Univ Wisconsin, Madison, Wise , May 1969.

44

LOVELAND, D. A "A linear format for resolution " Proc Symposium on Automatw Deductwn, Inst de Recherche d'Informatique et d'Automatique, Versailles, France, Dec. 1968 In Lecture notes ~n mathematzcs, No 125, Springer Verlag, New York, 1970.

45

LUCKHAM, }_). "Some tree-paring strategies for theorem-proving " In Machine ,ntelligence 3, D. Michie (Ed), American Elsevier Publ. Co., York, 1968, 95-112.

46

LUCKUa~, D "Refinement theorems in resolution theory " Proc. Symposium on Automatzc Deductwn, Inst. de Recherche d'Informatique et d'Automa~lque, Versailles, France, Dec. 1968. In Lecture notes ~n mathematics, No. 125, Springer Verlag, New York 1970; also in Stunford Artificial Intelhgence Project Memo AI-81, 1969

47

LUCKHAM, D. C.; D. M. R. PAR~; AND M S. PATERSOn. "On formalized computer programs " J. Computer & System Sciences 4, 3 (June 1970), 220-249.

48

Zohar Manna, Properties of Programs and the First-Order Predicate Calculus, Journal of the ACM (JACM), v.16 n.2, p.244-255, April 1969  [doi>10.1145/321510.321516]

49

MANNA, Z. "The correctness of programs." J. Compu~,er & System Sciences 3, 2 (May 1969), 119-127.

50

Zohar Manna, Second-order mathematical theory of computation, Proceedings of the second annual ACM symposium on Theory of computing, p.158-168, May 04-06, 1970, Northampton, Massachusetts, United States  [doi>10.1145/800161.805161]

51

MANNA, Z.; AND J. MCCARTHY "Properties of programs and partial functmn logic " In Macine mtelhgence 5, B. Meltzer and D. Mlchie (Eds.), American Elsevier Publ .Co., New York, 1970, 27-37

52

MANNA, Z.; AND A PNUELI "The validity problem of the 91-function." Artificial Intelligence Memo No 68, Stanford Univ., Stanford, Calif., Aug. 1968

53

Zohar Manna , Amir Pnueli, Formalization of properties of recursively defined functions, Proceedings of the first annual ACM symposium on Theory of computing, p.201-210, May 05-07, 1969, Marina del Rey, California, United States  [doi>10.1145/800169.805434]

54

Zohar Manna , Amir Pnueli, Formalization of Properties of Functional Programs, Journal of the ACM (JACM), v.17 n.3, p.555-569, July 1970  [doi>10.1145/321592.321606]

55

Zohar Manna , Richard J. Waldinger, Toward automatic program synthesis, Communications of the ACM, v.14 n.3, p.151-165, March 1971  [doi>10.1145/362566.362568]

56

MCCARTHY, J. "A basis for a mathematical theory of computation." In Computer programm~ng and formal systems, P Braffort and D. Hirschberg (Eds.), North-Holland Publ. Co., Amsterdam, 1963, 33-70; also ia Proc. Western Joint Computer Conf, Vol. 19, Spartan Books, New York, 1961, 225-238

57

McCAaTHY, J "Towards a mathematical science of computation " In Proc. IFIP Cong. 62, C. M Popplewell (Ed.), North-Holland Publ. Co , Amsterdam, 1963, 21-28.

58

MCCARTHY, J ; AND J A. PAINTER "Correctness of a compiler for arithmetic expressmns." In Mathematical aspects of computer science, Vol. 19, J T. Schwartz (Ed), Amer. Math Soc , Providence, R I , 1967, 33-41

59

MEJ~ZER, B. "Theorem-proving for computers some results on resolution and renaming." Computer J 8, 4 (Jan. 1956), 341-343.

60

Elliott Mendelson, Introduction to mathematical logic (3rd ed.), Wadsworth Publ. Co., Belmont, CA, 1987

61

Mo~s, J. B., J~. "E-resolutmn: extension of resolutmn to include the equality relation." In Proc. Internatl. Joint Conf. on Artificial Intelligence, D. E. Walker and L M. Norton (Eds), The Mitre Corp , Bedford, Mass., 1969, 287-294

62

NAun, P. "Proof of algorithms by general snapshots " BIT 6, 4 (1966), 310-316.

63

NAun, P. "Programming by action clusters." BIT 9, 3 (1969), 250-258.

64

NEWELL, A.; J C SH~W; AND H. A. SIMON. "Empirical explorations of the logic theory machine a case study in heuristic " In Proc. Western Joint Computer Conf , Vol. 11, Spartan Books, New York, 1957, 218-230.

65

PARK, D. "F1xpomt induction and proofs of program properties " In Machine ~ntelhgence 5, B Meltzer and D Michie (Eds), American Elsevier Publ. Co , New York, 1969, 59-78.

66

PATERSON, M S. "Equivalence problems in a model of computation " PhD Thesis, Cambridge Univ., Cambridge, England, Aug. 1967.

67

PATERSON, M S ; AND C E. HEWITT. "Comparative schematology " In Record o~ the Prosect MAC Conf on Concurrent Systems and Parallel Computatwn, ACM:, New York, 1970, 119-127

68

PI~AWlTZ, D. "An improved proof procedure " Theorm 26, (1980), 102-139.

69

ROBINSON, G ;AND L. WoN. "Paramodulation and theorem-proving ~n first-order theories with equality " In Machine zntelhgence 4, B. Meltzer and D. Michm (Eds.), American Elsevier Publ. Co, New York, 1969, 135-150.

70

J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM (JACM), v.12 n.1, p.23-41, Jan. 1965  [doi>10.1145/321250.321253]

71

ROBINSON, J. A. "Automatic deduction with hyper-resolutlon " Internatl J. Computer Math 1, (1965), 227-234

72

ROBINSON, J A. "Mechanizing htgher-order logic " In Machine ~ntelhgence 4, B Meltzer and D Mlchle (Eds.), Amerman Elsevier Publ. Co., New York, 1969, 151-170

73

Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987

74

RULXFSON, J. F, R. J. WALDINGER, AND J. DERKSEN "A language for wmting problemsolving programs " Presented at IFIP Cong. 1971, Ljubljana, Yugoslavia, Aug 1971, North- Holland Publ. Co, Amsterdam, 1972.

75

RUSSELL, B;AND A N WHITEHEAD Pr~ncipia mathematzca, Vo{s 1-3. University Press, Cambridge, England, 1925-7 (2d ed.).

76

J. D. Rutledge, On Ianov's Program Schemata, Journal of the ACM (JACM), v.11 n.1, p.1-9, Jan. 1964  [doi>10.1145/321203.321204]

77

Herbert A. Simon, Experiments with a Heuristic Compiler, Journal of the ACM (JACM), v.10 n.4, p.493-506, Oct. 1963  [doi>10.1145/321186.321192]

78

James R. Slagle, Automatic Theorem Proving With Renamable and Semantic Resolution, Journal of the ACM (JACM), v.14 n.4, p.687-697, Oct. 1967  [doi>10.1145/321420.321428]

79

H. R. Strong, Jr., Translating recursion equations into flow charts, Proceedings of the second annual ACM symposium on Theory of computing, p.184-197, May 04-06, 1970, Northampton, Massachusetts, United States  [doi>10.1145/800161.805164]

80

WALDINGER, R J "Constructing programs automatically using theorem proving." PhD Thesis, Carnegie-Mellon Univ., Pittsburgh, Pa., 1969

81

WALDINGER, R J.; AND R. C. T. LEE. "PRow: a step toward automatic program writing " In Proc Internat Joint Conf. on Art~ficzal Intelhgence, D. E Walker and L. M Norton (Eds), Mitre Corp, Bedford, Mass., 1969, 241-252.

82

WANG, H "Toward mechanical m~thematics." IBM d. R & D 4, (1960), 2-22.

83

WENSbEY, J. H. "A class of non-analytical iteratlve processes " Computer J. 1, (1958), 163-167

84

Lawrence Wos , George A. Robinson , Daniel F. Carson, Efficiency and Completeness of the Set of Support Strategy in Theorem Proving, Journal of the ACM (JACM), v.12 n.4, p.536-541, Oct. 1965  [doi>10.1145/321296.321302]

85

Wos, L ; D. F. CARSON; AND G. A ROBINSON. "The unit preference strategy in theorem proving" In Proc. I964 FJCC, Vol 26, Pt 1, Spartan Books, New York, 615-621

86

YATES, R, B RAPHAEL; AND T. P HART. "Resolution graphs." Artificial Intelligence Group, Stanford Research Inst. Tech. Note 24, Menlo Park, Callf, 1970

Donald I. Good, Provable programming, ACM SIGPLAN Notices, v.10 n.6, p.411-419, June 1975

Charles E. Hughes , Charles P. Pfleeger, Pascal program development aids, Proceedings of the 17th annual Southeast regional conference, p.38-44, April 09-11, 1979, Orlando, Florida

Raymond T. Yeh , Donald I. Good , David R. Musser, New directions in teaching the fundamentals of computer science — discrete structures and computational analysis, ACM SIGCSE Bulletin, v.5 n.1, p.60-67, February 1973

Webb Miller, A case for TOOLPACK, ACM SIGNUM Newsletter, v.14 n.1, p.68-70, March 1979

E. F. Miller, Jr. , R. A. Melton, Automated generation of testcase datasets, ACM SIGPLAN Notices, v.10 n.6, p.51-58, June 1975

Leon Presser, Software management, Proceedings of the 1975 annual conference, p.283-285, January 1975

C. V. Ramamoorthy , S. F. Ho, Testing large software with automated software evaluation systems, ACM SIGPLAN Notices, v.10 n.6, p.382-394, June 1975

G. David Ripley, A course in effective programming, ACM SIGCSE Bulletin, v.7 n.1, p.102-108, February 1975

Leon J. Osterweil, Allegations as aids to static program testing, Proceedings of the annual conference, p.479-482, October 20-22, 1976, Houston, Texas, United States

W. G. Bouricius, Procedure for testing microprograms, Conference record of the 7th annual workshop on Microprogramming, p.235-240, September 30-October 02, 1974, Pal Alto, California, United States

James C. King, Symbolic execution and program testing, Communications of the ACM, v.19 n.7, p.385-394, July 1976

John R. White , Leon Presser, A tool for enforcing system structure, Proceedings of the annual conference, p.114-118, August 27-29, 1973, Atlanta, Georgia, United States

Ashok K. Agrawala , Tomlinson G. Rauscher, The application of programming language techniques to the design and development of microprogramming languages, Conference record of the 6th annual workshop on Microprogramming, p.134-138, September 24-25, 1973, College Park, Maryland, United States

P. J. Brown, Programming and Documenting Software Projects, ACM Computing Surveys (CSUR), v.6 n.4, p.213-220, Dec. 1974

Ben Wegbreit, The synthesis of loop predicates, Communications of the ACM, v.17 n.2, p.102-113, Feb. 1974

Jacques Cohen , Carl Zuckerman, Two languages for estimating program efficiency, Communications of the ACM, v.17 n.6, p.301-308, June 1974

Maureen Harris Cheheyl , Morrie Gasser , George A. Huff , Jonathan K. Millen, Verifying Security, ACM Computing Surveys (CSUR), v.13 n.3, p.279-339, Sept. 1981

Peter Freeman, Automating software design, Proceedings of the 10th workshop on Design automation, p.62-67, June 25-27, 1973

Guido Persch , Georg Winterstein, Symbolic interpretation and tracing of PASCAL-programs, Proceedings of the 3rd international conference on Software engineering, p.312-319, May 10-12, 1978, Atlanta, Georgia, United States

R. S. Fabry, Dynamic verification of operating system decisions, Communications of the ACM, v.16 n.11, p.659-668, Nov. 1973

Webb Miller, Toward mechanical verification of properties of roundoff error propagation, Proceedings of the fifth annual ACM symposium on Theory of computing, p.50-58, April 30-May 02, 1973, Austin, Texas, United States

J. C. Huang, An Approach to Program Testing, ACM Computing Surveys (CSUR), v.7 n.3, p.113-128, Sept. 1975

Terrence Pratt, Four models for the analysis and optimization of program control structures, Proceedings of seventh annual ACM symposium on Theory of computing, p.167-176, May 05-07, 1975, Albuquerque, New Mexico, United States

Sidney L. Hantler , James C. King, An Introduction to Proving the Correctness of Programs, ACM Computing Surveys (CSUR), v.8 n.3, p.331-353, Sept. 1976

Lloyd Fosdick , Donald I. Good, SIGSOFT tutorial on program verification (Tutorial Session), Proceedings of the annual conference, p.521-522, October 20-22, 1976, Houston, Texas, United States

Ralph L. London, The current state of proving programs correct, Proceedings of the ACM annual conference, p.39-46, August 01-01, 1972, Boston, Massachusetts, United States

Robert Lechner , William Stallings, A minisystem programming language, Proceedings of the annual conference, p.174-182, August 27-29, 1973, Atlanta, Georgia, United States

Ralph L. London, A view of program verification, ACM SIGPLAN Notices, v.10 n.6, p.534-545, June 1975

Webb Miller, Software for Roundoff Analysis, ACM Transactions on Mathematical Software (TOMS), v.1 n.2, p.108-128, June 1975

Robert Lechner , William Stallings, A systems programming language for minicomputers, ACM SIGPLAN Notices, v.8 n.6, June 1973

Zerksis D. Umrigar , Vijay Pitchumani, Formal verification of a real-time hardware design, Proceedings of the 20th conference on Design automation, p.221-227, June 27-29, 1983, Miami Beach, Florida, United States

Gerald J. Popek, Correctness in access control, Proceedings of the annual conference, p.236-241, August 27-29, 1973, Atlanta, Georgia, United States

Gerald J. Popek , David A. Farber, A model for verification of data security in operating systems, Communications of the ACM, v.21 n.9, p.737-749, Sept. 1978

Tom Towle , Tom DeFanti, GAIN: An interactive program for teaching interactive computer graphics programming, ACM SIGGRAPH Computer Graphics, v.12 n.3, p.54-59, August 1978

Larry C. Ragland , Donald I. Good, Certification of algorithm 386 [A1], Communications of the ACM, v.16 n.4, p.257, April 1973

Joe W. Duran, Heuristics for program synthesis using loop invariants, Proceedings of the 1978 annual conference, p.891-900, January 1978

B. Randell , P. Lee , P. C. Treleaven, Reliability Issues in Computing System Design, ACM Computing Surveys (CSUR), v.10 n.2, p.123-165, June 1978

Leonard H. Weiner, The roots of structured programming, ACM SIGCSE Bulletin, v.10 n.1, February 1978

Leslie Lamport, On programming parallel computers, ACM SIGPLAN Notices, v.10 n.3, p.25-33, March 1975

J. Kljaich, Jr. , B. T. Smith , A. S. Wojcik, Formal Verification of Fault Tolerance Using Theorem-Proving Techniques, IEEE Transactions on Computers, v.38 n.3, p.366-376, March 1989

Paul Abrahams, "Structured programming" considered harmful, ACM SIGPLAN Notices, v.10 n.4, April 1975

Michale J. Spier , Thomas N. Hastings , David N. Cutler, An experimental implementation of the kernel/domain architecture, ACM SIGOPS Operating Systems Review, v.7 n.4, p.8-21, October 1973

Frederick J. Drasch , Richard A. Bowen, IDBUG: A tool for program development, ACM SIGSOFT Software Engineering Notes, v.3 n.5, p.106-110, November 1978

Kurt M. Olender , Leon J. Osterweil, Cecil: A Sequencing Constraint Language for Automatic Static Analysis Generation, IEEE Transactions on Software Engineering, v.16 n.3, p.268-280, March 1990

Susan L. Gerhart, Methods for teaching program verification, ACM SIGCSE Bulletin, v.7 n.1, p.172-178, February 1975

Daniel J. Salomon, Four Dimensions of programming-language independence, ACM SIGPLAN Notices, v.27 n.3, p.35-53, March 1992

Karl N. Levitt, The application of program-proving techniques to the verification of synchronization processes, Proceedings of the December 5-7, 1972, fall joint computer conference, part I, December 05-07, 1972, Anaheim, California

K. H. Kim , C. V. Ramamoorthy, Failure-tolerant parallel programming and its supporting system architecture, Proceedings of the June 7-10, 1976, national computer conference and exposition, June 07-10, 1976, New York, New York

T. A. Linden, A summary of progress toward proving program correctness, Proceedings of the December 5-7, 1972, fall joint computer conference, part I, December 05-07, 1972, Anaheim, California

Steven M. German , Ben Wegbreit, A synthesizer of inductive assertions, Proceedings of the May 19-22, 1975, national computer conference and exposition, May 19-22, 1975, Anaheim, California

Steven B. Lipner , William A. Wulf , Roger R. Schell , Gerald J. Popek , Peter G. Neumann , Clark Weissman , Theodore A. Linden, Security kernels, Proceedings of the May 6-10, 1974, national computer conference and exposition, May 06-10, 1974, Chicago, Illinois

Ben Hegbreitt, Heuristic methods for mechanically deriving inductive assertio, Proceedings of the 3rd international joint conference on Artificial intelligence, p.524-536, August 20-23, 1973, Stanford, USA

Peter M. Neely, On the need for a scientific programming language, Proceedings of the 1974 annual ACM conference, January 01-01, 1974

Bernard Elspas: colleagues

Karl N. Levitt: colleagues

Richard J. Waldinger: colleagues

Abraham Waksman: colleagues