| Publication | Date of Publication | Type |
|---|
Runtime verification of temporal properties over out-of-order data streams
(available as arXiv preprint) | 2022-07-01 | Paper |
| The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity | 2021-04-27 | Paper |
The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
(available as arXiv preprint) | 2021-04-27 | Paper |
Runtime Verification over Out-of-order Streams
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
Algorithms for monitoring real-time properties
Acta Informatica | 2018-06-26 | Paper |
Scalable offline monitoring of temporal specifications
Formal Methods in System Design | 2018-02-12 | Paper |
| Failure-aware runtime verification of distributed systems | 2017-07-13 | Paper |
Bounds on the automata size for Presburger arithmetic
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Ramsey-based inclusion checking for visibly pushdown automata
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Monitoring metric first-order temporal properties
Journal of the ACM | 2016-03-24 | Paper |
Monitoring of temporal first-order properties with aggregations
Formal Methods in System Design | 2015-10-30 | Paper |
Greedily computing associative aggregations on sliding windows
Information Processing Letters | 2014-12-09 | Paper |
The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
Theoretical Computer Science | 2014-12-02 | Paper |
Deciding safety and liveness in TPTL
Information Processing Letters | 2014-08-28 | Paper |
Ramsey goes visibly pushdown
Automata, Languages, and Programming | 2013-08-07 | Paper |
| Ehrenfeucht-Fraïssé goes automatic for real addition | 2013-03-19 | Paper |
| Runtime monitoring of metric first-order temporal properties | 2012-10-19 | Paper |
Enforceable Security Policies Revisited
Lecture Notes in Computer Science | 2012-06-29 | Paper |
A trace-based model for multiparty contracts
The Journal of Logic and Algebraic Programming | 2012-03-13 | Paper |
Alternation elimination for automata over nested words
Foundations of Software Science and Computational Structures | 2011-05-19 | Paper |
Ehrenfeucht-Fraïssé goes automatic for real addition
Information and Computation | 2010-10-22 | Paper |
On regular temporal logics with past
Acta Informatica | 2010-06-21 | Paper |
Specification languages for stutter-invariant regular properties
Automated Technology for Verification and Analysis | 2009-12-01 | Paper |
On Regular Temporal Logics with Past,
Automata, Languages and Programming | 2009-07-14 | Paper |
Don't care words with an application to the automata-based approach for real addition
Formal Methods in System Design | 2009-07-06 | Paper |
Alternation Elimination by Complementation (Extended Abstract)
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
Automated Technology for Verification and Analysis | 2008-07-03 | Paper |
Language-Based Abstraction Refinement for Hybrid System Verification
Lecture Notes in Computer Science | 2008-04-04 | Paper |
Don’t Care Words with an Application to the Automata-Based Approach for Real Addition
Computer Aided Verification | 2007-09-05 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2005-12-06 | Paper |
| scientific article; zbMATH DE number 2038747 (Why is no real title available?) | 2004-02-08 | Paper |
Decision procedures for inductive Boolean functions based on alternating automata
Theoretical Computer Science | 2003-07-30 | Paper |
Complementation of Büchi Automata Using Alternation
Lecture Notes in Computer Science | 2003-07-16 | Paper |
| scientific article; zbMATH DE number 1841832 (Why is no real title available?) | 2002-12-04 | Paper |
| scientific article; zbMATH DE number 1670776 (Why is no real title available?) | 2001-11-11 | Paper |
