| Publication | Date of Publication | Type |
|---|
| Adapting to the behavior of environments with bounded memory | 2024-12-06 | Paper |
| Natural colors of Infinite words | 2024-09-12 | Paper |
| How hard is finding shortest counter-example lassos in model checking? | 2024-03-14 | Paper |
Exact Synthesis of ESOP Forms
Advanced Boolean Techniques | 2024-01-23 | Paper |
A fragment of linear temporal logic for universal very weak automata
Automated Technology for Verification and Analysis | 2023-07-28 | Paper |
Formal verification of piece-wise linear feed-forward neural networks
Automated Technology for Verification and Analysis | 2022-08-12 | Paper |
| SAT solving with fragmented Hamiltonian path constraints for wire arc additive manufacturing | 2021-04-07 | Paper |
| Reactive safety | 2021-03-03 | Paper |
Reactive safety
(available as arXiv preprint) | 2021-03-03 | Paper |
Symmetric synthesis
(available as arXiv preprint) | 2020-11-25 | Paper |
Evaluating ESOP Optimization Methods in Quantum Compilation Flows
Reversible Computation | 2019-10-17 | Paper |
| Approximately propagation complete and conflict propagating constraint encodings | 2018-08-10 | Paper |
Supervisory control and reactive synthesis: a comparative introduction
Discrete Event Dynamic Systems | 2018-01-31 | Paper |
Automated generation of dynamics-based runtime certificates for high-level control
Discrete Event Dynamic Systems | 2018-01-31 | Paper |
Estimator-based reactive synthesis under incomplete information
Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control | 2017-05-19 | Paper |
Resilience to intermittent assumption violations in reactive synthesis
Proceedings of the 17th international conference on Hybrid systems: computation and control | 2017-05-16 | Paper |
Cooperative reactive synthesis
Automated Technology for Verification and Analysis | 2016-01-08 | Paper |
Synthesis with Identifiers
Lecture Notes in Computer Science | 2015-01-13 | Paper |
A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic
Automated Reasoning | 2014-09-26 | Paper |
ALLQBF solving by computational learning
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Symbolic bounded synthesis
Formal Methods in System Design | 2012-09-27 | Paper |
Unbeast: Symbolic Bounded Synthesis
Tools and Algorithms for the Construction and Analysis of Systems | 2011-05-19 | Paper |
Minimising deterministic Büchi automata precisely using SAT solving
Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
Combining symbolic representations for solving timed games
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Short Witnesses and Accepting Lassos in ω-Automata
Language and Automata Theory and Applications | 2010-05-26 | Paper |
