DOCSLIB.ORG

Boyer's Education

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Boyer's Education Curriculum Vitae Robert Stephen Boyer Home address: 614 W. 32nd St. Austin, TX 78705 USA Born: August 2, 1946, Washington, D. C. Citizenship: U.S.A. Wife: Anne Olivia Herrington, married 1966 Children: Madeleine, Margaret, Nathaniel Father: Cdr. Fred Y. Boyer, U.S.N., Ret. Mother: Catherine Ann Boyer home telephone: : +1 512 467 0182 e-mail: [email protected] home page: http://www.cs.utexas.edu/users/boyer/index.html Education Ph. D., Mathematics, 1971 University of Texas, Austin, Texas B. A., Mathematics, Magna cum laude, 1967 University of Texas, Austin, Texas King High School, Kingsville, Texas, 1964 Jobs Professor in Computer Sciences, Mathematics, and Philosophy Departments University of Texas at Austin, 1981-2008 Senior Computing Research Scientist, Fall 1993 - Spring 1995, Computational Logic, Inc. Austin, Texas Senior Member of Technical Staff, 1985-1987 Microelectronics and Computer Technology Corporation Artificial Intelligence Program Austin, Texas Associate Professor, 1981-1985 1 Computer Sciences Department, University of Texas at Austin Staff Scientist, 1981 Senior Research Mathematician, 1979-81 Research Mathematician, 1973-78 Computer Science Laboratory SRI International Menlo Park, California Research Fellow, 1971-73 Department of Computational Logic University of Edinburgh, Edinburgh, Scotland Research Assistant, 1970-71 Artificial Intelligence Laboratory Massachusetts Institute of Technology, Cambridge, Mass. Teaching Assistant, 1967-70 Department of Mathematics University of Texas, Austin, Texas Honors and Professional Activities The 2005 Software System Award was given for the Boyer-Moore Theorem Prover to Robert S. Boyer, Matt Kaufmann, and J Strother Moore by the Association for Computing Machinery. 6th Herbrand Award for exceptional contributions to the field of Automated Deduction, awarded by CADE Inc. (Conferences on Automated Deduction) at CADE-16, Trent, July, 1999. With J Strother Moore. Best of Austin Award, Austin Chronicle, category "best argument for tenure", 1996, http://www.auschron.com/issues/annual/bestof/96/critics/boa96.C.pols.html Fellow of the American Association for Artificial Intelligence, 1991 1991 Current Prize in Automatic Theorem Proving of the American Mathematical Society (with J Strother Moore) Member of the Editorial Board of the Journal of Automated Reasoning, 1990-2007 Member of the Editorial Board of the Journal of Logic and Computation, Oxford, 1991-1993 Keynote Address, North American Conference on Logic Programming, 1990 Keynote Address, Tenth Conference on Automated Deduction, 1990 Skolem Lecture, University of Oslo, 1989 2 Member of the Editorial Board of the Journal of Automated Reasoning, since 1989 General Chairman, 1984 Conference on Lisp and Functional Programming. Member of the Editorial Board of the Journal of Symbolic Computation, 1984-1987 John McCarthy Prize for Program Verification, 1983, (with J Strother Moore) IBM Chaire Internationale d'Informatique, Universite de Liege, Belgium, (32 lectures), 1980 Member of the Editorial Board of the Journal of Artificial Intelligence, 1977 to 1994. NASA Fellowship, Mathematics Department, University of Texas at Austin, 1967-70 Phi Beta Kappa, 1967 Junior Fellow, University of Texas, 1965-1967 Valedictorian, King High School, Kingsville, Texas, 1964 Books A Computational Logic Handbook, with J S. Moore. Academic Press, London, 1998. Second Edition. xxv+518 Automated Reasoning: Essays in Honor of Woody Bledsoe. (editor). Kluwer Academic, Dordrecht, The Netherlands, 1991. Picture of Woody. A Computational Logic Handbook, with J S. Moore. Academic Press, New York, 1988. xvi+408 The Correctness Problem in Computer Science (editor, with J S. Moore). Academic Press, London, 1981. A Computational Logic, with J S. Moore. Academic Press, New York, 1979. xiv+397. Now public domain. Articles Toward Automating the Discovery of Decreasing Measures, with Wilfred J. Legato and Victor W. Marek. Journal of Automated Reasoning, Vol. 35, pp. 355-371, December, 2005. Single-Threaded Objects in ACL2, with J Strother Moore, in S. Krishnamurthi and C. R. Ramakrishnan, editors, Practical Aspects of Declarative Languages 2002, Lecture Notes in Computer Science 2257, 2002, Springer-Verlag, pp. 9-27. Mechanized Formal Reasoning about Programs and Computing Machines, with J Strother Moore, in 3 Robert Veroff, editor, Automated Reasoning and Its Applications: Essays in Honor of Larry Wos, MIT Press, 1997, pp. 147-176. Automated Proofs of Object Code for a Widely Used Microprocessor, with Yuan Yu, Journal of the ACM, January 1996, Vol. 43, No. 1, pp. 166-192. (This is a major revision and extension of the paper "Automated Correctness Proofs of Machine Code Programs for a Commercial Microprocessor", see below. The comprehensive treatment of this subject may be found in Yuan Yu's 700+ page dissertation.) Woody Bledsoe: His Life and Legacy, with Michael Ballantyne and Larry Hines, AI Magazine, Vol. 17, No. 1, Spring 1996, pp. 7-20. Picture of Woody. The Boyer-Moore Theorem Prover and Its Interactive Enhancement, with M. Kaufmann and J S. Moore, Computers and Mathematics with Applications, Vol. 29, No. 2, pp. 27-62, 1995. Automated Correctness Proofs of Machine Code Programs for a Commercial Microprocessor, with Yuan Yu, in D. Kapur, editor, Automated Deduction -- CADE-11, Lecture Notes in Computer Science 607, Springer-Verlag, 1992, pp. 416-430. MJRTY - A Fast Majority Vote Algorithm, with J S. Moore, in Robert S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe. Kluwer Academic, Dordrecht, The Netherlands, 1991, pp. 105-117. A Biographical Sketch of W. W. Bledsoe, with Anne Boyer, in Robert S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe. Kluwer Academic, Dordrecht, The Netherlands, 1991, pp. 1-29. Functional Instantiation in First Order Logic, with D. Goldschlag, M. Kaufmann, and J Moore, in V. Lifschitz (editor), Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy. Academic Press, 1991, pp. 7-26. The file fs.ps (or fp.pdf) is a somewhat extended version of the published version because it contains some proofs that were omitted from the published version. A Theorem Prover for a Computational Logic, with J S. Moore, keynote address, Automated Deduction -- CADE-10, Lecture Notes in Computer Science 449, Springer-Verlag, 1990, pp. 1-15. The Use of a Formal Simulator to Verify a Simple Real Time Control Program, with M. W. Green and J S. Moore. in W. H. J. Feijen, A. J. M. van Gasteren, D. Gries, and J. Misra, editors, Beauty is Our Business, Springer-Verlag, 1990, pp. 54-66. The Efficient Implementation of Lattice Operations, with H. Ait-Kaci, P. Lincoln, and R. Nasr. Association for Computing Machinery Transactions on Programming Languages and Systems, Vol. 11, No. 1, pp. 115-146, January 1988. The Addition of Bounded Quantification and Partial Functions to a Computational Logic and Its Theorem Prover, with J S. Moore, Journal of Automated Reasoning, Volume 4, pp. 117-172, 1988. Integrating Decision Procedures into Heuristic Theorem Provers: A Case Study of Linear Arithmetic, with J S. Moore. Machine Intelligence 11, Oxford University Press, 1988, pp. 83-124. Set Theory in First Order Logic: Clauses for Goedel's Axioms, with E. Lusk, W. McCune, R. Overbeek, M. Stickel, and L. Wos, Journal of Automated Reasoning, Vol. 2, No. 3., pp. 287-327, 1986. 4 Program Verification, with J S. Moore. Automated Reasoning, Vol. 1, No. 1, 1985, pp. 17-23. A Mechanical Proof of the Turing Completeness of PURE LISP, with J S. Moore. In W. W. Bledsoe and D. W. Loveland, editors, Contemporary Mathematics, Volume 29, Automated Theorem Proving: After 25 Years, American Mathematical Society, Providence, Rhode Island, 1984, pp. 132-168. Proof-Checking, Theorem-Proving, and Program Verification, with J S. Moore. In W. W. Bledsoe and D. W. Loveland, editors, Contemporary Mathematics, Volume 29, Automated Theorem Proving: After 25 Years, American Mathematical Society, Providence, Rhode Island, 1984, pp. 119-132. Proof Checking the RSA Public Key Encryption Algorithm, with J S. Moore. American Mathematical Monthly, Vol. 91, No. 3, March 1984, pp. 181-189. A Mechanical Proof of the Unsolvability of the Halting Problem, with J S. Moore. Journal of the Association for Computing Machinery, Vol. 31, No. 3, July 1984, pp.441-458. A Verification Condition Generator for FORTRAN, with J S. Moore. In R. S. Boyer and J S. Moore, editors, The Correctness Problem in Computer Science, Academic Press, London, 1981, pp. 9-101. Metafunctions: Proving Them Correct and Using Them Efficiently as New Proof Procedures, with J S. Moore. In R. S. Boyer and J S. Moore, editors, The Correctness Problem in Computer Science, Academic Press, London, 1981, pp. 103-184. A Lemma Driven Automatic Theorem Prover for Recursive Function Theory, with J S. Moore. Proceedings of the 5th International Joint Conference on Artificial Intelligence, pp. 511-519, 1977. A Fast String Searching Algorithm, with J S. Moore. Communications of the Association for Computing Machinery, Vol. 20, No. 10, pp. 762-772, 1977. (Many university library users and ACM members will be able to utilize this URL at the ACM site to read the paper, but not everyone.) Primitive Recursive Program Transformation, with J S. Moore and R. E. Shostak. Proceedings of the Third Association for Computing Machinery Symposium on Principles of Programming Languages, Atlanta, 1976. SELECT--A Formal System for Testing and Debugging Programs, with K. N. Levitt and B. Elspas. Proceedings of the International Conference on Reliable Software, IEEE Catalogue Number 75CHO940-7CSR, pp. 234-245, 1975. Proving Theorems about LISP Functions, with J S. Moore. Journal of the Association for Computing Machinery, Vol. 22, No. 1, pp. 129-144, 1975. The Sharing of Structure in Theorem-proving Programs, with J S. Moore. In B. Meltzer and D. Michie, editors, Machine Intelligence, Vol. 7, pp. 101-116, Edinburgh University Press, 1972. Computer Proofs of Limit Theorems, with W. W. Bledsoe and W. H. Henneman, Artificial Intelligence, Vol. 3, No. 1, pp. 27-60, 1972. Other Writing Circuit Specification, Abstraction, and Reverse Engineering, with Warren Hunt, ACL2 Workshop, 5 2007.
Load more

Recommended publications
  • Theorem Proving for Verification
    Theorem Proving for Verification the Early Days J Strother Moore Department of Computer Sciences University of Texas at Austin 1 Prologue When I look at the state of our science today, I am amazed and proud of how far we've come and what is routinely possible today with mechanized verification. But how did we get here? 2 A personal perspective on the journey University of Xerox PARC Edinburgh & SRI ’74−81 ’70−73 UT Austin MIT & CLI ’66−70 Dickinson, Texas −, 1966 3 Hope Park Square, Edinburgh, 1970 4 Hope Park Square, Edinburgh, 1970 Rod Burstall Donald Michie Bernard Meltzer Bob Kowalski Pat Hayes 5 Hope Park Square, Edinburgh, 1970 Rod Burstall Donald Michie Bernard Meltzer Bob Kowalski Pat Hayes Gordon Plotkin 1968 6 Hope Park Square, Edinburgh, 1970 Rod Burstall Donald Michie Bernard Meltzer Bob Kowalski Pat Hayes Gordon Plotkin 1968 Mike Gordon 1970 J Moore 1970 7 Hope Park Square, Edinburgh, 1970 Rod Burstall Donald Michie Bernard Meltzer Bob Kowalski Pat Hayes Gordon Plotkin 1968 Mike Gordon 1970 J Moore 1970 Bob Boyer 1971 Alan Bundy 1971 8 Hope Park Square, Edinburgh, 1970 Rod Burstall Donald Michie Bernard Meltzer Bob Kowalski Pat Hayes Gordon Plotkin 1968 Mike Gordon 1970 J Moore 1970 Bob Boyer 1971 Alan Bundy 1971 Robin Milner 1973 9 Our Computing Resources 64KB of RAM, paper tape input 10 11 Instead of debugging a program, one should prove that it meets its specifications, and this proof should be checked by a computer program. | John McCarthy, \A Basis for a Mathematical Theory of Computation," 1961 12 Theorem Proving in 1970
    [Show full text]
  • Automation of Mathematical Induction As Part of the History of Logic
    2009 SEKI http://wirth.bplaced.net/seki.html ISSN 1437-4447 Automation of Mathematical Induction as part of the History of Logic J Strother Moore Report Dept. Computer Sci., Gates Dell C., 2317 Speedway, The University of Texas at Austin, Austin, TX 78701 [email protected] Claus-Peter Wirth FB AI, Hochschule Harz, D–38855 Wernigerode, Germany [email protected] SEKI Report SR–2013–02 SEKI SEKI is published by the following institutions: German Research Center for Artificial Intelligence (DFKI GmbH), Germany Robert Hooke Str.5, D–28359 Bremen • Trippstadter Str. 122, D–67663 Kaiserslautern • Campus D 3 2, D–66123 Saarbrücken • Jacobs University Bremen, School of Engineering & Science, Campus Ring 1, D–28759 Bremen, Germany Universität des Saarlandes, FR 6.2 Informatik, Campus, D–66123 Saarbrücken, Germany SEKI Editor: Claus-Peter Wirth E-mail: [email protected] WWW: http://wirth.bplaced.net Please send surface mail exclusively to: DFKI Bremen GmbH Safe and Secure Cognitive Systems Cartesium Enrique Schmidt Str. 5 D–28359 Bremen Germany This SEKI Report was internally reviewed by: Alan Bundy University of Edinburgh, Centre for Intelligent Systems and their Applications, School of Informatics, Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland E-mail: [email protected] WWW: http://homepages.inf.ed.ac.uk/bundy Bernhard Gramlich Vienna University of Technology, Faculty of Informatics, Theory and Logic Group, Favoritenstr. 9, E185/2, A–1040 Wien, Austria E-mail: [email protected] WWW: http://www.logic.at/staff/gramlich Automation of Mathematical Induction as part of the History of Logic J Strother Moore Dept.
    [Show full text]
  • Phd-Dissertation.Pdf
    Copyright by Panagiotis Manolios 2001 Mechanical Verification of Reactive Systems by Panagiotis Manolios, B.S.,M.A. Dissertation Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy The University of Texas at Austin August 2001 The Dissertation Committee for Panagiotis Manolios Certifies that this is the approved version of the following dissertation: Mechanical Verification of Reactive Systems Committee: J Strother Moore, Supervisor Lorenzo Alvisi E. Allen Emerson Matt Kaufmann Jayadev Misra Amir Pnueli To Helen and Emmanuel Acknowledgments First and foremost I want to thank J Moore. J provided financial support when we first started working together, from his Admiral B.R. Inman Centennial Chair in Computing Theory. More importantly, I learned a great deal from J about being a researcher, a teacher, and a human being during our many collaborations and interactions. The impetus for my dissertation work came from discussions and col- laborations with fellow graduate students, including Kedar Namjoshi, Rob Sumners, and Jun Sawada. I met many other wonderful graduate students; the ones who helped shape my view of computing science include Richard Tre- fler, Rajeev Joshi, Vasilis Samoladas, Emilio Camahort, Yannis Smaragdakis, Nina Amla, John Gunnels, John Havlicek, Will Adams, and Robert Krug. The teachers that inspired me and taught me things I still remember include Edsger W. Dijkstra, E. Allen Emerson, Jayadev Misra, and, of course, J Moore. I thank Edsger for inviting me to join the Austin Tuesday Afternoon Club, where every week I had the pleasure of reading and analyzing papers on various topics with interesting people.
    [Show full text]
  • J Strother Moore Email: [email protected] Home Page
    J Strother Moore email: [email protected] home page: http://www.cs.utexas.edu/users/moore Employment Admiral B. R. Inman Centennial Chair Emeritus in Computing Theory, 2015–present Department Chair, 2001–2009 Department of Computer Science, University of Texas at Austin. Admiral B. R. Inman Centennial Chair of Computing Theory, 1997–2015 Department Chair, 2001–2009 Department of Computer Science, University of Texas at Austin. Chief Scientist, 1987–1996 1987–1999: Founder and Member of Board of Directors; Computational Logic, Inc., 1717 West Sixth Street, Suite 290, Austin, TX. Gottesman Family Centennial Professor, 1985–1988 Associate Professor, 1981–84; Department of Computer Sciences, University of Texas at Austin. Staff Scientist, 1981 Senior Research Mathematician, 1979–81 Research Mathematician, 1976–78 Computer Science Laboratory SRI International, Menlo Park, CA. Research Mathematician, 1973–76 Computer Science Laboratory, Xerox Palo Alto Research Center, Palo Alto, CA. Research Fellow, 1973 Programmer, 1971–72 Department of Computational Logic, University of Edinburgh, Edinburgh, Scotland. 1 Education Ph.D. Computational Logic, University of Edinburgh, Edinburgh, Scotland, 1973 (Super- visor: R. M. Burstall). Bachelor of Science, Mathematics, Massachusetts Institute of Technology, Cambridge, Mas- sachusetts, 1970. Honors • Corresponding Fellow, Royal Society of Edinburgh (RSE), 2015 • VSTTE 2012 Verification Competition, Gold Medal to Team ACL2 (with Jared Davis (Centaur Technology), Matt Kaufmann (University of Texas at Austin), and Sol Swords (Centaur Technology)), 2012 • Lecturer, Marktoberdorf International Summer School, 2008 • Fellow, National Academy of Engineering (NAE), 2007 • Fellow, Association for Computing Machinery (ACM), 2006 • ACM Software System Award (with R. S. Boyer and M. Kaufmann for the Boyer-Moore theorem prover), 2005 • Lecturer, Marktoberdorf International Summer School, 2004 • Lecturer, Marktoberdorf International Summer School, 2002 • Herbrand Award, Conference on Automated Deduction (with R.
    [Show full text]
  • History of Interactive Theorem Proving
    HISTORY OF INTERACTIVE THEOREM PROVING John Harrison, Josef Urban and Freek Wiedijk Reader: Lawrence C. Paulson 1 INTRODUCTION By interactive theorem proving, we mean some arrangement where the machine and a human user work together interactively to produce a formal proof. There is a wide spectrum of possibilities. At one extreme, the computer may act merely as a checker on a detailed formal proof produced by a human; at the other the prover may be highly automated and powerful, while nevertheless being subject to some degree of human guidance. In view of the practical limitations of pure automation, it seems today that, whether one likes it or not, interactive proof is likely to be the only way to formalize most non-trivial theorems in mathematics or computer system correctness. Almost all the earliest work on computer-assisted proof in the 1950s [Davis, 1957; Gilmore, 1960; Davis and Putnam, 1960; Wang, 1960; Prawitz et al., 1960] and 1960s [Robinson, 1965; Maslov, 1964; Loveland, 1968] was devoted to truly automated theorem proving, in the sense that the machine was supposed to prove assertions fully automatically. It is true that there was still a considerable diver- sity of methods, with some researchers pursuing AI-style approaches [Newell and Simon, 1956; Gelerntner, 1959; Bledsoe, 1984] rather than the dominant theme of automated proof search, and that the proof search programs were often highly tun- able by setting a complicated array of parameters. As described by Dick [2011], the designers of automated systems would often study the details of runs and tune the systems accordingly, leading to a continuous process of improvement and understanding that could in a very general sense be considered interactive.
    [Show full text]