{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T23:52:09Z","timestamp":1676677929680},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1007\/bf00244463","type":"journal-article","created":{"date-parts":[[2004,9,17]],"date-time":"2004-09-17T22:43:55Z","timestamp":1095461035000},"page":"181-222","source":"Crossref","is-referenced-by-count":3,"title":["Interaction with the Boyer-Moore theorem prover: A tutorial study using the arithmetic-geometric mean theorem"],"prefix":"10.1007","volume":"16","author":[{"given":"Matt","family":"Kaufmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Pecchiari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF00244463_CR1","doi-asserted-by":"crossref","unstructured":"Basin, D. and Kaufmann, M.: The Boyer-Moore prover and Nuprl: An experimental comparison, in Proc. Workshop for Basic Research Action, Logical Frameworks, Antibes, France, May 1990.","DOI":"10.1017\/CBO9780511569807.006"},{"key":"BF00244463_CR2","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/BF00243131","volume":"5","author":"W. Bevier","year":"1989","unstructured":"Bevier, W., Hunt, W.Jr., Moore, J., and Young, W.: An approach to systems verification, J. Automated Reasoning 5 (1989), 411\u2013428.","journal-title":"J. Automated Reasoning"},{"key":"BF00244463_CR3","unstructured":"Boyer, R. S. and Moore, J S.: A Computational Logic, Academic Press, 1979."},{"key":"BF00244463_CR4","doi-asserted-by":"crossref","unstructured":"Borrione, D., Pierre, L., Salem, A., and Ashraf, M.: Formal verification of VHDL descriptions in the PREVAIL environment, in IEEE Design and Test, June 1992.","DOI":"10.1109\/54.143145"},{"key":"BF00244463_CR5","volume-title":"The Correctness Problem in Computer Science","author":"R. S. Boyer","year":"1981","unstructured":"Boyer, R. S. and Moore, J S.: Metafunctions: proving them correct and using them efficiently as new proof procedures, in R. S.Boyer and J S.Moore (eds), The Correctness Problem in Computer Science, Academic Press London, 1981."},{"key":"BF00244463_CR6","unstructured":"Boyer, R. S. and Moore, J S.: A Computational Logic Handbook, Academic Press, 1988."},{"key":"BF00244463_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0898-1221(94)00215-7","volume":"29","author":"R. S. Boyer","year":"1995","unstructured":"Boyer, R. S., Kaufmann, M., and Moore, J S.: The Boyer-Moore theorem prover and its interactive enhancement, Computers and Mathematics with Applications 29 (1995), 27\u201362.","journal-title":"Computers and Mathematics with Applications"},{"key":"BF00244463_CR8","unstructured":"Bundy, A.: Talk in Challenge Problems section of Workshop on the Automation of Proof by Mathematical Induction, co-sponsored by MInd and IndUS, July 11\u201312, 1993; at AAAI-93 11th National Conf. Artificial Intelligence, Washington DC, USA."},{"key":"BF00244463_CR9","doi-asserted-by":"crossref","unstructured":"Good, D. and Young, W.: Mathematical methods for digital systems development, in S. Prehn and W. J. Toetenel (eds), VDM'91 Formal Software Development Methods, Springer-Verlag Lecture Notes in Computer Science 552 (1991), 406\u2013430.","DOI":"10.1007\/BFb0020002"},{"key":"BF00244463_CR10","volume-title":"Pascal-F Verifier User's Manual, Version 2","author":"S. Johnson","year":"1986","unstructured":"Johnson, S. and Nagle, J.: Pascal-F Verifier User's Manual, Version 2, Ford Aerospace & Communications Corporation, Palo Alto, CA, 1986."},{"key":"BF00244463_CR11","unstructured":"Kaufmann, M.: A User's Manual for an Interactive Enhancement to the Boyer-Moore Theorem Prover, Technical Report 19, Computational Logic, Inc., May 198815."},{"key":"BF00244463_CR12","unstructured":"Kaufmann, M.: Addition of Free Variables to the PC-NQTHM Interactive Enhancement of the Boyer-Moore Theorem Prover, Technical Report 42, Computational Logic, Inc., March 1990.15"},{"key":"BF00244463_CR13","doi-asserted-by":"crossref","unstructured":"Kaufmann, M.: Response to FM91 Survey of Formal Methods: Nqthm and Pc-Nqthm, Technical Report 75, Computational Logic, Inc., March 1992.15","DOI":"10.21236\/ADA258660"},{"key":"BF00244463_CR14","doi-asserted-by":"crossref","unstructured":"Kaufmann, M.: An Assistant for Reading Nqthm Proof Output, Technical Report 85, Computational Logic, Inc., November 1992.15","DOI":"10.21236\/ADA258660"},{"key":"BF00244463_CR15","unstructured":"Kaufmann, M.: An example in NQTHM: Ramsey's theorem, Internal Note 100, Computational Logic, Inc., November 1988."},{"key":"BF00244463_CR16","unstructured":"Kaufmann, M.: An instructive example for beginning users of the Boyer-Moore theorem prover, Internal Note 185, Computational Logic, Inc., April 1990."},{"key":"BF00244463_CR17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF00249356","volume":"7","author":"M. Kaufmann","year":"1991","unstructured":"Kaufmann, M.: Generalization in the presence of free variables: A mechanically-checked correctness proof for one algorithm, J. Automated Reasoning 7, (1991), 109\u2013158.","journal-title":"J. Automated Reasoning"},{"key":"BF00244463_CR18","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/BF00245295","volume":"9","author":"M. Kaufmann","year":"1992","unstructured":"Kaufmann, M.: An extension of the Boyer-Moore theorem prover to support first-order quantification, J. Automated Reasoning 9 (1992), 355\u2013372.","journal-title":"J. Automated Reasoning"},{"key":"BF00244463_CR19","unstructured":"Pierre, L.: The formal proof of sequential circuits described in CASCADE using the Boyer-Moore theorem prover, in L. Claesen (ed.), Formal VLSI Correctness Verification, North-Holland, 1990."},{"key":"BF00244463_CR20","unstructured":"Stallman, R. M.: GNU EMACS Manual, 6th edn., Free Software Foundation, March 1987."},{"key":"BF00244463_CR21","unstructured":"Kaufmann, M. and Pecchiari, P.: Interaction with the Boyer-Moore Theorem Prover: A Tutorial Study Using the Arithmetic-Geometric Mean Theorem, Technical Report 100, Computational Logic, Inc., August 1994,15 and Technical Report 9409-01, IRST, August 1994.16 (Revised June 1995.)"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00244463.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00244463\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00244463","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T05:05:20Z","timestamp":1585890320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00244463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["BF00244463"],"URL":"https:\/\/doi.org\/10.1007\/bf00244463","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}