| Publication | Date of Publication | Type |
|---|
Verifying equilibria in finite-horizon probabilistic concurrent game systems Logical Methods in Computer Science | 2026-05-29 | Paper |
| Logical algorithmics: from theory to practice (invited talk) | 2026-02-19 | Paper |
| Engineering an \(\mathsf{LTL_f}\) synthesis tool | 2026-02-10 | Paper |
| Logical algorithmics: from relational queries to Boolean reasoning (invited talk) | 2026-02-03 | Paper |
Automata linear dynamic logic on finite traces Logical Methods in Computer Science | 2025-09-25 | Paper |
| Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata | 2025-06-26 | Paper |
| Modular model checking | 2025-03-19 | Paper |
| On the power of automata minimization in reactive synthesis | 2024-12-06 | Paper |
| Logical algorithmics: from theory to practice (invited talk) | 2024-10-08 | Paper |
Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata Theoretical Computer Science | 2024-06-26 | Paper |
| An automata-theoretic approach to linear temporal logic | 2024-06-21 | Paper |
Finite-trace and generalized-reactivity specifications in temporal synthesis Formal Methods in System Design | 2024-03-11 | Paper |
Safety and co-safety comparator automata for discounted-sum inclusion Computer Aided Verification | 2024-02-16 | Paper |
Satisfiability checking for mission-time LTL Computer Aided Verification | 2024-02-16 | Paper |
| ZDD Boolean synthesis | 2024-01-23 | Paper |
Towards a grand unification of Büchi complementation constructions Lecture Notes in Computer Science | 2023-08-10 | Paper |
A space-efficient on-the-fly algorithm for real-time model checking CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
From linear temporal logics to Büchi automata: the early and simple principle Model Checking, Synthesis, and Learning | 2023-05-26 | Paper |
On the power of finite ambiguity in Büchi complementation Information and Computation | 2023-05-19 | Paper |
On the complexity of verifying concurrent transition systems CONCUR '97: Concurrency Theory | 2023-05-17 | Paper |
Functional synthesis via input-output separation Formal Methods in System Design | 2023-05-08 | Paper |
Automata vs linear-programming discounted-sum inclusion Computer Aided Verification | 2023-05-05 | Paper |
| Congruence Relations for Büchi Automata | 2023-04-21 | Paper |
| Solving Quantum-Inspired Perfect Matching Problems via Tutte's Theorem-Based Hybrid Boolean Constraints | 2023-01-24 | Paper |
Solving Quantum-Inspired Perfect Matching Problems via Tutte's Theorem-Based Hybrid Boolean Constraints (available as arXiv preprint) | 2023-01-01 | Paper |
Satisfiability checking for mission-time \textsf{LTL} (MLTL) Information and Computation | 2022-12-08 | Paper |
| Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition | 2022-12-07 | Paper |
| Quantum-Inspired Perfect Matching under Vertex-Color Constraints | 2022-09-26 | Paper |
A nonstandard approach to the logical omniscience problem Artificial Intelligence | 2022-09-21 | Paper |
scientific article; zbMATH DE number 7577577 (Why is no real title available?) (available as arXiv preprint) | 2022-08-30 | Paper |
| scientific article; zbMATH DE number 7577577 (Why is no real title available?) | 2022-08-30 | Paper |
Sequential relational decomposition Logical Methods in Computer Science | 2022-08-02 | Paper |
| Linear temporal logic -- from infinite to finite horizon | 2022-06-22 | Paper |
Adapting behaviors via reactive synthesis (available as arXiv preprint) | 2022-03-25 | Paper |
| ProCount: weighted projected model counting with graded project-join trees | 2022-03-22 | Paper |
| On the Unreasonable Effectiveness of SAT Solvers | 2022-02-04 | Paper |
scientific article; zbMATH DE number 7455737 (Why is no real title available?) (available as arXiv preprint) | 2022-01-11 | Paper |
| scientific article; zbMATH DE number 7455737 (Why is no real title available?) | 2022-01-11 | Paper |
scientific article; zbMATH DE number 7455747 (Why is no real title available?) (available as arXiv preprint) | 2022-01-11 | Paper |
| scientific article; zbMATH DE number 7455747 (Why is no real title available?) | 2022-01-11 | Paper |
On the power of unambiguity in Büchi complementation (available as arXiv preprint) | 2022-01-11 | Paper |
| On the power of unambiguity in Büchi complementation | 2022-01-11 | Paper |
Quantum-Inspired Perfect Matching under Vertex-Color Constraints (available as arXiv preprint) | 2022-01-01 | Paper |
| Verification | 2021-11-12 | Paper |
Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions Artificial Intelligence | 2021-11-02 | Paper |
SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking Artificial Intelligence | 2021-08-16 | Paper |
On satisficing in quantitative games (available as arXiv preprint) | 2021-08-04 | Paper |
| scientific article; zbMATH DE number 7378545 (Why is no real title available?) | 2021-08-04 | Paper |
| Profile trees for Büchi word automata, with application to determinization | 2021-06-09 | Paper |
Synthesis from recursive-components libraries (available as arXiv preprint) | 2021-03-03 | Paper |
| Synthesis from recursive-components libraries | 2021-03-03 | Paper |
Sequential relational decomposition Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
| scientific article; zbMATH DE number 7297854 (Why is no real title available?) | 2021-01-19 | Paper |
scientific article; zbMATH DE number 7297884 (Why is no real title available?) (available as arXiv preprint) | 2021-01-19 | Paper |
| scientific article; zbMATH DE number 7297884 (Why is no real title available?) | 2021-01-19 | Paper |
Strategy logic with imperfect information ACM Transactions on Computational Logic | 2021-01-01 | Paper |
Knowledge-based programs Distributed Computing | 2020-12-02 | Paper |
| Flow games | 2020-11-25 | Paper |
On hashing-based approaches to approximate DNF-counting (available as arXiv preprint) | 2020-11-25 | Paper |
Infinitary logic for computer science Automata, Languages and Programming | 2019-12-04 | Paper |
Not all FPRASs are equal: demystifying FPRASs for DNF-counting Constraints | 2019-11-27 | Paper |
SAT-based explicit LTL reasoning and its application to satisfiability checking Formal Methods in System Design | 2019-11-18 | Paper |
First-order vs. second-order encodings for \textsc{ltl}\(_f\)-to-automata translation (available as arXiv preprint) | 2019-10-15 | Paper |
Alternating automata: unifying truth and validity checking for temporal logics Automated Deduction—CADE-14 | 2019-10-01 | Paper |
In memoriam Paris C. Kanellakis ACM Computing Surveys | 2019-08-09 | Paper |
Random models for evaluating efficient Büchi universality checking Logic and Its Applications | 2019-07-24 | Paper |
BDD-based Boolean functional synthesis Computer Aided Verification | 2019-05-03 | Paper |
Accelerating LTL satisfiability checking by SAT solvers Journal Of Logic And Computation | 2019-01-31 | Paper |
| Solving parity games: explicit vs symbolic | 2018-11-07 | Paper |
Comparator automata in quantitative verification (available as arXiv preprint) | 2018-07-17 | Paper |
Mode-Target Games: Reactive Synthesis for Control Applications IEEE Transactions on Automatic Control | 2018-06-27 | Paper |
An explicit transition system construction approach to LTL satisfiability checking Formal Aspects of Computing | 2018-03-29 | Paper |
Supervisory control and reactive synthesis: a comparative introduction Discrete Event Dynamic Systems | 2018-01-31 | Paper |
Knowledge-based programs Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 | 2017-09-29 | Paper |
Regular queries on graph databases Theory of Computing Systems | 2017-09-20 | Paper |
\(\mathrm{LTL}_{f}\) satisfiability checking (available as arXiv preprint) | 2017-07-18 | Paper |
| \(\mathrm{LTL}_{f}\) satisfiability checking | 2017-07-18 | Paper |
From linear time to branching time ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Solving partial-information stochastic parity games 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Regular Real Analysis 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
| Regular queries on graph databases | 2017-06-13 | Paper |
Iterative temporal motion planning for hybrid systems in partially unknown environments Proceedings of the 16th international conference on Hybrid systems: computation and control | 2017-05-16 | 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 |
Solving parity games using an automata-based algorithm Implementation and Application of Automata | 2016-11-09 | Paper |
Synthesis with rational environments Annals of Mathematics and Artificial Intelligence | 2016-09-16 | Paper |
Semantic acyclicity on graph databases SIAM Journal on Computing | 2016-08-16 | Paper |
On computing minimal independent support and its applications to sampling and counting Constraints | 2016-04-12 | Paper |
Profile trees for Büchi word automata, with application to determinization Information and Computation | 2015-12-07 | Paper |
The Complexity of Synthesis from Probabilistic Components Automata, Languages, and Programming | 2015-11-04 | Paper |
Reasoning about strategies: on the model-checking problem ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Parametric real-time reasoning Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Monotone monadic SNP and constraint satisfaction Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
From Löwenheim to PSL and SVA Lecture Notes in Computer Science | 2015-02-10 | Paper |
State of Büchi complementation Logical Methods in Computer Science | 2015-01-15 | Paper |
Proving that programs eventually do something good Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-09-12 | Paper |
Synthesis from probabilistic components Logical Methods in Computer Science | 2014-07-31 | Paper |
The complexity of partial-observation stochastic parity games with finite-memory strategies Lecture Notes in Computer Science | 2014-04-16 | Paper |
Temporal property verification as a program analysis task Formal Methods in System Design | 2014-03-28 | Paper |
Optimized temporal monitors for SystemcC Formal Methods in System Design | 2014-03-28 | Paper |
On simplification of schema mappings Journal of Computer and System Sciences | 2014-01-20 | Paper |
| SAT-based induction for temporal safety properties | 2013-09-20 | Paper |
Verification of Open Systems Interactive Computation | 2013-06-18 | Paper |
Pushdown module checking with imperfect information Information and Computation | 2013-06-06 | Paper |
Unifying Büchi complementation constructions Logical Methods in Computer Science | 2013-04-09 | Paper |
What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic Lecture Notes in Computer Science | 2012-09-25 | Paper |
Unifying Büchi complementation constructions (available as arXiv preprint) | 2012-09-18 | Paper |
| Unifying Büchi complementation constructions | 2012-09-18 | Paper |