| Publication | Date of Publication | Type |
|---|
| Taming large bounds in synthesis from bounded-liveness specifications | 2024-04-05 | Paper |
Synthesizing approximate implementations for unrealizable specifications
Computer Aided Verification | 2024-02-16 | Paper |
Maximum realizability for linear temporal logic specifications
Automated Technology for Verification and Analysis | 2023-07-28 | Paper |
Maximum realizability for linear temporal logic specifications
Automated Technology for Verification and Analysis | 2023-07-28 | Paper |
Probabilistic Hyperproperties of Markov Decision Processes
1517.68228 | 2022-12-22 | Paper |
scientific article; zbMATH DE number 7471703 (Why is no real title available?)
(available as arXiv preprint) | 2022-02-09 | Paper |
| scientific article; zbMATH DE number 7471703 (Why is no real title available?) | 2022-02-09 | Paper |
| Reachability analysis of reversal-bounded automata on series-parallel graphs | 2021-12-03 | Paper |
| Lossy channel games under incomplete information | 2021-05-06 | Paper |
Lossy channel games under incomplete information
(available as arXiv preprint) | 2021-05-06 | Paper |
Approximate automata for omega-regular languages
Automated Technology for Verification and Analysis | 2020-07-20 | Paper |
Approximate automata for omega-regular languages
Automated Technology for Verification and Analysis | 2020-07-20 | Paper |
The robot routing problem for collecting aggregate stochastic rewards
(available as arXiv preprint) | 2020-05-27 | Paper |
Reactive synthesis with maximum realizability of linear temporal logic specifications
Acta Informatica | 2020-03-06 | Paper |
Reactive synthesis with maximum realizability of linear temporal logic specifications
Acta Informatica | 2020-03-06 | Paper |
Approximate Counting in SMT and Value Estimation for Probabilistic Programs
Tools and Algorithms for the Construction and Analysis of Systems | 2019-09-17 | Paper |
| Probabilistic \(\mathrm{CTL}^*\): the deductive way | 2019-09-17 | Paper |
| Symbolic model checking for factored probabilistic models | 2018-10-25 | Paper |
Reachability analysis of reversal-bounded automata on series-parallel graphs
Acta Informatica | 2018-04-10 | Paper |
Approximate counting in SMT and value estimation for probabilistic programs
Acta Informatica | 2017-12-01 | Paper |
Approximate counting in SMT and value estimation for probabilistic programs
Acta Informatica | 2017-12-01 | Paper |
Counterexample-guided synthesis of observation predicates
Lecture Notes in Computer Science | 2012-11-21 | Paper |
| Abstraction refinement for games with incomplete information | 2012-10-19 | Paper |
Model Checking Information Flow in Reactive Systems
Lecture Notes in Computer Science | 2012-06-15 | Paper |
Synthesis of fault-tolerant distributed systems
Automated Technology for Verification and Analysis | 2009-12-01 | Paper |
Is Lazy Abstraction a Decision Procedure for Broadcast Protocols?
Lecture Notes in Computer Science | 2008-04-04 | Paper |
