{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:06:07Z","timestamp":1725635167166},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2008,7,2]],"date-time":"2008-07-02T00:00:00Z","timestamp":1214956800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s00236-008-0075-2","type":"journal-article","created":{"date-parts":[[2008,7,1]],"date-time":"2008-07-01T15:00:49Z","timestamp":1214924449000},"page":"403-439","source":"Crossref","is-referenced-by-count":45,"title":["Inference rules for proving the equivalence of recursive procedures"],"prefix":"10.1007","volume":"45","author":[{"given":"Benny","family":"Godlin","sequence":"first","affiliation":[]},{"given":"Ofer","family":"Strichman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,7,2]]},"reference":[{"key":"75_CR1","doi-asserted-by":"crossref","unstructured":"Arons, T., Elster, E., Fix, L., Mador-Haim, S., Mishaeli, M., Shalev, J., Singerman, E., Tiemeyer, A., Vardi, M.Y., Zuck, L.D.: Formal verification of backward compatibility of microcode. In: Etessami, K., Rajamani, S. (eds.) Proceedings of 17th International Conference on Computer Aided Verification (CAV\u201905), Lecture Notes in Computer Science, vol. 3576. Springer, Edinburgh (2005)","DOI":"10.1007\/11513988_20"},{"key":"75_CR2","unstructured":"Bouge, L., Cachera, D.: A logical framework to prove Properties of alpha programs (revised version). Tech. Rep. RR-3177 (1997). citeseer.ist.psu.edu\/bouge97logical.html"},{"issue":"4","key":"75_CR3","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"Cytron R., Ferrante J., Rosen B.K., Wegman M.N., Zadeck F.K.: Efficiently computing static single assignment form and the control dependence graph. ACM Trans Program Lang Syst 13(4), 451\u2013490 (1991)","journal-title":"ACM Trans Program Lang Syst"},{"key":"75_CR4","unstructured":"Fowler, M.: http:\/\/www.refactoring.com"},{"key":"75_CR5","volume-title":"Refactoring: improving the design of existing code","author":"M. Fowler","year":"1999","unstructured":"Fowler M.: Refactoring: improving the design of existing code. Addison-Wesley, Menlo Park (1999)"},{"key":"75_CR6","volume-title":"Program Verification","author":"N. Francez","year":"1993","unstructured":"Francez N.: Program Verification. Addison-Wesley, Wokingham (1993)"},{"key":"75_CR7","doi-asserted-by":"crossref","unstructured":"Hoare, C.: Prcedures and parameters: an axiomatic approach. In: Proceedings of Symposium on Semantics of Algorithmic Languages, vol. 188, pp.102\u2013116. Springer, New York (1971)","DOI":"10.1007\/BFb0059696"},{"key":"75_CR8","doi-asserted-by":"crossref","unstructured":"Kroening, D., Clarke, E., Yorav, K.: Behavioral consistency of C and Verilog programs using bounded model checking. In: Proceedings of DAC 2003, pp. 368\u2013371. ACM Press, New York (2003)","DOI":"10.21236\/ADA461052"},{"issue":"3","key":"75_CR9","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/S0022-0000(70)80022-8","volume":"4","author":"D. Luckham","year":"1970","unstructured":"Luckham D., Park D., Paterson M.: On formalized computer programs. J. Comput. Syst. Sci. 4(3), 220\u2013249 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"75_CR10","doi-asserted-by":"crossref","unstructured":"Manolios, P.: Computer-Aided Reasoning: ACL2 Case Studies, Chap. Mu-Calculus Model-Checking, pp. 93\u2013111. Kluwer Academic Publishers, Dordrecht (2000)","DOI":"10.1007\/978-1-4757-3188-0_7"},{"key":"75_CR11","unstructured":"Manolios, P., Kaufmann, M.: Adding a total order to acl2. In: The Third International Workshop on the ACL2 Theorem Prover (2002)"},{"key":"75_CR12","doi-asserted-by":"crossref","unstructured":"Manolios, P., Vroon, D.: Ordinal arithmetic: algorithms and mechanization. J Autom Reason (2006) (to appear)","DOI":"10.1007\/s10817-005-9023-9"},{"key":"75_CR13","unstructured":"Pratt, T.W.: Kernel equivalence of programs and proving kernel equivalence and correctness by test cases. International Joint Conference on Artificial Intelligence (1971)"},{"issue":"7","key":"75_CR14","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/359545.359570","volume":"21","author":"R. Shostak","year":"1978","unstructured":"Shostak R.: An algorithm for reasoning about equality. Commun ACM 21(7), 583\u2013585 (1978)","journal-title":"Commun ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0075-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-008-0075-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0075-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:54Z","timestamp":1558705314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-008-0075-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,2]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["75"],"URL":"https:\/\/doi.org\/10.1007\/s00236-008-0075-2","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,2]]}}}