Fast
Published in ACM Transactions on Programming Languages and Systems • Oct 16, 2015
NobleIDNI3P68W98R54S98
Authors:,,
Loris D’Antoni
Margus Veanes
Benjamin Livshits
Abstract
Tree automata and transducers are used in a wide range of applications in software engineering. While these formalisms are of immense practical use, they can only model finite alphabets. To overcome this problem we augment tree automata and transducers with symbolic alphabets represented as parametr...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!