8 citations · 15 across the 6 of their papers we have counts for
3 papers · 1 filter
Symbolic Automata: -Regularity Modulo Theories
Margus Veanes, Thomas Ball, Gabriel Ebner +1
Symbolic automata are finite state automata that support potentially infinite alphabets, such as the set of rational numbers, generally applied to regular expressions/languages ove…
Derivative Based Extended Regular Expression Matching Supporting Intersection, Complement and Lookarounds
Ian Erik Varatalu, Margus Veanes, Juhan-Peep Ernits
Regular expressions are widely used in software. Various regular expression engines support different combinations of extensions to classical regular constructs such as Kleene star…
Incremental Dead State Detection in Logarithmic Time
Caleb Stanford, Margus Veanes
Identifying live and dead states in an abstract transition system is a recurring problem in formal verification; for example, it arises in our recent work on efficiently deciding r…