| Publication | Date of Publication | Type |
|---|
| Simulations in rank-based Büchi automata complementation | 2024-04-19 | Paper |
| Succinct determinisation of counting automata via sphere construction | 2024-04-19 | Paper |
| Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation | 2024-02-01 | Paper |
| Modular mix-and-match complementation of Büchi automata | 2023-12-13 | Paper |
| Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation | 2023-08-21 | Paper |
Word equations in synergy with regular constraints
Formal Methods | 2023-08-17 | Paper |
Simulation algorithms for symbolic automata
Automated Technology for Verification and Analysis | 2023-07-28 | Paper |
| Complementing Büchi Automata with Ranker | 2022-12-07 | Paper |
Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure
Journal of Automated Reasoning | 2021-11-24 | Paper |
| A symbolic algorithm for the case-split rule in string constraint solving | 2021-07-08 | Paper |
| Register automata with linear arithmetic | 2021-01-19 | Paper |
Register automata with linear arithmetic
(available as arXiv preprint) | 2021-01-19 | Paper |
Fair termination for parameterized probabilistic concurrent systems
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
Fair termination for parameterized probabilistic concurrent systems
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
Lazy automata techniques for WS1S
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
| Dataset for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata" | 2020-08-03 | Dataset |
Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure
Lecture Notes in Computer Science | 2020-03-10 | Paper |
Nested antichains for WS1S
Tools and Algorithms for the Construction and Analysis of Systems | 2019-09-17 | Paper |
Nested antichains for WS1S
Acta Informatica | 2019-03-21 | Paper |
Compositional entailment checking for a fragment of separation logic
Formal Methods in System Design | 2018-01-08 | Paper |
Counterexample validation and interpolation-based refinement for forest automata
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Verification of heap manipulating programs with ordered data by extended forest automata
Acta Informatica | 2016-06-28 | Paper |
Compositional entailment checking for a fragment of separation logic
Programming Languages and Systems | 2016-02-26 | Paper |
Verification of heap manipulating programs with ordered data by extended forest automata
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
Tools and Algorithms for the Construction and Analysis of Systems | 2012-06-29 | Paper |
Efficient inclusion checking on explicit and semi-symbolic tree automata
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
