Please note that IST Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

75 Publications


2018 | Technical Report | IST-REx-ID: 5457
Cost analysis of nondeterministic probabilistic programs
1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, 5 Anonymous, 6 Anonymous, Cost Analysis of Nondeterministic Probabilistic Programs, IST Austria, 2018.
View | Files available
 

2017 | Technical Report | IST-REx-ID: 6426
Synchronizing the asynchronous
T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST Austria, 2017.
View | Files available | DOI
 

2017 | Technical Report | IST-REx-ID: 5455   OA
Optimal Dyck reachability for data-dependence and alias analysis
K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for Data-Dependence and Alias Analysis, IST Austria, 2017.
View | Files available | DOI
 

2017 | Technical Report | IST-REx-ID: 5456   OA
Data-centric dynamic partial order reduction
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.
View | Files available | DOI
 

2016 | Technical Report | IST-REx-ID: 5447   OA
Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds
1 Anonymous, 2 Anonymous, 3 Anonymous, Average-Case Analysis of Programs: Automated Recurrence Analysis for Almost-Linear Bounds, IST Austria, 2016.
View | Files available
 

2016 | Technical Report | IST-REx-ID: 5448
Data-centric dynamic partial order reduction
1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2016.
View | Files available | arXiv
 

2016 | Technical Report | IST-REx-ID: 5451   OA
Strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of Natural Selection, IST Austria, 2016.
View | Files available | DOI
 

2016 | Technical Report | IST-REx-ID: 5449
Amplification on undirected population structures: Comets beat stars
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected Population Structures: Comets Beat Stars, IST Austria, 2016.
View | Files available | DOI
 

2016 | Technical Report | IST-REx-ID: 5445
Quantitative interprocedural analysis
K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis, IST Austria, 2016.
View | Files available | DOI
 

2016 | Technical Report | IST-REx-ID: 5452   OA
Arbitrarily strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.
View | Files available | DOI
 

2016 | Technical Report | IST-REx-ID: 5446   OA
Termination and worst-case analysis of recursive programs
1 Anonymous, 2 Anonymous, 3 Anonymous, Termination and Worst-Case Analysis of Recursive Programs, IST Austria, 2016.
View | Files available
 

2016 | Technical Report | IST-REx-ID: 5453
Arbitrarily strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5430
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5435
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5442
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.
View | Files available
 

2015 | Technical Report | IST-REx-ID: 5431   OA
The patience of concurrent stochastic games with safety and reachability objectives
K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5443
A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs
K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5429
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5436
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5444   OA
Reconstructing robust phylogenies of metastatic cancers
J. Reiter, A. Makohon-Moore, J. Gerold, I. Bozic, K. Chatterjee, C. Iacobuzio-Donahue, B. Vogelstein, M. Nowak, Reconstructing Robust Phylogenies of Metastatic Cancers, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5432
The complexity of evolutionary games on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5437
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5440   OA
The complexity of evolutionary games on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5438
Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5434   OA
Optimal cost indefinite-horizon reachability in goal DEC-POMDPs
1 Anonymous, 2 Anonymous, Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs, IST Austria, 2015.
View | Files available
 

2015 | Technical Report | IST-REx-ID: 5439
The target discounted-sum problem
U. Boker, T.A. Henzinger, J. Otop, The Target Discounted-Sum Problem, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5441
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, R. Ibsen-Jensen, A. Goharshady, A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5423   OA
A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks
K. Chatterjee, A. Kössler, A. Pavlogiannis, U. Schmid, A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5428
Quantitative fair simulation games
K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative Fair Simulation Games, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5411
Compositional specifications for IOCO testing
P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, Compositional Specifications for IOCO Testing, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5416
Model measuring for hybrid systems
T.A. Henzinger, J. Otop, Model Measuring for Hybrid Systems, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5417   OA
From model checking to model measuring
T.A. Henzinger, J. Otop, From Model Checking to Model Measuring, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5424
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5412
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5420   OA
The value 1 problem for concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5413
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5418
Games with a weak adversary
K. Chatterjee, L. Doyen, Games with a Weak Adversary, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5425
Optimal cost almost-sure reachability in POMDPs
1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Optimal Cost Almost-Sure Reachability in POMDPs, IST Austria, 2014.
View | Files available
 

