| Publication | Date of Publication | Type |
|---|
| Overcoming memory weakness with unified fairness. Systematic verification of liveness in weak memory models | 2024-02-01 | Paper |
| Optimal stateless model checking for causal consistency | 2023-12-13 | Paper |
| Probabilistic total store ordering | 2023-08-03 | Paper |
| Solving Not-Substring Constraint withFlat Abstraction | 2023-03-29 | Paper |
| Boosting Sequential Consistency Checking Using Saturation | 2022-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090941 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089281 | 2022-07-18 | Paper |
| The decidability of verification under PS 2.0 | 2021-10-18 | Paper |
| Verifying quantitative temporal properties of procedural programs | 2021-08-04 | Paper |
| Universal safety for timed Petri nets is PSPACE-complete | 2021-08-04 | Paper |
| Zenoness for timed pushdown automata | 2021-06-21 | Paper |
| Verification of asynchronous programs with nested locks | 2020-11-25 | Paper |
| Chain-free string constraints | 2020-07-20 | Paper |
| Data multi-pushdown automata | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111264 | 2020-05-26 | Paper |
| Counter-example guided program verification | 2020-01-03 | Paper |
| Acceleration in multi-pushdown systems | 2019-09-17 | Paper |
| Stateless model checking for TSO and PSO | 2019-09-17 | Paper |
| Perfect timed communication is hard | 2018-12-06 | Paper |
| Emptiness of ordered multi-pushdown automata is 2ETIME-complete | 2018-05-14 | Paper |
| The complexity of regular abstractions of one-counter languages | 2018-04-23 | Paper |
| Infinite-state energy games | 2018-04-23 | Paper |
| Data communicating processes with unreliable channels | 2018-04-23 | Paper |
| The benefits of duality in verifying concurrent programs under TSO | 2018-03-21 | Paper |
| A load-buffer semantics for total store ordering | 2018-01-23 | Paper |
| Mending fences with self-invalidation and self-downgrade | 2018-01-23 | Paper |
| Stateless model checking for TSO and PSO | 2017-12-01 | Paper |
| What's decidable about availability languages? | 2017-07-13 | Paper |
| Dense-timed pushdown automata | 2017-05-16 | Paper |
| On bounded reachability analysis of shared memory systems | 2017-04-25 | Paper |
| Verification of dynamic register automata | 2017-04-25 | Paper |
| Timed lossy channel systems | 2017-01-26 | Paper |
| Push-down automata with gap-order constraints | 2015-09-30 | Paper |
| On the verification problem for weak memory models | 2015-06-11 | Paper |
| Adjacent ordered multi-pushdown systems | 2015-04-23 | Paper |
| Budget-bounded model-checking pushdown systems | 2014-12-05 | Paper |
| Context-bounded analysis of TSO systems | 2014-07-24 | Paper |
| Analysis of message passing programs using SMT-solvers | 2014-07-08 | Paper |
| Computing optimal reachability costs in priced dense-timed pushdown automata | 2014-03-31 | Paper |
| Adjacent ordered multi-pushdown systems | 2013-06-28 | Paper |
| Linear-time model-checking for multithreaded programs under scope-bounding | 2012-11-21 | Paper |
| Analyzing Asynchronous Programs with Preemption | 2012-10-19 | Paper |
| Model-checking of ordered multi-pushdown automata | 2012-09-25 | Paper |
| Approximating Petri net reachability along context-free traces | 2012-08-31 | Paper |
| Global model checking of ordered multi-pushdown systems | 2012-08-29 | Paper |
| Counter-Example Guided Fence Insertion under TSO | 2012-06-29 | Paper |
| What's decidable about weak memory models? | 2012-06-22 | Paper |
| The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems | 2012-06-08 | Paper |
| Context-bounded analysis for concurrent programs with dynamic creation of threads | 2012-04-02 | Paper |
| ON YEN'S PATH LOGIC FOR PETRI NETS | 2011-07-14 | Paper |
| Verifying parallel programs with dynamic communication structures | 2010-10-07 | Paper |
| From multi to single stack automata | 2010-08-31 | Paper |
| On Yen’s Path Logic for Petri Nets | 2009-11-19 | Paper |
| Verifying Parallel Programs with Dynamic Communication Structures | 2009-07-09 | Paper |
| Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads | 2009-03-31 | Paper |
| On the Reachability Analysis of Acyclic Networks of Pushdown Systems | 2008-11-25 | Paper |
| Emptiness of Multi-pushdown Automata Is 2ETIME-Complete | 2008-10-30 | Paper |
