| Publication | Date of Publication | Type |
|---|
| Language inclusion algorithms as complete abstract interpretations | 2024-04-19 | Paper |
| Antichains algorithms for the inclusion problem between \(\omega\)-VPL | 2023-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6134251 | 2023-08-21 | Paper |
| Complete Abstractions for Checking Language Inclusion | 2022-12-08 | Paper |
| FORQ-Based Language Inclusion Formal Testing | 2022-12-07 | Paper |
| A language-theoretic view on network protocols | 2022-08-12 | Paper |
| Fixing the state budget: approximation of regular languages with small DFAs | 2022-08-12 | Paper |
| The Parikh Property for Weighted Context-Free Grammars | 2022-07-21 | Paper |
| A congruence-based perspective on automata minimization algorithms | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089207 | 2022-07-18 | Paper |
| A congruence-based perspective on finite tree automata | 2022-02-01 | Paper |
| Solving non-linear Horn clauses using a linear Horn clause solver | 2021-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5015278 | 2021-12-07 | Paper |
| Verification of Immediate Observation Population Protocols | 2021-08-04 | Paper |
| Sound up-to techniques and complete abstract domains | 2021-01-20 | Paper |
| Parameterized Verification of Asynchronous Shared-Memory Systems | 2018-08-02 | Paper |
| Tree dimension in verification of constrained Horn clauses | 2018-05-31 | Paper |
| Model checking population protocols | 2018-04-19 | Paper |
| Parikh image of pushdown automata | 2017-11-22 | Paper |
| Verification of Population Protocols | 2017-09-12 | Paper |
| A perfect model for bounded verification | 2017-05-16 | Paper |
| Verification of population protocols | 2017-04-20 | Paper |
| Analysis of asynchronous programs with event-based synchronization | 2016-04-26 | Paper |
| Interprocedural reachability for flat integer programs | 2015-09-29 | Paper |
| Verifying liveness for asynchronous programs | 2015-07-03 | Paper |
| Complexity of pattern-based verification for multithreaded programs | 2014-04-10 | Paper |
| Ordered counter-abstraction. Refinable subword relations for parameterized verification | 2014-03-31 | Paper |
| Underapproximation of procedure summaries for integer programs | 2013-08-05 | Paper |
| Parikh's theorem: a simple and direct automaton construction | 2013-03-28 | Paper |
| Bounded underapproximations | 2012-09-27 | Paper |
| Approximating Petri net reachability along context-free traces | 2012-08-31 | Paper |
| Complexity analysis of the backward coverability algorithm for VASS | 2011-10-07 | Paper |
| Fixed point guided abstraction refinement for alternating automata | 2010-10-07 | Paper |
| Analyzing Real-Time Event-Driven Programs | 2009-12-01 | Paper |
| Fixpoint Guided Abstraction Refinement for Alternating Automata | 2009-07-09 | Paper |
| From Many Places to Few: Automatic Abstraction Refinement for Petri Nets | 2009-03-11 | Paper |
| Fixpoint-Guided Abstraction Refinements | 2009-03-03 | Paper |
| From many places to few: automatic abstraction refinement for Petri nets | 2009-02-12 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-28 | Paper |
| Verification, Model Checking, and Abstract Interpretation | 2007-02-12 | Paper |
| Static Analysis | 2006-10-31 | Paper |
