Affiliation:
1. University of Pennsylvania, Philadelphia, PA
2. Microsoft Research, Redmond, WA
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 parametric theories. Admitting infinite alphabets makes these models more general and succinct than their classic counterparts. Despite this, we show how the main operations, such as composition and language equivalence, remain computable given a decision procedure for the alphabet theory. We introduce a high-level language called F
ast
that acts as a front-end for the preceding formalisms.
Funder
NSF Expeditions in Computing
Publisher
Association for Computing Machinery (ACM)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits;Proceedings of the ACM on Programming Languages;2023-06-06
2. Automata modulo theories;Communications of the ACM;2021-05
3. Postcondition-preserving fusion of postorder tree transformations;Proceedings of the 29th International Conference on Compiler Construction;2020-02-22
4. A Symbolic Decision Procedure for Symbolic Alternating Finite Automata;Electronic Notes in Theoretical Computer Science;2018-04
5. Streaming Tree Transducers;Journal of the ACM;2017-10-15