| Publication | Date of Publication | Type |
|---|
| Overcoming memory weakness with unified fairness. Systematic verification of liveness in weak memory models | 2024-02-01 | Paper |
| Parameterized verification under TSO with data types | 2023-12-13 | Paper |
| Optimal stateless model checking for causal consistency | 2023-12-13 | Paper |
| Probabilistic total store ordering | 2023-08-03 | Paper |
| Regular model checking: evolution and perspectives | 2023-05-26 | Paper |
| Solving Not-Substring Constraint withFlat Abstraction | 2023-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090941 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089281 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5013882 | 2021-12-03 | Paper |
| The decidability of verification under PS 2.0 | 2021-10-18 | Paper |
| Universal safety for timed Petri nets is PSPACE-complete | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994711 | 2021-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3388706 | 2021-05-06 | Paper |
| Chain-Free String Constraints | 2020-07-20 | Paper |
| Data Multi-Pushdown Automata | 2020-05-27 | Paper |
| Comparing Source Sets and Persistent Sets for Partial Order Reduction | 2020-02-24 | Paper |
| Counter-example guided program verification | 2020-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240148 | 2019-10-24 | Paper |
| Stateless Model Checking for TSO and PSO | 2019-09-17 | Paper |
| Fragment abstraction for concurrent shape analysis | 2019-09-13 | Paper |
| Undecidable verification problems for programs with unreliable channels | 2019-04-29 | Paper |
| Perfect timed communication is hard | 2018-12-06 | Paper |
| Source Sets | 2018-05-17 | Paper |
| Data Communicating Processes with Unreliable Channels | 2018-04-23 | Paper |
| Infinite-state energy games | 2018-04-23 | Paper |
| The Benefits of Duality in Verifying Concurrent Programs under TSO | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3130550 | 2018-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3130545 | 2018-01-23 | Paper |
| Stateless model checking for TSO and PSO | 2017-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5275367 | 2017-07-13 | Paper |
| Dense-Timed Pushdown Automata | 2017-05-16 | Paper |
| Verification of Dynamic Register Automata | 2017-04-25 | Paper |
| Timed lossy channel systems | 2017-01-26 | Paper |
| Verification of heap manipulating programs with ordered data by extended forest automata | 2016-06-28 | Paper |
| Qualitative Analysis of VASS-Induced MDPs | 2016-06-10 | Paper |
| Parameterized verification of time-sensitive models of ad hoc network protocols | 2015-12-15 | Paper |
| Push-Down Automata with Gap-Order Constraints | 2015-09-30 | Paper |
| Monotonic Abstraction in Parameterized Verification | 2015-03-23 | Paper |
| Universality of R-automata with Value Copying | 2015-03-19 | Paper |
| Stochastic Parity Games on Lossy Channel Systems | 2015-01-15 | Paper |
| Budget-bounded model-checking pushdown systems | 2014-12-05 | Paper |
| All for the Price of Few | 2014-11-03 | Paper |
| Mediating for reduction (on minimizing alternating Büchi automata) | 2014-09-10 | Paper |
| A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata | 2014-07-23 | Paper |
| Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata | 2014-07-08 | Paper |
| Analysis of Message Passing Programs Using SMT-Solvers | 2014-07-08 | Paper |
| Optimal dynamic partial order reduction | 2014-04-10 | Paper |
| Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata | 2014-03-31 | Paper |
| Priced timed Petri nets | 2013-11-28 | Paper |
| Closed, open, and robust timed networks | 2013-10-02 | Paper |
| Solving Parity Games on Integer Vectors | 2013-08-12 | Paper |
| An Integrated Specification and Verification Technique for Highly Concurrent Data Structures | 2013-08-05 | Paper |
| Monotonic abstraction for programs with multiply-linked structures | 2013-07-30 | Paper |
| Mediating for reduction (on minimizing alternating Büchi automata) | 2012-10-24 | Paper |
| Counter-Example Guided Fence Insertion under TSO | 2012-06-29 | Paper |
| The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems | 2012-06-08 | Paper |
| On the Verification of Timed Ad Hoc Networks | 2011-10-07 | Paper |
| Monotonic Abstraction for Programs with Multiply-Linked Structures | 2011-10-07 | Paper |
| Advanced Ramsey-Based Büchi Automata Inclusion Testing | 2011-09-02 | Paper |
| Carrying Probabilities to the Infinite World | 2011-09-02 | Paper |
| A classification of the expressive power of well-structured transition systems | 2011-07-27 | Paper |
| AUTOMATIC VERIFICATION OF DIRECTORY-BASED CONSISTENCY PROTOCOLS WITH GRAPH CONSTRAINTS | 2011-07-14 | Paper |
| Well (and Better) Quasi-Ordered Transition Systems | 2011-01-13 | Paper |
| Sampled semantics of timed automata | 2010-09-21 | Paper |
| Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification | 2010-08-31 | Paper |
| When Simulation Meets Antichains | 2010-04-27 | Paper |
| Computer Aided Verification | 2010-04-20 | Paper |
| Forcing Monotonicity in Parameterized Verification: From Multisets to Words | 2010-01-28 | Paper |
| Approximated parameterized verification of infinite-state processes with global conditions | 2009-11-23 | Paper |
| MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS | 2009-11-19 | Paper |
| Automatic Verification of Directory-Based Consistency Protocols | 2009-11-19 | Paper |
| COMPOSED BISIMULATION FOR TREE AUTOMATA | 2009-08-21 | Paper |
| On the Qualitative Analysis of Conformon P Systems | 2009-07-28 | Paper |
| A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations | 2009-04-02 | Paper |
| Minimal Cost Reachability/Coverability in Priced Timed Petri Nets | 2009-03-31 | Paper |
| Comparing the Expressive Power of Well-Structured Transition Systems | 2009-03-05 | Paper |
| Composed Bisimulation for Tree Automata | 2009-02-12 | Paper |
| Universality analysis for one-clock timed automata | 2009-02-10 | Paper |
| Monotonic Abstraction in Action | 2009-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5503431 | 2009-01-15 | Paper |
| R-Automata | 2008-11-25 | Paper |
| Eager Markov Chains | 2008-09-04 | Paper |
| Monotonic Abstraction for Programs with Dynamic Memory Heaps | 2008-07-15 | Paper |
| Zone-Based Universality Analysis for Single-Clock Timed Automata | 2008-07-01 | Paper |
| BISIMULATION MINIMIZATION OF TREE AUTOMATA | 2008-05-20 | Paper |
| Computing Simulations over Tree Automata | 2008-04-11 | Paper |
| Stochastic Games with Lossy Channels | 2008-04-11 | Paper |
| Handling Parameterized Systems with Non-atomic Global Conditions | 2008-04-04 | Paper |
| Decisive Markov Chains | 2008-04-01 | Paper |
| Monotonic and Downward Closed Games | 2008-03-12 | Paper |
| Parameterized Verification of Infinite-State Processes with Global Conditions | 2007-11-29 | Paper |
| Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness | 2007-10-11 | Paper |
| Sampled Universality of Timed Automata | 2007-09-07 | Paper |
| Bisimulation Minimization of Tree Automata | 2007-09-06 | Paper |
| Proving Liveness by Backwards Reachability | 2007-09-04 | Paper |
| Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems) | 2007-09-03 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| Formal Modeling and Analysis of Timed Systems | 2006-11-14 | Paper |
| Implementation and Application of Automata | 2006-11-13 | Paper |
| Tree regular model checking: a simulation-based approach | 2006-08-17 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Verification of probabilistic systems with faulty communication | 2005-11-22 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2005-11-10 | Paper |
| Computer Aided Verification | 2005-08-25 | Paper |
| CONCUR 2004 - Concurrency Theory | 2005-08-23 | Paper |
| Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems | 2005-08-19 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Simulating perfect channels with probabilistic lossy channels | 2005-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817539 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817540 | 2004-09-24 | Paper |
| Using forward reachability analysis for verification of lossy channel systems | 2004-09-09 | Paper |
| SAT-solving the coverability problem for Petri nets | 2004-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417850 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484482 | 2003-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4804925 | 2003-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791827 | 2003-02-03 | Paper |
| Model checking of systems with many identical timed processes | 2003-01-21 | Paper |
| Algorithmic analysis of programs with well quasi-ordered domains. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536611 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535172 | 2002-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535053 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754109 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729082 | 2001-11-06 | Paper |
| Ensuring completeness of symbolic verification methods for infinite-state systems | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251918 | 1999-06-17 | Paper |
| Undecidable verification problems for programs with unreliable channels | 1997-03-06 | Paper |
| Verifying programs with unreliable channels | 1996-10-01 | Paper |
| Automatic verification of a class of systolic circuits | 1992-09-26 | Paper |