2014 | Technical Report | IST-REx-ID: 5419   OA
Improved algorithms for reachability and shortest path on low tree-width graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5421
The complexity of evolution on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on Graphs, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5426
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5414
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5427   OA
Optimal tree-decomposition balancing and reachability on low treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5415
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5409   OA
Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 6440   OA
Replacing competition with cooperation to achieve scalable lock-free FIFO queues
T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5404
The complexity of ergodic games
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5405
Perfect-information stochastic mean-payoff parity games
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic Mean-Payoff Parity Games, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5400
What is decidable about partially observable Markov decision processes with ω-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5406
Distributed synthesis for LTL Fragments
K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis for LTL Fragments, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5402   OA
How free is your linearizable concurrent data structure?
T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5399
TTP: Tool for Tumor Progression
J. Reiter, I. Bozic, K. Chatterjee, M. Nowak, TTP: Tool for Tumor Progression, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5403   OA
Qualitative analysis of concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff Games, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5408
The complexity of partial-observation stochastic parity games with finite-memory strategies
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5410
Automatic generation of alternative starting positions for traditional board games
U. Ahmed, K. Chatterjee, S. Gulwani, Automatic Generation of Alternative Starting Positions for Traditional Board Games, IST Austria, 2013.
View | Files available | DOI
 

2012 | Technical Report | IST-REx-ID: 5396   OA
Approximating marginals using discrete energy minimization
F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete Energy Minimization, IST Austria, 2012.
View | Files available | DOI
 

2012 | Technical Report | IST-REx-ID: 5377
Mean-payoff pushdown games
K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
View | Files available | DOI
 

2012 | Technical Report | IST-REx-ID: 5378
Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5384
Decidable problems for probabilistic automata on infinite words
K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, IST Austria, 2011.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5380   OA
Bounded rationality in concurrent parity games
K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria, 2011.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5385   OA
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5386   OA
Enforcing topological constraints in random field image segmentation
C. Chen, D. Freedman, C. Lampert, Enforcing Topological Constraints in Random Field Image Segmentation, IST Austria, 2011.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5381
Partial-observation stochastic games: How to win when belief fails
K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5379
An O(n2) time algorithm for alternating Büchi games
K. Chatterjee, M. Henzinger, An O(N2) Time Algorithm for Alternating Büchi Games, IST Austria, 2011.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5382
Robustness of structurally equivalent concurrent parity games
K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games, IST Austria, 2011.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5387
Energy and mean-payoff parity Markov decision processes
K. Chatterjee, L. Doyen, Energy and Mean-Payoff Parity Markov Decision Processes, IST Austria, 2011.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5383   OA
On an efficient decision procedure for imperative tree data structures
T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative Tree Data Structures, IST Austria, 2011.
View | Files available | DOI
 

2010 | Technical Report | IST-REx-ID: 5391   OA
Model checking of linearizability of concurrent list implementations
P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, Model Checking of Linearizability of Concurrent List Implementations, IST Austria, 2010.
View | Files available | DOI
 

2010 | Technical Report | IST-REx-ID: 5389
Simulation distances
P. Cerny, T.A. Henzinger, A. Radhakrishna, Simulation Distances, IST Austria, 2010.
View | Files available | DOI
 

2010 | Technical Report | IST-REx-ID: 5390   OA
Topological, automata-theoretic and logical characterization of finitary languages
K. Chatterjee, N. Fijalkow, Topological, Automata-Theoretic and Logical Characterization of Finitary Languages, IST Austria, 2010.
View | Files available | DOI
 

2010 | Technical Report | IST-REx-ID: 5388
Quantitative synthesis for concurrent programs
K. Chatterjee, P. Cerny, T.A. Henzinger, A. Radhakrishna, R. Singh, Quantitative Synthesis for Concurrent Programs, IST Austria, 2010.
View | Files available | DOI
 

2009 | Technical Report | IST-REx-ID: 5392   OA
Probabilistic automata on infinite words: Decidability and undecidability results
K. Chatterjee, Probabilistic Automata on Infinite Words: Decidability and Undecidability Results, IST Austria, 2009.
View | Files available | DOI
 

2009 | Technical Report | IST-REx-ID: 5393
Gist: A solver for probabilistic games
K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, Gist: A Solver for Probabilistic Games, IST Austria, 2009.
View | Files available | DOI
 

2009 | Technical Report | IST-REx-ID: 5394   OA
Improved lower bounds for request-response and finitary Streett games
K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.
View | Files available | DOI
 

2009 | Technical Report | IST-REx-ID: 5395   OA
Qualitative analysis of partially-observable Markov decision processes
K. Chatterjee, L. Doyen, T.A. Henzinger, Qualitative Analysis of Partially-Observable Markov Decision Processes, IST Austria, 2009.
View | Files available | DOI
 

Filters and Search Terms

issn=2664-1690

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed