@inproceedings{veanes2011symbolic,
author = {Veanes, Margus and Bjørner, Nikolaj},
title = {Symbolic Tree Transducers},
series = {LNCS},
booktitle = {Ershov Informatics Conference (PSI'11)},
year = {2011},
month = {January},
abstract = {Symbolic transducers are useful in the context of web security as they form the foundation for sanitization of potentially malicious data. We define Symbolic Tree Transducers as a generalization of Regular Transducers as finite state input-output tree automata with logical constraints over a parametric background theory. We examine key closure properties of Symbolic Tree Transducers and we develop a composition algorithm and an equivalence decision procedure for linear single-valued transducers.},
publisher = {Springer},
url = {http://approjects.co.za/?big=en-us/research/publication/symbolic-tree-transducers/},
pages = {371-387},
volume = {7162},
edition = {Ershov Informatics Conference (PSI'11)},
}