BibSLEIGH — Krishnendu

Travelled to:

1 × Canada
1 × Croatia
1 × Cyprus
1 × Denmark
1 × Estonia
1 × Finland
1 × Greece
1 × India
1 × Poland
1 × Russia
2 × Germany
2 × Hungary
2 × Italy
2 × Japan
2 × Spain
3 × Austria
3 × Portugal
3 × United Kingdom
4 × France
9 × USA

Collaborated with:

T.A.Henzinger L.Doyen A.Pavlogiannis ∅ A.K.Goharshady H.F.0001 R.Ibsen-Jensen M.Jurdzinski B.Jobstmann Y.Velner T.Brázdil J.Kretínský M.Henzinger N.Fijalkow A.Kucera Petr Novotný 0001 M.Chmelik R.Bloem M.Tracol V.Loitzenbauer V.Raman V.Forejt R.Singh S.Chaubal M.Y.Vardi J.Otop L.d.Alfaro P.Daca V.Toman J.Raskin J.Lacki R.Majumdar A.Radhakrishna Peixin Wang Z.Komárková A.Gaiser S.Rubin P.Kamath F.Horn K.Sen N.Piterman A.Murhekar Dorde Zikelic Sheshansh Agrawal Bhavya Choudhary P.Goyal S.Jacobs R.Könighofer H.Gimbert Y.Oualhadj S.Nain E.Filiot J.G.Reiter I.Bozic M.A.Nowak P.Novotný M.Joglekar N.Shah U.Boker O.Kupferman C.Sánchez B.Kragl S.Mishra W.Dvorák M.Huang Rouzbeh Hasheminezhad Nastaran Okati A.Fellner P.Cerný V.Brozek K.Greimel D.Berwanger M.D.Wulf P.Ashok T.Meggendorfer S.Oraee Marek Chalupa N.Sinha Kapil Vaidya Y.Deng Ming Xu D.Ma T.Zhao J.Palsberg G.Avni B.Könighofer S.Pranger Xudong Qin Wenjun Shi A.Ghosal D.T.Iercan C.M.Kirsch C.Pinello A.L.Sangiovanni-Vincentelli

Talks about:

game (27) probabilist (13) algorithm (13) program (11) analysi (11) object (11) synthesi (10) quantit (10) markov (10) stochast (9)

Person: Krishnendu Chatterjee

DBLP: Chatterjee:Krishnendu

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2017

2018

2016

2017

2018

2019

2016

2017

2018

2019

2020

Wrote 83 papers:

