{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:01:01Z","timestamp":1725858061254},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319401881"},{"type":"electronic","value":"9783319401898"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40189-8_22","type":"book-chapter","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T15:34:07Z","timestamp":1465832047000},"page":"215-224","source":"Crossref","is-referenced-by-count":4,"title":["Axiomatizing Analog Algorithms"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Bournez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nachum","family":"Dershowitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"N\u00e9ron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers; NP completeness, recursive functions and universal machines. Bull. Am. Math. Soc. 21, 1\u201346 (1989)","journal-title":"Bull. Am. Math. Soc."},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-540-78127-1_12","volume-title":"Pillars of Computer Science","author":"U Boker","year":"2008","unstructured":"Boker, U., Dershowitz, N.: The Church-Turing thesis over arbitrary domains. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol. 4800, pp. 199\u2013229. Springer, Heidelberg (2008)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-3-642-15025-8_7","volume-title":"Fields of Logic and Computation","author":"U Boker","year":"2010","unstructured":"Boker, U., Dershowitz, N.: Three paths to effectiveness. In: Blass, A., Dershowitz, N., Reisig, W. (eds.) Fields of Logic and Computation. LNCS, vol. 6300, pp. 135\u2013146. Springer, Heidelberg (2010)"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/978-0-387-68546-5_17","volume-title":"New Computational Paradigms","author":"O Bournez","year":"2008","unstructured":"Bournez, O., Campagnolo, M.L.: A survey on continuous time computations. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) Changing Conceptions of What is Computable, pp. 383\u2013423. Springer, New York (2008)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/978-3-642-29952-0_49","volume-title":"Theory and Applications of Models of Computation","author":"O Bournez","year":"2012","unstructured":"Bournez, O., Dershowitz, N., Falkovich, E.: Towards an axiomatization of simple analog algorithms. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol. 7287, pp. 525\u2013536. Springer, Heidelberg (2012)"},{"key":"22_CR6","unstructured":"Bournez, O., Dershowitz, N., N\u00e9ron, P.: Axiomatizing analog algorithms. ArXiv e-prints (2016). http:\/\/arxiv.org\/abs\/1604.04295"},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0016-0032(31)90616-9","volume":"212","author":"V Bush","year":"1931","unstructured":"Bush, V.: The differential analyser. J. Franklin Inst. 212, 447\u2013488 (1931)","journal-title":"J. Franklin Inst."},{"key":"22_CR8","unstructured":"Cohen, J., Slissenko, A.: On implementations of instantaneous actions real-time ASM by ASM with delays. In: Proceedings of 12th International Workshop on Abstract State Machines, Universit\u00e9 de Paris, vol. 12, pp. 387\u2013396 (2005)"},{"key":"22_CR9","unstructured":"Cohen, J., Slissenko, A.: Implementation of sturdy real-time abstract state machines by machines with delays. In: Proceedings of 6th International Conference on Computer Science and Information Technology, National Academy of Science of Armenia (2007)"},{"key":"22_CR10","doi-asserted-by":"crossref","first-page":"299","DOI":"10.2178\/bsl\/1231081370","volume":"14","author":"N Dershowitz","year":"2008","unstructured":"Dershowitz, N., Gurevich, Y.: A natural axiomatization of computability and proof of Church\u2019s Thesis. Bull. Symbolic Logic 14, 299\u2013350 (2008)","journal-title":"Bull. Symbolic Logic"},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.jlamp.2014.11.001","volume":"84","author":"MQ Fu","year":"2015","unstructured":"Fu, M.Q., Zucker, J.: Models of computation for partial functions on the reals. J. Log. Algebraic Methods Program. 84, 218\u2013237 (2015)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"1375","DOI":"10.1016\/j.amc.2009.04.055","volume":"215","author":"DS Gra\u00e7a","year":"2009","unstructured":"Gra\u00e7a, D.S., Buescu, J., Campagnolo, M.L.: Computational bounds on polynomial differential equations. Appl. Math. Comput. 215, 1375\u20131385 (2009)","journal-title":"Appl. Math. Comput."},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/S0885-064X(03)00034-7","volume":"19","author":"DS Gra\u00e7a","year":"2003","unstructured":"Gra\u00e7a, D.S., Costa, J.F.: Analog computers and recursive functions over the reals. J. Complex. 19, 644\u2013664 (2003)","journal-title":"J. Complex."},{"key":"22_CR14","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/343369.343384","volume":"1","author":"Y Gurevich","year":"2000","unstructured":"Gurevich, Y.: Sequential abstract-state machines capture sequential algorithms. ACM Trans. Comput. Log. 1, 77\u2013111 (2000)","journal-title":"ACM Trans. Comput. Log."},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/978-3-642-31424-7_34","volume-title":"Computer Aided Verification","author":"I Hasuo","year":"2012","unstructured":"Hasuo, I., Suenaga, K.: Exercises in nonstandard static analysis of hybrid systems. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 462\u2013478. Springer, Heidelberg (2012)"},{"key":"22_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/MAHC.1996.539910","volume":"18","author":"JM Nyce","year":"1996","unstructured":"Nyce, J.M.: Guest editor\u2019s introduction. IEEE Ann. Hist. Comput. 18, 3\u20134 (1996)","journal-title":"IEEE Ann. Hist. Comput."},{"key":"22_CR17","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10817-008-9103-8","volume":"41","author":"A Platzer","year":"2008","unstructured":"Platzer, A.: Differential dynamic logic for hybrid systems. J. Autom. Reasoning 41, 143\u2013189 (2008)","journal-title":"J. Autom. Reasoning"},{"key":"22_CR18","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s00236-002-0106-3","volume":"39","author":"W Reisig","year":"2003","unstructured":"Reisig, W.: On Gurevich\u2019s theorem on sequential algorithms. Acta Informatica 39, 273\u2013305 (2003)","journal-title":"Acta Informatica"},{"key":"22_CR19","unstructured":"Rust, H.: Hybrid abstract state machines: using the hyperreals for describing continuous changes in a discrete notation. In: International Workshop on Abstract State Machines, Swiss Federal Institute of Technology, pp. 341\u2013356 (2000)"},{"key":"22_CR20","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/sapm1941201337","volume":"20","author":"CE Shannon","year":"1941","unstructured":"Shannon, C.E.: Mathematical theory of the differential analyser. J. Math. Phys. 20, 337\u2013354 (1941)","journal-title":"J. Math. Phys."},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/978-3-642-22012-8_31","volume-title":"Automata, Languages and Programming","author":"K Suenaga","year":"2011","unstructured":"Suenaga, K., Hasuo, I.: Programming with infinitesimals: a While-language for hybrid system modeling. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 392\u2013403. Springer, Heidelberg (2011)"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/11494645_63","volume-title":"New Computational Paradigms","author":"JV Tucker","year":"2005","unstructured":"Tucker, J.V., Zucker, J.I.: A network model of analogue computation over metric algebras. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 515\u2013529. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Pursuit of the Universal"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40189-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T15:57:14Z","timestamp":1718639834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40189-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319401881","9783319401898"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40189-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}