| A Congruence-Based Perspective on Finite Tree Automata | 0 | 0.34 | 2021 |
| A Quasiorder-Based Perspective on Residual Automata. | 0 | 0.34 | 2020 |
| CacheQuery: Learning Replacement Policies from Hardware Caches | 2 | 0.39 | 2020 |
| Complete Abstractions for Checking Language Inclusion | 0 | 0.34 | 2019 |
| Language Inclusion Algorithms as Complete Abstract Interpretations. | 0 | 0.34 | 2019 |
| A Congruence-based Perspective on Automata Minimization Algorithms. | 0 | 0.34 | 2019 |
| Regular Expression Search On Compressed Text | 0 | 0.34 | 2019 |
| Tree dimension in verification of constrained Horn clauses. | 0 | 0.34 | 2018 |
| The Parikh Property for Weighted Context-Free Grammars. | 0 | 0.34 | 2018 |
| Sound up-to techniques and Complete abstract domains. | 1 | 0.35 | 2018 |
| Verification of Immediate Observation Population Protocols. | 1 | 0.39 | 2018 |
| Verification of Population Protocols. | 8 | 0.49 | 2017 |
| Fixing the State Budget: Approximation of Regular Languages with Small DFAs. | 1 | 0.35 | 2017 |
| A Language-theoretic View on Network Protocols. | 0 | 0.34 | 2017 |
| Parikh Image of Pushdown Automata. | 0 | 0.34 | 2017 |
| Model Checking Population Protocols. | 0 | 0.34 | 2016 |
| Solving Non-Linear Horn Clauses Using A Linear Horn Clause Solver | 2 | 0.36 | 2016 |
| Decomposition By Tree Dimension In Horn Clause Verification | 0 | 0.34 | 2015 |
| Interprocedural Reachability for Flat Integer Programs. | 0 | 0.34 | 2015 |
| Model Checking Parameterized Asynchronous Shared-Memory Systems | 2 | 0.37 | 2015 |
| From non-zenoness verification to termination | 0 | 0.34 | 2015 |
| Ordered Counter-Abstraction - Refinable Subword Relations for Parameterized Verification. | 1 | 0.35 | 2014 |
| Generating Bounded Languages Using Bounded Control Sets. | 0 | 0.34 | 2014 |
| Pattern-Based Verification for Multithreaded Programs | 5 | 0.46 | 2014 |
| Proving termination starting from the end | 19 | 0.69 | 2013 |
| Parameterized verification of asynchronous shared-memory systems | 15 | 0.62 | 2013 |
| Underapproximation of procedure summaries for integer programs | 4 | 0.43 | 2013 |
| Bounded underapproximations | 5 | 0.42 | 2012 |
| A Perfect Model for Bounded Verification | 1 | 0.37 | 2012 |
| Complexity analysis of the backward coverability algorithm for VASS | 14 | 0.60 | 2011 |
| Parikh's theorem: A simple and direct automaton construction | 30 | 1.04 | 2011 |
| Approximating Petri Net Reachability Along Context-free Traces | 0 | 0.34 | 2011 |
| Fixed point guided abstraction refinement for alternating automata | 1 | 0.36 | 2010 |
| Parikh's Theorem: A simple and direct construction | 2 | 0.40 | 2010 |
| Algorithmic verification of asynchronous programs | 27 | 0.95 | 2010 |
| Analyzing Real-Time Event-Driven Programs | 4 | 0.45 | 2009 |
| Fixpoint Guided Abstraction Refinement for Alternating Automata | 1 | 0.36 | 2009 |
| Le problème de couverture pour les réseaux de Petri: résultats classiques et développements récents | 1 | 0.35 | 2009 |
| Parikh-Equivalent Bounded Underapproximations | 2 | 0.38 | 2008 |
| Fixpoint-guided abstraction refinements | 26 | 0.92 | 2007 |
| A complete abstract interpretation framework for coverability properties of WSTS | 20 | 0.87 | 2006 |
| Automatic Verification of Time Sensitive Cryptographic Protocols | 27 | 0.97 | 2004 |
| SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis | 20 | 1.20 | 2003 |
