publications
2026
- IJCAI’26Automated Approach for Solving Infinite-state Polynomial Reachability Games*In International Joint Conference on Artificial Intelligence (IJCAI), 2026
- COLT’26Strongly Polynomial Time Complexity of Policy Iteration for Robust MDPs*In Conference on Learning Theory (COLT), 2026
- AAAI’26Qualitative Analysis of ω-Regular Objectives on Robust MDPs*In AAAI Conference on Artificial Intelligence (AAAI), 2026
2025
- AAAI’25Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization*In AAAI Conference on Artificial Intelligence (AAAI), 2025
- ATVA’25PolyQEnt: A Polynomial Quantified Entailment Solver*In International Symposium on Automated Technology for Verification and Analysis (ATVA), 2025
2024
- IJCAI’24Solving Long-run Average Reward Robust MDPs via Stochastic Games*In International Joint Conference on Artificial Intelligence (IJCAI), 2024
- PODC’24Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains*In ACM Symposium on Principles of Distributed Computing (PODC), 2024
- PODC’24Game Dynamics and Equilibrium Computation in the Population Protocol Model*In ACM Symposium on Principles of Distributed Computing (PODC), 2024
- FM’24Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs*In International Symposium on Formal Methods (FM), 2024