Automata modulo theories
L D'Antoni, M Veanes - Communications of the ACM, 2021 - dl.acm.org
Automata modulo theories Page 1 86 COMMUNICATIONS OF THE ACM | MAY 2021 | VOL. 64
| NO. 5 review articles IMA GE B Y NA TA SH/SHUTTERS T OCK FINITE AUTOMATA ARE one …
| NO. 5 review articles IMA GE B Y NA TA SH/SHUTTERS T OCK FINITE AUTOMATA ARE one …
A survey on string constraint solving
R Amadini - ACM Computing Surveys (CSUR), 2021 - dl.acm.org
String constraint solving refers to solving combinatorial problems involving constraints over
string variables. String solving approaches have become popular over the past few years …
string variables. String solving approaches have become popular over the past few years …
The power of symbolic automata and transducers
L D'Antoni, M Veanes - … , CAV 2017, Heidelberg, Germany, July 24-28 …, 2017 - Springer
Symbolic automata and transducers extend finite automata and transducers by allowing
transitions to carry predicates and functions over rich alphabet theories, such as linear …
transitions to carry predicates and functions over rich alphabet theories, such as linear …
Regular programming for quantitative properties of data streams
We propose quantitative regular expressions (QREs) as a high-level programming
abstraction for specifying complex numerical queries over data streams in a modular way …
abstraction for specifying complex numerical queries over data streams in a modular way …
Transducers, logic and algebra for functions of finite words
E Filiot, PA Reynier - ACM SIGLOG News, 2016 - dl.acm.org
The robust theory of regular languages is based on three important pillars: computation
(automata), logic, and algebra. In this paper, we survey old and recent results on extensions …
(automata), logic, and algebra. In this paper, we survey old and recent results on extensions …
StreamQRE: modular specification and efficient evaluation of quantitative queries over streaming data
Real-time decision making in emerging IoT applications typically relies on computing
quantitative summaries of large data streams in an efficient and incremental manner. To …
quantitative summaries of large data streams in an efficient and incremental manner. To …
Regular transducer expressions for regular transformations
Functional MSO transductions, deterministic two-way transducers, as well as streaming
string transducers are all equivalent models for regular functions. In this paper, we show that …
string transducers are all equivalent models for regular functions. In this paper, we show that …
Streamable regular transductions
Motivated by real-time monitoring and data processing applications, we develop a formal
theory of quantitative queries for streaming data that can be evaluated efficiently. We …
theory of quantitative queries for streaming data that can be evaluated efficiently. We …
A symbolic decision procedure for symbolic alternating finite automata
L D'Antoni, Z Kincaid, F Wang - Electronic Notes in Theoretical Computer …, 2018 - Elsevier
Abstract We introduce Symbolic Alternating Finite Automata (s-AFA) as a succinct and
decidable model for describing sets of finite sequences over arbitrary alphabets. Boolean …
decidable model for describing sets of finite sequences over arbitrary alphabets. Boolean …
Forward bisimulations for nondeterministic symbolic finite automata
L D'Antoni, M Veanes - Tools and Algorithms for the Construction and …, 2017 - Springer
Symbolic automata allow transitions to carry predicates over rich alphabet theories, such as
linear arithmetic, and therefore extend classic automata to operate over infinite alphabets …
linear arithmetic, and therefore extend classic automata to operate over infinite alphabets …