Publications
Total number of publications: 76
2021
-
Algorithmic Analysis of Termination and Counter Complexity in Vector Addition Systems with States: A Survey of Recent Results
ACM SIGLOG News, year: 2021, volume: 8, edition: 4, DOI
-
Backward Symbolic Execution with Loop Folding
Static Analysis - 28th International Symposium, SAS 2021, Chicago, IL, USA, October 17-19, 2021, Proceedings, year: 2021
-
Deciding Polynomial Termination Complexity for VASS Programs
32nd International Conference on Concurrency Theory (CONCUR 2021), year: 2021
-
DQBDD: An Efficient BDD-Based DQBF Solver
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, year: 2021
-
Fast Computation of Strong Control Dependencies
Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20-23, 2021, Proceedings, Part II, year: 2021
-
Fuel in Markov Decision Processes (FiMDP): A Practical Approach to Consumption
24th International Symposium on Formal Methods, FM 2021, year: 2021
-
On Lexicographic Proof Rules for Probabilistic Termination
24th International Symposium on Formal Methods, FM 2021, year: 2021
-
Proving non-termination by program reversal
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), year: 2021
-
Regstar: Efficient Strategy Synthesis for Adversarial Patrolling Games
Proceedings of 37th Conference on Uncertainty in Artificial Intelligence (UAI 2021), year: 2021
-
Symbiotic 8: Beyond Symbolic Execution
Tools and Algorithms for the Construction and Analysis of Systems - 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings, Part II, year: 2021
Total number of publications: 10
2024
-
Tighter Construction of Tight Büchi Automata
Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part I, year: 2024
2023
-
Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving
26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, year: 2023
-
The Power-Set Construction for Tree Algebras
LOGICAL METHODS IN COMPUTER SCIENCE, year: 2023, volume: 19, edition: 4, DOI
2021
-
Algebraic Language Theory for Eilenberg–Moore Algebras
Logical Methods in Computer Science, year: 2021, volume: 17, edition: 2, DOI
-
DQBDD: An Efficient BDD-Based DQBF Solver
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, year: 2021
-
ω-Forest Algebras and Temporal Logics
46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia, year: 2021
2020
-
Bisimulation invariant monadic-second order logic in the finite
Theoretical Computer Science, year: 2020, volume: 823, edition: 1, DOI
-
Regular Tree Algebras
Logical Methods in Computer Science, year: 2020, volume: 16, edition: 1, DOI
2018
-
Bisimulation Invariant Monadic-Second Order Logic in the Finite
45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, year: 2018
2016
-
On a Fragment of AMSO and Tiling Systems
33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orleans, France, year: 2016
Total number of publications: 53
2021
-
Symbiotic 6: generating test cases by slicing and symbolic execution
International Journal on Software Tools for Technology Transfer, year: 2021, volume: 23, edition: 6, DOI
-
The Satisfiability Problem for a Quantitative Fragment of PCTL
Fundamentals of Computation Theory. 23rd International Symposium, FCT 2021, year: 2021
2020
-
Efficient Analysis of VASS Termination Complexity
LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, year: 2020
-
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling
Computer Aided Verification, CAV 2020, year: 2020
-
Qualitative Controller Synthesis for Consumption Markov Decision Processes
Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part {II}, year: 2020
-
Termination Analysis of Probabilistic Programs with Martingales
Foundations of Probabilistic Programming, year: 2020, number of pages: 38 s.
2019
-
Bidding Games on Markov Decision Processes
Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings., year: 2019
-
Deciding Fast Termination for Probabilistic VASS with Nondeterminism
Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Proceedings, year: 2019
-
Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms
ACM Transactions on Modeling and Computer Simulation (TOMACS), year: 2019, volume: 29, edition: 4, DOI
-
On the Complexity of Value Iteration
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), year: 2019
Total number of publications: 2
2020
-
Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications
Proceedings of the International Conference on Automated Planning and Scheduling, year: 2020
-
Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes
The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, year: 2020
Total number of publications: 11
2014
-
Solving adversarial patrolling games with bounded error: (extended abstract)
Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'14), year: 2014