Showing 2026Show all
2 papers · 1 filter
cs.AI2026
Automated Approach for Solving Infinite-state Polynomial Reachability Games
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi +2
Reachability games are two-player games played on a graph, where the objective of player is to reach the target set whereas the objective of player…
cs.PL2026
SuperDP: Differential Privacy Refutation via Supermartingales
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, ÄorÄe ŽikeliÄ
Differential privacy (DP) has established itself as one of the standards for ensuring privacy of individual data. However, reasoning about DP is a challenging and error-prone task,…