171 citations · 1.1k across the 134 of their papers we have counts for
19 papers · 1 filter
Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis +1
Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, etc. Recursive state machines (RSMs) are s…
Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information
Roderick Bloem, Krishnendu Chatterjee, Swen Jacobs +1
Synthesis of program parts is very useful for concurrent systems. However, most synthesis approaches do not support common design tasks, like modifying a single process without hav…
Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games
Umair Z. Ahmed, Krishnendu Chatterjee, Sumit Gulwani
Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role not only in the development of mathematical and logical skills, but also in the emotional and social deve…
Optimal Cost Almost-sure Reachability in POMDPs
Krishnendu Chatterjee, Martin Chmelík, Raghav Gupta +1
We consider partially observable Markov decision processes (POMDPs) with a set of target states and every transition is associated with an integer cost. The optimization objective…
Temporal Logic Control for Stochastic Linear Systems using Abstraction Refinement of Probabilistic Games
Maria Svorenova, Jan Kretinsky, Martin Chmelik +3
We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal lo…
Improved Algorithms for Parity and Streett objectives
Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer
The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with ap…