| Publication | Date of Publication | Type |
|---|
| Assumption/guarantee specifications in linear-time temporal logic (extended abstract) | 2022-08-18 | Paper |
| Deciding bisimulation equivalences for a class of non-finite-state programs | 2022-08-16 | Paper |
| Towards a complete hierarchy of compositional dataflow models | 2022-08-16 | Paper |
| Combining black-box and white-box techniques for learning register automata | 2022-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5137884 | 2020-12-03 | Paper |
| Comparing Source Sets and Persistent Sets for Partial Order Reduction | 2020-02-24 | Paper |
| Stateless Model Checking for TSO and PSO | 2019-09-17 | Paper |
| Optimal dynamic partial order reduction with observers | 2019-09-16 | Paper |
| Fragment abstraction for concurrent shape analysis | 2019-09-13 | Paper |
| Undecidable verification problems for programs with unreliable channels | 2019-04-29 | Paper |
| Source Sets | 2018-05-17 | Paper |
| Stateless model checking for TSO and PSO | 2017-12-01 | Paper |
| Active learning for extended finite state machines | 2016-08-04 | Paper |
| Verification of heap manipulating programs with ordered data by extended forest automata | 2016-06-28 | Paper |
| Mediator Synthesis in a Component Algebra with Data | 2015-11-04 | Paper |
| Generating models of infinite-state communication protocols using regular inference with abstraction | 2015-03-24 | Paper |
| A succinct canonical register automaton model | 2014-12-03 | Paper |
| An algebraic theory of interface automata | 2014-08-27 | Paper |
| Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata | 2014-07-08 | Paper |
| Optimal dynamic partial order reduction | 2014-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2851066 | 2013-10-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2849548 | 2013-09-20 | Paper |
| An Integrated Specification and Verification Technique for Highly Concurrent Data Structures | 2013-08-05 | Paper |
| Using refinement calculus techniques to prove linearizability | 2013-03-22 | Paper |
| A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations | 2012-11-21 | Paper |
| Demonstrating Learning of Register Automata | 2012-06-29 | Paper |
| A Compositional Specification Theory for Component Behaviours | 2012-06-22 | Paper |
| Inferring Canonical Register Automata | 2012-06-15 | Paper |
| A Succinct Canonical Register Automaton Model | 2011-10-07 | Paper |
| Eliminating Queues from RT UML Model Representations | 2011-04-08 | Paper |
| Learning of event-recording automata | 2010-11-11 | Paper |
| Computer Aided Verification | 2010-04-20 | Paper |
| Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols | 2008-04-11 | Paper |
| Systematic Acceleration in Regular Model Checking | 2007-11-29 | Paper |
| Proving Liveness by Backwards Reachability | 2007-09-04 | Paper |
| Inference of Event-Recording Automata Using Timed Decision Trees | 2007-09-04 | Paper |
| Formal Approaches to Software Testing | 2005-12-02 | Paper |
| Fundamental Approaches to Software Engineering | 2005-09-13 | 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 |
| Simulating perfect channels with probabilistic lossy channels | 2005-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817539 | 2004-09-24 | Paper |
| Using forward reachability analysis for verification of lossy channel systems | 2004-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470509 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4439599 | 2003-12-14 | 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 |
| Testing preorders for probabilistic processes can be characterized by simulations | 2002-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536611 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779792 | 2002-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743709 | 2002-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753761 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754102 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2736352 | 2001-08-29 | Paper |
| Ensuring completeness of symbolic verification methods for infinite-state systems | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760248 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518896 | 2000-12-03 | Paper |
| A fully abstract semantics for concurrent constraint programming | 1999-03-23 | Paper |
| Undecidable verification problems for programs with unreliable channels | 1997-03-06 | Paper |
| Assumption/guarantee specifications in linear-time temporal logic | 1997-02-27 | Paper |
| Verifying programs with unreliable channels | 1996-10-01 | Paper |
| A logic for reasoning about time and reliability | 1995-02-09 | Paper |
| A fully abstract trace model for dataflow and asynchronous networks | 1994-09-13 | Paper |
| Deciding bisimulation equivalences for a class of non-finite-state programs | 1994-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028636 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359755 | 1990-01-01 | Paper |
