| Publication | Date of Publication | Type |
|---|
| Bag containment of join-on-free queries | 2026-07-08 | Paper |
Verifying linear temporal properties on polyhedral systems: decidability and symbolic algorithms
Information and Computation | 2026-06-23 | Paper |
| Plan logic | 2026-06-12 | Paper |
| Quantifying over trees in monadic second-order logic | 2026-02-27 | Paper |
| Automata-theoretic characterisations of branching-time temporal logics | 2026-01-14 | Paper |
| From quasi-dominions to progress measures | 2025-02-03 | Paper |
Priority promotion with Parysian flair
Journal of Computer and System Sciences | 2024-10-29 | Paper |
Solving mean-payoff games via quasi dominions
Information and Computation | 2024-03-27 | Paper |
Taming strategy logic: non-recurrent fragments
Information and Computation | 2023-09-27 | Paper |
Alternating (in)dependence-friendly logic
Annals of Pure and Applied Logic | 2023-09-21 | Paper |
| Quantifying over Trees in Monadic Second-Order Logic | 2023-04-23 | Paper |
Good-for-Game QPTL: An Alternating Hodges Semantics
ACM Transactions on Computational Logic | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7445162 (Why is no real title available?)
(available as arXiv preprint) | 2021-12-14 | Paper |
| scientific article; zbMATH DE number 7445162 (Why is no real title available?) | 2021-12-14 | Paper |
| A delayed promotion policy for parity games | 2021-12-07 | Paper |
| scientific article; zbMATH DE number 7439738 (Why is no real title available?) | 2021-12-07 | Paper |
Solving mean-payoff games via quasi dominions
Tools and Algorithms for the Construction and Analysis of Systems | 2021-11-10 | Paper |
| Quantitative fairness games | 2021-02-16 | Paper |
| scientific article; zbMATH DE number 7297821 (Why is no real title available?) | 2021-01-19 | Paper |
Robust worst cases for parity games algorithms
Information and Computation | 2020-05-26 | Paper |
On the decidability of linear bounded periodic cyber-physical systems
Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control | 2019-10-22 | Paper |
Solving parity games via priority promotion
Computer Aided Verification | 2019-05-03 | Paper |
A delayed promotion policy for parity games
Information and Computation | 2018-09-27 | Paper |
Cycle detection in computation tree logic
Information and Computation | 2018-09-27 | Paper |
Practical verification of multi-agent systems against \textsc{Slk} specifications
Information and Computation | 2018-06-14 | Paper |
Solving parity games via priority promotion
Formal Methods in System Design | 2018-04-12 | Paper |
Reasoning about graded strategy quantifiers
Information and Computation | 2018-03-21 | Paper |
| Binding forms in first-order logic | 2017-08-31 | Paper |
On the boundary of behavioral strategies
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Substructure Temporal Logic
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Reasoning about strategies: on the satisfiability problem
(available as arXiv preprint) | 2017-05-08 | Paper |
Relentful strategic reasoning in alternating-time temporal logic
Journal Of Logic And Computation | 2017-01-31 | Paper |
Reasoning About Substructures and Games
ACM Transactions on Computational Logic | 2017-01-30 | Paper |
On promptness in parity games
Fundamenta Informaticae | 2016-05-11 | Paper |
Graded computation tree logic
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Reasoning about strategies: on the model-checking problem
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
A behavioral hierarchy of strategy logic
Lecture Notes in Computer Science | 2014-10-14 | Paper |
| On the Remarkable Features of Binding Forms | 2014-04-05 | Paper |
On promptness in parity games
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
Logics in computer science. A study on extensions of temporal and strategic logics
Atlantis Studies in Computing | 2013-07-29 | Paper |
What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic
Lecture Notes in Computer Science | 2012-09-25 | Paper |
| Reasoning about strategies | 2012-08-29 | Paper |
Quantitatively fair scheduling
Theoretical Computer Science | 2012-03-13 | Paper |
Exploring the boundary of half-positionality
Annals of Mathematics and Artificial Intelligence | 2012-01-13 | Paper |
Relentful strategic reasoning in alternating-time temporal logic
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-01-07 | Paper |
Graded Computation Tree Logic with Binary Coding
Computer Science Logic | 2010-09-03 | Paper |
Exploring the boundary of half positionality
Lecture Notes in Computer Science | 2010-08-24 | Paper |
Balanced Paths in Colored Graphs
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Branching-Time Temporal Logics with Minimal Model Quantifiers
Developments in Language Theory | 2009-07-07 | Paper |
