| Publication | Date of Publication | Type |
|---|
Data flow analysis of asynchronous systems using infinite abstract domains
(available as arXiv preprint) | 2021-10-18 | Paper |
The ideal approach to computing closed subsets in well-quasi-orderings
Trends in Logic | 2020-07-08 | Paper |
| Acceleration in multi-pushdown systems | 2019-09-17 | Paper |
The complexity of regular abstractions of one-counter languages
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Infinite-state energy games
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
| On bounded reachability analysis of shared memory systems | 2017-04-25 | Paper |
Verifying communicating multi-pushdown systems via split-width
Automated Technology for Verification and Analysis | 2015-12-17 | Paper |
Checking conformance for time-constrained scenario-based specifications
Theoretical Computer Science | 2015-07-24 | Paper |
Adjacent ordered multi-pushdown systems
International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
Controllers for the verification of communicating multi-pushdown systems
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Distributed timed automata with independently evolving clocks
Fundamenta Informaticae | 2014-05-14 | Paper |
Adjacent ordered multi-pushdown systems
Developments in Language Theory | 2013-06-28 | Paper |
The theory of message sequence charts
Modern Applications of Automata Theory | 2013-02-26 | Paper |
Linear-time model-checking for multithreaded programs under scope-bounding
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
MSO decidability of multi-pushdown systems via split-width
Lecture Notes in Computer Science | 2012-09-25 | Paper |
| Model checking time-constrained scenario-based specifications | 2012-08-29 | Paper |
Model checking languages of data words
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
Netcharts: bridging the gap between HMSCs and executable specifications.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
| scientific article; zbMATH DE number 5587270 (Why is no real title available?) | 2009-07-27 | Paper |
Distributed Timed Automata with Independently Evolving Clocks
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Checking Coverage for Infinite Collections of Timed Scenarios
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
Local Testing of Message Sequence Charts Is Difficult
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
| scientific article; zbMATH DE number 2085280 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 2080052 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2077124 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 1500570 (Why is no real title available?) | 2002-09-08 | Paper |
| scientific article; zbMATH DE number 1759427 (Why is no real title available?) | 2002-06-25 | Paper |
| scientific article; zbMATH DE number 1670862 (Why is no real title available?) | 2001-12-06 | Paper |
| scientific article; zbMATH DE number 1538039 (Why is no real title available?) | 2001-02-05 | Paper |
| scientific article; zbMATH DE number 1500565 (Why is no real title available?) | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1487848 (Why is no real title available?) | 2000-08-10 | Paper |
Infinitary parallelism without unbounded nondeterminism in CSP
Acta Informatica | 1994-06-02 | Paper |
