| Regex matching with counting-set automata | 1 | 0.35 | 2020 |
| Symbolic Regex Matcher. | 1 | 0.34 | 2019 |
| Theoretical Aspects of Symbolic Automata. | 0 | 0.34 | 2018 |
| Simulation Algorithms for Symbolic Automata. | 0 | 0.34 | 2018 |
| Simulation Algorithms for Symbolic Automata (Technical Report). | 1 | 0.37 | 2018 |
| Translating C# to Branching Symbolic Transducers. | 0 | 0.34 | 2017 |
| Forward Bisimulations For Nondeterministic Symbolic Finite Automata | 3 | 0.42 | 2017 |
| Monadic Decomposition. | 3 | 0.38 | 2017 |
| Symbolic Automata Theory with Applications (Invited Talk). | 0 | 0.34 | 2017 |
| Monadic second-order logic on finite sequences. | 2 | 0.38 | 2017 |
| The Power Of Symbolic Automata And Transducers | 5 | 0.61 | 2017 |
| Minimization of Symbolic Tree Automata. | 2 | 0.38 | 2016 |
| Symbolic WS1S. | 0 | 0.34 | 2015 |
| Extended symbolic finite automata and transducers | 9 | 0.49 | 2015 |
| Equivalence Of Finite-Valued Symbolic Finite Transducers | 0 | 0.34 | 2015 |
| Program Boosting: Program Synthesis via Crowd-Sourcing | 10 | 0.59 | 2015 |
| Data-Parallel String-Manipulating Programs | 6 | 0.43 | 2015 |
| Minimization of symbolic automata | 19 | 0.71 | 2014 |
| Fast: a transducer-based language for tree manipulation | 15 | 0.67 | 2014 |
| Equivalence of extended symbolic finite transducers | 15 | 0.69 | 2013 |
| Applications of symbolic finite automata | 10 | 0.54 | 2013 |
| Operating system support for augmented reality applications | 4 | 0.51 | 2013 |
| Static Analysis Of String Encoders And Decoders | 15 | 0.63 | 2013 |
| Effectively Monadic Predicates. | 0 | 0.34 | 2013 |
| Symbolic Methods in Testing (Dagstuhl Seminar 13021). | 1 | 0.34 | 2013 |
| Alternating simulation and IOCO | 7 | 0.47 | 2012 |
| SMT-LIB Sequences and Regular Expressions. | 1 | 0.38 | 2012 |
| Beyond first-order satisfaction: fixed points, interpolants, automata and polynomials | 1 | 0.35 | 2012 |
| Symbolic finite state transducers: algorithms and applications | 57 | 1.61 | 2012 |
| Symbolic automata: the toolkit | 10 | 0.66 | 2012 |
| Symbolic tree transducers | 6 | 0.47 | 2011 |
| Fast and precise sanitizer analysis with BEK | 73 | 2.27 | 2011 |
| An evaluation of automata algorithms for string analysis | 27 | 1.03 | 2011 |
| Foundations of Finite Symbolic Tree Transducers. | 2 | 0.37 | 2011 |
| Rex: Symbolic Regular Expression Explorer | 61 | 2.30 | 2010 |
| Qex: symbolic SQL query explorer | 12 | 0.69 | 2010 |
| Symbolic Automata Constraint Solving | 15 | 0.78 | 2010 |
| Composing model programs for analysis | 1 | 0.35 | 2010 |
| Symbolic Query Exploration | 13 | 0.76 | 2009 |
| Model-Based Testing of Web Applications Using NModel | 13 | 0.91 | 2009 |
| Symbolic Bounded Model Checking of Abstract State Machines | 9 | 0.51 | 2009 |
| Input-Output Model Programs | 6 | 0.46 | 2009 |
| Symbolic bounded conformance checking of model programs | 4 | 0.41 | 2009 |
| Using Satisfiability Modulo Theories to Analyze Abstract State Machines (Abstract) | 1 | 0.35 | 2008 |
| Protocol Modeling with Model Program Composition | 5 | 0.52 | 2008 |
| An SMT Approach to Bounded Reachability Analysis of Model Programs | 19 | 0.82 | 2008 |
| On Bounded Reachability of Programs with Set Comprehensions | 5 | 0.42 | 2008 |
| Model-Based Testing of Object-Oriented Reactive Systems with Spec Explorer | 130 | 4.59 | 2008 |
| Can abstract state machines be useful in language theory? | 6 | 0.61 | 2007 |
| State Isomorphism in Model Programs with Abstract Data Structures | 2 | 0.36 | 2007 |
