{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:53:54Z","timestamp":1743090834460,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319486277"},{"type":"electronic","value":"9783319486284"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-48628-4_7","type":"book-chapter","created":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T07:45:31Z","timestamp":1488354331000},"page":"151-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing Verified Machine Address Bounds During Symbolic Exploration of Code"],"prefix":"10.1007","author":[{"family":"J Strother Moore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,2]]},"reference":[{"issue":"4","key":"7_CR1","first-page":"409","volume":"5","author":"WR Bevier","year":"1989","unstructured":"Bevier, W.R., Hunt Jr., W.A., Moore, J.S., Young, W.D.: Special issue on system verification. J. Autom. Reason. 5(4), 409\u2013530 (1989)","journal-title":"J. Autom. Reason."},{"key":"7_CR2","volume-title":"A Computational Logic","author":"RS Boyer","year":"1979","unstructured":"Boyer, R.S., Moore, J.S.: A Computational Logic. Academic Press, New York (1979)"},{"key":"7_CR3","unstructured":"Boyer, R.S., Moore, J.S.: Metafunctions: Proving them correct and using them efficiently as new proof procedures. Technical Report CSL-108, SRI International (1979)"},{"key":"7_CR4","volume-title":"The Correctness Problem in Computer Science","author":"RS Boyer","year":"1981","unstructured":"Boyer, R.S., Moore, J.S.: Metafunctions: Proving them correct and using them efficiently as new proof procedures. The Correctness Problem in Computer Science. Academic Press, London (1981)"},{"key":"7_CR5","volume-title":"A Computational Logic Handbook","author":"RS Boyer","year":"1997","unstructured":"Boyer, R.S., Moore, J.S.: A Computational Logic Handbook, 2nd edn. Academic Press, New York (1997)","edition":"2"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/227595.227603","volume":"43","author":"RS Boyer","year":"1996","unstructured":"Boyer, R.S., Yu, Y.: Automated proofs of object code for a widely used microprocessor. J. ACM 43(1), 166\u2013192 (1996)","journal-title":"J. ACM"},{"key":"7_CR7","unstructured":"Brock, B., Kaufmann, M., Moore, J.S.: ACL2 theorems about commercial microprocessors. In: Srivas, M., Camilleri, A. (eds.) Formal Methods in Computer-Aided Design (FMCAD\u201996). LNCS, vol. 1166, pp. 275\u2013293. Springer, Heidelberg (1996). \n                    https:\/\/www.cs.utexas.edu\/users\/moore\/publications\/bkm96.pdf"},{"key":"7_CR8","first-page":"238","volume-title":"Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Los Angeles, California","author":"P Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Los Angeles, California, pp. 238\u2013252. ACM Press, New York (1977)"},{"key":"7_CR9","series-title":"LNCS","first-page":"21","volume-title":"European Symposium on Programming (ESOP 2005)","author":"P Cousot","year":"2005","unstructured":"Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min, A., Monniaux, D., Rival, X.: The astre analyser. In: Sagiv, M. (ed.) European Symposium on Programming (ESOP 2005). LNCS, vol. 3444, pp. 21\u201330. Springer, New York (2005)"},{"key":"7_CR10","first-page":"91","volume-title":"FMCAD\u201914: Proceedings of the 14th Conference on Formal Methods in Computer-Aided Design","author":"S Goel","year":"2014","unstructured":"Goel, S., Hunt, W.A., Kaufmann, M.: Simulation and formal verification of x86 machine-code programs that make system calls. In: Claessen, K., Kuncak, V. (eds.) FMCAD\u201914: Proceedings of the 14th Conference on Formal Methods in Computer-Aided Design, pp. 91\u201398. EPFL, Switzerland (2014)"},{"volume-title":"Computer-Aided Reasoning: ACL2 Case Studies","year":"2000","key":"7_CR11","unstructured":"Kaufmann, M., Manolios, P., Moore, J.S. (eds.): Computer-Aided Reasoning: ACL2 Case Studies. Kluwer Academic Press, Boston (2000)"},{"key":"7_CR12","volume-title":"Computer-Aided Reasoning: An Approach","author":"M Kaufmann","year":"2000","unstructured":"Kaufmann, M., Manolios, P., Moore, J.S.: Computer-Aided Reasoning: An Approach. Kluwer Academic Press, Boston (2000)"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/32.588534","volume":"23","author":"M Kaufmann","year":"1997","unstructured":"Kaufmann, M., Moore, J.S.: An industrial strength theorem prover for a logic based on common lisp. IEEE Trans. Softw. Eng. 23(4), 203\u2013213 (1997)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"7_CR14","unstructured":"Kaufmann, M., Moore, J.S.: The ACL2 home page. Department of Computer Sciences, University of Texas at Austin (2014). \n                    http:\/\/www.cs.utexas.edu\/users\/moore\/acl2\/"},{"key":"7_CR15","unstructured":"Kaufmann, M., Moore, J.S.: Well-formedness guarantees for ACL2 metafunctions and clause processors. In: Design and Implementation of Formal Tools and Systems (DIFTS) (2015)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-30142-4_14","volume-title":"17th International Conference on Theorem Proving in Higher Order Logics: TPHOLs 2004","author":"H Liu","year":"2004","unstructured":"Liu, H., Moore, J.S.: Java program verification via a JVM deep embedding in ACL2. In: Slind, K., Bunker, A., Gopalakrishnan, G. (eds.) 17th International Conference on Theorem Proving in Higher Order Logics: TPHOLs 2004. Lecture Notes in Computer Science, vol. 3223, pp. 184\u2013200. Springer, New York (2004)"},{"key":"7_CR17","unstructured":"Moore, J.S., Martinez, M.: A mechanically checked proof of the correctness of the Boyer-Moore fast string searching algorithm. In: Engineering Methods and Tools for Software Safety and Security (Proceedings of the Martoberdorf Summer School, 2008), pp. 267\u2013284. IOS Press (2009)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Slobodova, A., Davis, J., Swords, S., Hunt Jr., W.: A flexible formal verification framework for industrial scale validation. In: Singh, S. (ed.) 9th IEEE\/ACM International Conference on Formal Methods and Models for Codesign (MEMOCODE), pp. 89\u201397. IEEE (2011)","DOI":"10.1109\/MEMCOD.2011.5970515"},{"key":"7_CR19","first-page":"01803","volume-title":"Common Lisp The Language","author":"GL Steele Jr","year":"1990","unstructured":"Steele Jr., G.L.: Common Lisp The Language, 2nd edn, p. 01803. Digital Press, Burlington (1990)","edition":"2"},{"key":"7_CR20","unstructured":"Toibazarov, E.: An ACL2 proof of the correctness of the preprocessing for a variant of the Boyer-Moore fast string searching algorithm. Honors thesis, Computer Science Dept., University of Texas at Austin (2013). See \n                    www.cs.utexas.edu\/users\/moore\/publications\/toibazarov-thesis.pdf"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Computer-Aided Verification \u2013 CAV \u201993","author":"M Wilding","year":"1993","unstructured":"Wilding, M.: A mechanically verified application for a mechanically verified environment. In: Courcoubetis, C. (ed.) Computer-Aided Verification \u2013 CAV \u201993. Lecture Notes in Computer Science, vol. 697. Springer, Heidelberg (1993)"}],"container-title":["NASA Monographs in Systems and Software Engineering","Provably Correct Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48628-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T23:42:35Z","timestamp":1557963755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48628-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319486277","9783319486284"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48628-4_7","relation":{},"ISSN":["1860-0131","2197-6597"],"issn-type":[{"type":"print","value":"1860-0131"},{"type":"electronic","value":"2197-6597"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"2 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}