CAV-2015-BrazdilCCFK #learning #markov #process: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes (TB, KC, MC, AF, JK), pp. 158–177.
CAV-2015-ChatterjeeIP #algorithm #constant #graph #performance #verification: Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs (KC, RIJ, AP), pp. 140–157.
ICALP-v2-2015-Chatterjee0V #complexity #component #probability #synthesis: The Complexity of Synthesis from Probabilistic Components (KC, LD, MYV), pp. 108–120.
ICALP-v2-2015-ChatterjeeHIO #automaton #distance #edit distance: Edit Distance for Pushdown Automata (KC, TAH, RIJ, JO), pp. 121–133.
LICS-2015-ChatterjeeHL #algorithm: Improved Algorithms for One-Pair and k-Pair Streett Objectives (KC, MH, VL), pp. 269–280.
LICS-2015-ChatterjeeHO #automaton: Nested Weighted Automata (KC, TAH, JO), pp. 725–737.
LICS-2015-ChatterjeeKK #markov #multi #process: Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes (KC, ZK, JK), pp. 244–256.
POPL-2015-ChatterjeeIPG #algebra #algorithm #constant #performance #recursion #state machine: Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth (KC, RIJ, AP, PG), pp. 97–109.
POPL-2015-ChatterjeePV #analysis #interprocedural: Quantitative Interprocedural Analysis (KC, AP, YV), pp. 539–551.
TACAS-2015-BloemCJK #concurrent #source code #synthesis: Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information (RB, KC, SJ, RK), pp. 517–532.
TACAS-2015-BrazdilCFK #multi #named #synthesis: MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives (TB, KC, VF, AK), pp. 181–187.
CAV-2014-ChatterjeeCD #analysis #probability: CEGAR for Qualitative Analysis of Probabilistic Systems (KC, MC, PD), pp. 473–490.
FoSSaCS-2014-Chatterjee0GO #game studies #probability: Perfect-Information Stochastic Mean-Payoff Parity Games (KC, LD, HG, YO), pp. 210–225.
FoSSaCS-2014-Chatterjee0NV #complexity #game studies #probability: The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies (KC, LD, SN, MYV), pp. 242–257.
ICALP-v2-2014-Chatterjee0 #game studies: Games with a Weak Adversary (KC, LD), pp. 110–121.
ICALP-v2-2014-ChatterjeeI #complexity #game studies: The Complexity of Ergodic Mean-payoff Games (KC, RIJ), pp. 122–133.
VMCAI-2014-Chatterjee0FR #game studies: Doomsday Equilibria for Omega-Regular Games (KC, LD, EF, JFR), pp. 78–97.
CAV-2013-ChatterjeeGK #automaton #ltl #model checking #probability #synthesis: Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis (KC, AG, JK), pp. 559–575.
CAV-2013-ChatterjeeL #algorithm #markov #performance #process: Faster Algorithms for Markov Decision Processes with Low Treewidth (KC, JL), pp. 543–558.
CAV-2013-ReiterBCN #named: TTP: Tool for Tumor Progression (JGR, IB, KC, MAN), pp. 101–106.
CSL-2013-ChatterjeeCT #decidability #markov #process #what: What is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives (KC, MC, MT), pp. 165–180.
CSL-2013-ChatterjeeF #game studies #infinity: Infinite-state games with finitary conditions (KC, NF), pp. 181–196.
LATA-2013-ChatterjeeCR #how: How to Travel between Languages (KC, SC, SR), pp. 214–225.
LICS-2013-BrazdilCFK #markov #performance #process: Trading Performance for Stability in Markov Decision Processes (TB, KC, VF, AK), pp. 331–340.
CAV-2012-BrazdilCKN #game studies #multi #performance #synthesis: Efficient Controller Synthesis for Consumption Games with Multiple Resource Types (TB, KC, AK, PN), pp. 23–38.
CSL-2012-ChatterjeeCK #algorithm #performance #refinement: Faster Algorithms for Alternating Refinement Relations (KC, SC, PK), pp. 167–182.
FoSSaCS-2012-Chatterjee #concurrent #game studies #robust: Robustness of Structurally Equivalent Concurrent Parity Games (KC), pp. 270–285.
LICS-2012-ChatterjeeD #game studies #how #probability: Partial-Observation Stochastic Games: How to Win When Belief Fails (KC, LD), pp. 175–184.
LICS-2012-ChatterjeeT #automaton #decidability #infinity #probability #problem #word: Decidable Problems for Probabilistic Automata on Infinite Words (KC, MT), pp. 185–194.
LICS-2012-ChatterjeeV #automaton #game studies: Mean-Payoff Pushdown Games (KC, YV), pp. 195–204.
VMCAI-2012-ChatterjeeR #contract #protocol: Synthesizing Protocols for Digital Contract Signing (KC, VR), pp. 152–168.
CAV-2011-CernyCHRS #concurrent #source code #synthesis: Quantitative Synthesis for Concurrent Programs (PC, KC, TAH, AR, RS), pp. 243–259.
CAV-2011-ChatterjeeHJS #algorithm #analysis #automaton #markov #process: Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives (KC, MH, MJ, NS), pp. 260–276.
LATA-2011-ChatterjeeF: Finitary Languages (KC, NF), pp. 216–226.
LATA-2011-ChatterjeeHH #complexity #game studies: The Complexity of Request-Response Games (KC, TAH, FH), pp. 227–237.
LICS-2011-BokerCHK #cumulative #specification: Temporal Specifications with Accumulative Values (UB, KC, TAH, OK), pp. 43–52.
LICS-2011-BrazdilBCFK #markov #multi #process: Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes (TB, VB, KC, VF, AK), pp. 33–42.
TACAS-2011-ChatterjeeHJS #named #synthesis: QUASY: Quantitative Synthesis Tool (KC, TAH, BJ, RS), pp. 267–271.
CAV-2010-BloemCGHJ #liveness #robust: Robustness in the Presence of Liveness (RB, KC, KG, TAH, BJ), pp. 410–424.
CAV-2010-ChatterjeeHJR #game studies #named #probability: Gist: A Solver for Probabilistic Games (KC, TAH, BJ, AR), pp. 665–669.
CAV-2010-ChatterjeeHJS #probability: Measuring and Synthesizing Systems in Probabilistic Environments (KC, TAH, BJ, RS), pp. 380–395.
FASE-2010-ChatterjeeARS #concurrent #multi #source code #thread: Analyzing the Impact of Change in Multi-threaded Programs (KC, LdA, VR, CS), pp. 293–307.
ICALP-v2-2010-ChatterjeeD #energy #game studies: Energy Parity Games (KC, LD), pp. 599–610.
CAV-2009-BloemCHJ #quality #synthesis: Better Quality in Synthesis through Quantitative Objectives (RB, KC, TAH, BJ), pp. 140–156.
ICALP-v2-2009-ChatterjeeDH #game studies #overview #probability: A Survey of Stochastic Games with Limsup and Liminf Objectives (KC, LD, TAH), pp. 1–15.
LICS-2009-ChatterjeeDH: Expressiveness and Closure Properties for Quantitative Languages (KC, LD, TAH), pp. 199–208.
TACAS-2009-BerwangerCWDH #game studies #named: Alpaga: A Tool for Solving Parity Games with Imperfect Information (DB, KC, MDW, LD, TAH), pp. 58–61.
CSL-2008-ChatterjeeDH: Quantitative Languages (KC, LD, TAH), pp. 385–400.
DATE-2008-ChatterjeeGHIKPS #logic #realtime #reliability: Logical Reliability of Interacting Real-Time Tasks (KC, AG, TAH, DTI, CMK, CP, ALSV), pp. 909–914.
FoSSaCS-2008-ChatterjeeSH #markov #model checking: Model-Checking ω-Regular Properties of Interval Markov Chains (KC, KS, TAH), pp. 302–317.
FoSSaCS-2007-Chatterjee #game studies #probability #synthesis: Optimal Strategy Synthesis in Stochastic Müller Games (KC), pp. 138–152.
FoSSaCS-2007-ChatterjeeHP #game studies: Generalized Parity Games (KC, TAH, NP), pp. 153–167.
TACAS-2007-ChatterjeeH #synthesis: Assume-Guarantee Synthesis (KC, TAH), pp. 261–275.
CSL-2006-Chatterjee #concurrent #game studies: Concurrent Games with Tail Objectives (KC), pp. 256–270.
CSL-2006-Chatterjee06a #equilibrium #nash: Nash Equilibrium for Upward-Closed Objectives (KC), pp. 271–286.
CSL-2006-ChatterjeeDHR #algorithm #game studies: Algorithms for ω-Regular Games with Imperfect Information (KC, LD, TAH, JFR), pp. 287–302.
TACAS-2006-ChatterjeeH #game studies: Finitary Winning in ω-Regular Games (KC, TAH), pp. 257–271.
ICALP-2005-ChatterjeeAH #complexity #game studies #probability: The Complexity of Stochastic Rabin and Streett Games (KC, LdA, TAH), pp. 878–890.
LICS-2005-ChatterjeeHJ #game studies: Mean-Payoff Parity Games (KC, TAH, MJ), pp. 178–187.
CSL-2004-ChatterjeeMJ #game studies #nash #on the #probability: On Nash Equilibria in Stochastic Games (KC, RM, MJ), pp. 26–40.
LICS-2004-ChatterjeeHJ #game studies: Games with Secure Equilibria (KC, TAH, MJ), pp. 160–169.
CSL-2003-ChatterjeeJH #game studies #probability: Simple Stochastic Parity Games (KC, MJ, TAH), pp. 100–113.
SAS-2003-ChatterjeeMMZHP #analysis #source code #stack: Stack Size Analysis for Interrupt-Driven Programs (KC, DM, RM, TZ, TAH, JP), pp. 109–126.
ESOP-2017-ChatterjeeKMP #algorithm #performance #recursion #state machine: Faster Algorithms for Weighted Recursive State Machines (KC, BK, SM, AP), pp. 287–313.
ESOP-2018-ChatterjeeGV #analysis #contract: Quantitative Analysis of Smart Contracts (KC, AKG, YV), pp. 739–767.
CAV-2016-ChatterjeeFG #analysis #probability #source code #termination: Termination Analysis of Probabilistic Programs Through Positivstellensatz's (KC, HF0, AKG), pp. 3–22.
CAV-2017-AshokCDKM #markov #process: Value Iteration for Long-Run Average Reward in Markov Decision Processes (PA, KC, PD, JK, TM), pp. 201–221.
CAV-2017-ChatterjeeFM #analysis #automation #bound: Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds (KC, HF0, AM), pp. 118–139.
CAV-2017-ChatterjeeFG #analysis #recursion #source code #worst-case: Non-polynomial Worst-Case Analysis of Recursive Programs (KC, HF0, AKG), pp. 41–63.
CSL-2017-ChatterjeeDHL #algorithm #game studies: Improved Set-Based Symbolic Algorithms for Parity Games (KC, WD, MH, VL), p. 21.
CAV-2018-ChatterjeeHLOT #algorithm #graph #markov #process: Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives (KC, MH, VL, SO, VT), pp. 178–197.
CAV-2019-AvniBCHKP #game studies #optimisation #runtime: Run-Time Optimization for Learned Controllers Through Quantitative Games (GA, RB, KC, TAH, BK, SP), pp. 630–649.
OOPSLA-2019-ChatterjeePT #partial order #reduction: Value-centric dynamic partial order reduction (KC, AP, VT), p. 29.
OOPSLA-2019-Huang0CG #composition #probability #source code #termination #verification: Modular verification for almost-sure termination of probabilistic programs (MH, HF0, KC, AKG), p. 29.
POPL-2016-ChatterjeeFNH #algorithm #analysis #probability #problem #source code #termination: Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (KC, HF0, PN0, RH), pp. 327–342.
POPL-2016-ChatterjeeGIP #algebra #algorithm #component #concurrent #constant: Algorithms for algebraic path properties in concurrent systems of constant treewidth components (KC, AKG, RIJ, AP), pp. 733–747.
POPL-2017-ChatterjeeNZ #invariant #probability #termination: Stochastic invariants for probabilistic termination (KC, PN0, DZ), pp. 145–160.
POPL-2018-AgrawalC0 #approach #performance #probability #ranking #source code #termination: Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (SA, KC, PN0), p. 32.
POPL-2018-ChalupaCPSV #partial order #reduction: Data-centric dynamic partial order reduction (MC, KC, AP, NS, KV), p. 30.
POPL-2018-ChatterjeeCP #alias #analysis #data flow #reachability: Optimal Dyck reachability for data-dependence and alias analysis (KC, BC, AP), p. 30.
PLDI-2019-Wang0GCQS #cost analysis #nondeterminism #probability #source code: Cost analysis of nondeterministic probabilistic programs (PW, HF0, AKG, KC, XQ, WS), pp. 204–220.
POPL-2019-ChatterjeeGOP #algorithm #performance: Efficient parameterized algorithms for data packing (KC, AKG, NO, AP), p. 28.
POPL-2020-WangFCDX #probability #proving #random #source code #termination: Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time (PW, HF0, KC, YD, MX), p. 30.