{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:08:43Z","timestamp":1725746923171},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319024431"},{"type":"electronic","value":"9783319024448"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-319-02444-8_30","type":"book-chapter","created":{"date-parts":[[2013,8,29]],"date-time":"2013-08-29T05:11:21Z","timestamp":1377753081000},"page":"427-441","source":"Crossref","is-referenced-by-count":7,"title":["Robustness Analysis of String Transducers"],"prefix":"10.1007","author":[{"given":"Roopsha","family":"Samanta","sequence":"first","affiliation":[]},{"given":"Jyotirmoy V.","family":"Deshmukh","sequence":"additional","affiliation":[]},{"given":"Swarat","family":"Chaudhuri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Bloem, R., Greimel, K., Henzinger, T.A., Jobstmann, B.: Synthesizing Robust Systems. In: Formal Methods in Computer Aided Design (FMCAD). pp. 85\u201392 (2009)","DOI":"10.1109\/FMCAD.2009.5351139"},{"issue":"23","key":"30_CR2","doi-asserted-by":"publisher","first-page":"3258","DOI":"10.1093\/bioinformatics\/btm402","volume":"23","author":"R.K. Bradley","year":"2007","unstructured":"Bradley, R.K., Holmes, I.: Transducers: An Emerging Probabilistic Framework for Modeling Indels on Trees. Bioinformatics\u00a023(23), 3258\u20133262 (2007)","journal-title":"Bioinformatics"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-15375-4_18","volume-title":"CONCUR 2010 - Concurrency Theory","author":"P. \u010cern\u00fd","year":"2010","unstructured":"\u010cern\u00fd, P., Henzinger, T.A., Radhakrishna, A.: Simulation Distances. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 253\u2013268. Springer, Heidelberg (2010)"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Gulwani, S., Lublinerman, R.: Continuity Analysis of Programs. In: Principles of Programming Languages (POPL), pp. 57\u201370 (2010)","DOI":"10.1145\/1707801.1706308"},{"issue":"8","key":"30_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/2240236.2240262","volume":"55","author":"Swarat Chaudhuri","year":"2012","unstructured":"Chaudhuri, S., Gulwani, S., Lublinerman, R.: Continuity and Robustness of Programs. Communications of the ACM (2012)","journal-title":"Communications of the ACM"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Gulwani, S., Lublinerman, R., Navidpour, S.: Proving Programs Robust. In: Foundations of Software Engineering (FSE), pp. 102\u2013112 (2011)","DOI":"10.1145\/2025113.2025131"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Doyen, L., Henzinger, T.A., Legay, A., Ni\u010dkovi\u0107, D.: Robustness of Sequential Circuits. In: Application of Concurrency to System Design (ACSD), pp. 77\u201384 (2010)","DOI":"10.1109\/ACSD.2010.26"},{"key":"30_CR8","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A. Academic Press, New York (1974)"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BFb0020787","volume-title":"STACS 91","author":"C. Frougny","year":"1991","unstructured":"Frougny, C., Sakarovitch, J.: Rational Relations with Bounded Delay. In: Jantzen, M., Choffrut, C. (eds.) STACS 1991. LNCS, vol.\u00a0480, pp. 50\u201363. Springer, Heidelberg (1991)"},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01744569","volume":"16","author":"E. Gurari","year":"1983","unstructured":"Gurari, E., Ibarra, O.: A Note on Finite-valued and Finitely Ambiguous Transducers. Mathematical Systems Theory\u00a016(1), 61\u201366 (1983)","journal-title":"Mathematical Systems Theory"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-10843-2_39","volume-title":"Automata, Languages and Programming","author":"E.M. Gurari","year":"1981","unstructured":"Gurari, E.M., Ibarra, O.H.: The Complexity of Decision Problems for Finite-Turn Multicounter Machines. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol.\u00a0115, pp. 495\u2013505. Springer, Heidelberg (1981)"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"1","key":"30_CR13","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-Bounded Multicounter Machines and Their Decision Problems. Journal of the ACM\u00a025(1), 116\u2013133 (1978)","journal-title":"Journal of the ACM"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44612-5_38","volume-title":"Mathematical Foundations of Computer Science 2000","author":"O.H. Ibarra","year":"2000","unstructured":"Ibarra, O.H., Su, J., Dang, Z., Bultan, T., Kemmerer, R.A.: Counter Machines: Decidable Properties and Applications to Verification Problems. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 426\u2013435. Springer, Heidelberg (2000)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Majumdar, R., Saha, I.: Symbolic Robustness Analysis. In: IEEE Real-Time Systems Symposium, pp. 355\u2013363 (2009)","DOI":"10.1109\/RTSS.2009.17"},{"key":"30_CR16","unstructured":"Majumdar, R., Render, E., Tabuada, P.: A Theory of Robust Software Synthesis. To appear in ACM Transactions on Embedded Computing Systems"},{"issue":"2","key":"30_CR17","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state Transducers in Language and Speech Processing. Computational Linguistics\u00a023(2), 269\u2013311 (1997)","journal-title":"Computational Linguistics"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-35873-9_15","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R. Samanta","year":"2013","unstructured":"Samanta, R., Deshmukh, J.V., Chaudhuri, S.: Robustness Analysis of Networked Systems. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) VMCAI 2013. LNCS, vol.\u00a07737, pp. 229\u2013247. Springer, Heidelberg (2013)"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Tabuada, P., Balkan, A., Caliskan, S.Y., Shoukry, Y., Majumdar, R.: Input-Output Robustness for Discrete Systems. In: International Conference on Embedded Software (EMSOFT) (2012)","DOI":"10.1145\/2380356.2380396"},{"issue":"1","key":"30_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M.Y. Vardi","year":"1994","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about Infinite Computations. Information and Computation\u00a0115(1), 1\u201337 (1994)","journal-title":"Information and Computation"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Veanes, M., Hooimeijer, P., Livshits, B., Molnar, D., Bj\u00f8rner, N.: Symbolic Finite State Transducers: Algorithms and Applications. In: Principles of Programming Languages (POPL), pp. 137\u2013150 (2012)","DOI":"10.1145\/2103621.2103674"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02444-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:22:52Z","timestamp":1558052572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02444-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319024431","9783319024448"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02444-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}