Abstract
Many important functions over strings can be represented as finite-state string transducers. In this paper, we present an automatatheoretic technique for algorithmically verifying that such a function is robust to uncertainty. A function encoded as a transducer is defined to be robust if for each small (i.e., bounded) change to any input string, the change in the transducer’s output is proportional to the change in the input. Changes to input and output strings are quantified using weighted generalizations of the Levenshtein and Manhattan distances over strings. Our main technical contribution is a set of decision procedures based on reducing the problem of robustness verification of a transducer to the problem of checking the emptiness of a reversal-bounded counter machine. The decision procedures under the generalized Manhattan and Levenshtein distance metrics are in Pspace and Expspace, respectively. For transducers that are Mealy machines, the decision procedures under these metrics are in Nlogspace and Pspace, respectively.
This research was partially supported by CCC-CRA Computing Innovation Fellows Project, NSF Award 1162076 and NSF CAREER award 1156059.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bloem, R., Greimel, K., Henzinger, T.A., Jobstmann, B.: Synthesizing Robust Systems. In: Formal Methods in Computer Aided Design (FMCAD). pp. 85–92 (2009)
Bradley, R.K., Holmes, I.: Transducers: An Emerging Probabilistic Framework for Modeling Indels on Trees. Bioinformatics 23(23), 3258–3262 (2007)
Černý, P., Henzinger, T.A., Radhakrishna, A.: Simulation Distances. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 253–268. Springer, Heidelberg (2010)
Chaudhuri, S., Gulwani, S., Lublinerman, R.: Continuity Analysis of Programs. In: Principles of Programming Languages (POPL), pp. 57–70 (2010)
Chaudhuri, S., Gulwani, S., Lublinerman, R.: Continuity and Robustness of Programs. Communications of the ACM (2012)
Chaudhuri, S., Gulwani, S., Lublinerman, R., Navidpour, S.: Proving Programs Robust. In: Foundations of Software Engineering (FSE), pp. 102–112 (2011)
Doyen, L., Henzinger, T.A., Legay, A., Ničković, D.: Robustness of Sequential Circuits. In: Application of Concurrency to System Design (ACSD), pp. 77–84 (2010)
Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, New York (1974)
Frougny, C., Sakarovitch, J.: Rational Relations with Bounded Delay. In: Jantzen, M., Choffrut, C. (eds.) STACS 1991. LNCS, vol. 480, pp. 50–63. Springer, Heidelberg (1991)
Gurari, E., Ibarra, O.: A Note on Finite-valued and Finitely Ambiguous Transducers. Mathematical Systems Theory 16(1), 61–66 (1983)
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. 115, pp. 495–505. Springer, Heidelberg (1981)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press (1997)
Ibarra, O.H.: Reversal-Bounded Multicounter Machines and Their Decision Problems. Journal of the ACM 25(1), 116–133 (1978)
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. 1893, pp. 426–435. Springer, Heidelberg (2000)
Majumdar, R., Saha, I.: Symbolic Robustness Analysis. In: IEEE Real-Time Systems Symposium, pp. 355–363 (2009)
Majumdar, R., Render, E., Tabuada, P.: A Theory of Robust Software Synthesis. To appear in ACM Transactions on Embedded Computing Systems
Mohri, M.: Finite-state Transducers in Language and Speech Processing. Computational Linguistics 23(2), 269–311 (1997)
Samanta, R., Deshmukh, J.V., Chaudhuri, S.: Robustness Analysis of Networked Systems. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) VMCAI 2013. LNCS, vol. 7737, pp. 229–247. Springer, Heidelberg (2013)
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)
Vardi, M.Y., Wolper, P.: Reasoning about Infinite Computations. Information and Computation 115(1), 1–37 (1994)
Veanes, M., Hooimeijer, P., Livshits, B., Molnar, D., Bjørner, N.: Symbolic Finite State Transducers: Algorithms and Applications. In: Principles of Programming Languages (POPL), pp. 137–150 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Samanta, R., Deshmukh, J.V., Chaudhuri, S. (2013). Robustness Analysis of String Transducers. In: Van Hung, D., Ogawa, M. (eds) Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, vol 8172. Springer, Cham. https://doi.org/10.1007/978-3-319-02444-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-02444-8_30
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02443-1
Online ISBN: 978-3-319-02444-8
eBook Packages: Computer ScienceComputer Science (R0)