4 citations · 5 across the 4 of their papers we have counts for
4 papers
Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
Shuanglong Kan, Anthony W. Lin
Finite Automata (FAs) are fundamental components in the domains of programming languages. For instance, regular expressions, which are pivotal in languages such as JavaScript and P…
Regular Abstractions for Array Systems
Chih-Duo Hong, Anthony W. Lin
Verifying safety and liveness over array systems is a highly challenging problem. Array systems naturally capture parameterized systems such as distributed protocols with an unboun…
Ramsey Quantifiers in Linear Arithmetics
Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin +1
We study Satisfiability Modulo Theories (SMT) enriched with the so-called Ramsey quantifiers, which assert the existence of cliques (complete graphs) in the graph induced by some f…
Parikh's Theorem Made Symbolic
Matthew Hague, Artur Jeż, Anthony W. Lin
Parikh's Theorem is a fundamental result in automata theory with numerous applications in computer science: software verification (e.g. infinite-state verification, string constrai…