Automata modulo theories-Reference-Cited by-同舟云学术

Automata modulo theories

Author:

D'Antoni Loris¹,Veanes Margus²

Affiliation:

1. University of Wisconsin-Madison, WI

2. Microsoft Research, Redmond, WA

Abstract

Symbolic automata better balances how automata are implemented in practice.

Funder

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

Reference38 articles.

1. Adding nesting structure to words. In Developments in Language Theory, O.H. Ibarra and Z. Dang, eds. Springer, Berlin;Alur R.;Heidelberg,2006

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lean Formalization of Extended Regular Expression Matching with Lookarounds;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09

2. Parikh’s Theorem Made Symbolic;Proceedings of the ACM on Programming Languages;2024-01-05

4. Deducing Matching Strings for Real-World Regular Expressions;Dependable Software Engineering. Theories, Tools, and Applications;2023-12-15

5. A Robust Theory of Series Parallel Graphs;Proceedings of the ACM on Programming Languages;2023-01-09