| Publication | Date of Publication | Type |
|---|
On the determinization of event-clock input-driven pushdown automata
(available as arXiv preprint) | 2022-11-11 | Paper |
| On classes of regular languages related to monotone WQOs | 2020-05-12 | Paper |
raSAT: an SMT solver for polynomial constraints
Formal Methods in System Design | 2018-01-08 | Paper |
Subtropical satisfiability
(available as arXiv preprint) | 2018-01-04 | Paper |
Confluence of layered rewrite systems
(available as arXiv preprint) | 2017-08-31 | Paper |
Unique normal form property of higher-order rewriting systems
Algebraic and Logic Programming | 2017-01-19 | Paper |
raSAT: An SMT Solver for Polynomial Constraints
Automated Reasoning | 2016-09-05 | Paper |
Non-\(E\)-overlapping, weakly shallow, and non-collapsing TRSs are confluent
Automated Deduction - CADE-25 | 2015-12-02 | Paper |
Nested timed automata with frozen clocks
Lecture Notes in Computer Science | 2015-09-14 | Paper |
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems
Proceedings of the fifth ACM SIGPLAN international conference on Functional programming | 2015-09-11 | Paper |
Iterative-free program analysis
Proceedings of the eighth ACM SIGPLAN international conference on Functional programming | 2015-07-02 | Paper |
Well-structured pushdown system: case of dense timed pushdown automata
Functional and Logic Programming | 2014-07-24 | Paper |
| Call-by-need reduction for membership conditional term rewriting systems | 2013-08-27 | Paper |
Nested timed automata
Lecture Notes in Computer Science | 2013-08-16 | Paper |
Well-structured pushdown systems
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
Information Processing Letters | 2012-03-27 | Paper |
Event-Clock Visibly Pushdown Automata
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol
Automated Technology for Verification and Analysis | 2008-11-20 | Paper |
On-the-Fly Model Checking of Fair Non-repudiation Protocols
Automated Technology for Verification and Analysis | 2008-07-03 | Paper |
Functional and Logic Programming
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Theoretical Aspects of Computing – ICTAC 2005
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Automated Deduction – CADE-20
Lecture Notes in Computer Science | 2006-11-01 | Paper |
| scientific article; zbMATH DE number 2242592 (Why is no real title available?) | 2006-01-02 | Paper |
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
Information and Computation | 2004-11-23 | Paper |
Well-quasi-orders and regular \(\omega\)-languages
Theoretical Computer Science | 2004-10-01 | Paper |
Perpetuality and uniform normalization in orthogonal rewrite systems
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1696591 (Why is no real title available?) | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1722703 (Why is no real title available?) | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1380885 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1380886 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1301091 (Why is no real title available?) | 1999-06-15 | Paper |
| scientific article; zbMATH DE number 1088031 (Why is no real title available?) | 1998-04-01 | Paper |
