8 citations · 15 across the 6 of their papers we have counts for
6 papers
RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement and Lookarounds
Ian Erik Varatalu, Margus Veanes, Juhan-Peep Ernits
We present a tool and theory RE# for regular expression matching that is built on symbolic derivatives, does not use backtracking, and, in addition to the classical operators, also…
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…
Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report)
Lukáš Holík, Ondřej Lengál, Olli Saarikivi +3
We propose an efficient algorithm for determinising counting automata (CAs), i.e., finite automata extended with bounded counters. The algorithm avoids unfolding counters into cont…
Simulation Algorithms for Symbolic Automata (Technical Report)
Lukáš Holík, Ondřej Lengál, Juraj Síč +2
We investigate means of efficient computation of the simulation relation over symbolic finite automata (SFAs), i.e., finite automata with transitions labeled by predicates over alp…