Abstract
Visibly pushdown automata have been recently introduced by Alur and Madhusudan as a subclass of pushdown automata. This class enjoys nice properties such as closure under all Boolean operations and the decidability of language inclusion. Along the same line, we introduce here visibly pushdown transducers as a subclass of pushdown transducers. We study properties of those transducers and identify subclasses with useful properties like decidability of type checking as well as preservation of regularity of visibly pushdown languages.
This research was supported by the Belgian FNRS grant 2.4530.02 of the FRFC project “Centre Fédéré en Vérification” and by the project “MoVES”, an Interuniversity Attraction Poles Programme of the Belgian Federal Government.
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.
References
Abdulla, P., Legay, A., d’Orso, J., Rezine, A.: Tree regular model checking: A simulation-based approach. J. Log. Algebr. Program. 69(1-2), 93–121 (2006)
Alur, R.: Marrying words and trees. In: PODS, pp. 233–242 (2007)
Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202–211 (2004)
Alur, R., Madhusudan, P.: Adding nesting structure to words. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 1–13. Springer, Heidelberg (2006)
Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: CAV, pp. 403–418 (2000)
Fisman, D., Pnueli, A.: Beyond regular model checking. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 156–170. Springer, Heidelberg (2001)
Maneth, S., Berlea, A., Perst, T., Seidl, H.: XML type checking with macro tree transducers. In: PODS, pp. 283–294 (2005)
Martens, W., Neven, F.: Typechecking top-down uniform unranked tree transducers. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 64–78. Springer, Heidelberg (2002)
Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. In: PODS, pp. 11–22 (2000)
Raskin, J.-F., Servais, F.: Visibly pushdown transducers. Technical Report 2008.100, Federated Center for Verification - Université Libre de Bruxelles (2008), http://www.ulb.ac.be/di/ssd/cfv/publications.html
Thomo, A., Venkatesh, S., Ying Ye, Y.: Visibly pushdown transducers for approximate validation of streaming XML. In: FoIKS, pp. 219–238 (2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raskin, JF., Servais, F. (2008). Visibly Pushdown Transducers . In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70583-3_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-70583-3_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70582-6
Online ISBN: 978-3-540-70583-3
eBook Packages: Computer ScienceComputer Science (R0)