[{"scopus_import":"1","corr_author":"1","alternative_title":["LIPIcs"],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"type":"conference","language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23"}],"quality_controlled":"1","article_number":"27","license":"https://creativecommons.org/licenses/by/4.0/","oa_version":"Published Version","_id":"6885","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","volume":140,"publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","date_updated":"2025-07-10T11:53:58Z","doi":"10.4230/LIPICS.CONCUR.2019.27","oa":1,"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Otop","full_name":"Otop, Jan","first_name":"Jan"}],"date_published":"2019-08-01T00:00:00Z","day":"01","conference":{"end_date":"2019-08-30","name":"CONCUR: Conference on Concurrency Theory","location":"Amsterdam, Netherlands","start_date":"2019-08-27"},"abstract":[{"text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A configuration is a state and a value for each counter; a transition changes the state and each counter is incremented, decremented, or left unchanged. While qualitative properties such as state and configuration reachability have been studied for VASS, we consider the long-run average cost of infinite computations of VASS. The cost of a configuration is for each state, a linear combination of the counter values. In the special case of uniform cost functions, the linear combination is the same for all states. The (regular) long-run emptiness problem is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped) computation such that the long-run average value of the cost function does not exceed the threshold. For uniform cost functions, we show that the regular long-run emptiness problem is (a) decidable in polynomial time for integer-valued VASS, and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative counters). For general cost functions, we show that the problem is (c) NP-complete for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most interesting result is for (c) integer-valued VASS with general cost functions, where we establish a connection between the regular long-run emptiness problem and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness problem is equally hard as the regular problem in all cases except (c), where it remains open. ","lang":"eng"}],"article_processing_charge":"No","file":[{"file_name":"2019_LIPIcs_Chatterjee.pdf","creator":"kschuh","content_type":"application/pdf","file_size":538120,"date_updated":"2020-07-14T12:47:43Z","date_created":"2019-09-27T12:09:35Z","file_id":"6914","relation":"main_file","checksum":"4985e26e1572d1575d64d38acabd71d6","access_level":"open_access"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ama":"Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.27","mla":"Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","ista":"Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 140, 27.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27"},"ddc":["000"],"file_date_updated":"2020-07-14T12:47:43Z","intvolume":" 140","year":"2019","date_created":"2019-09-18T08:06:14Z","has_accepted_license":"1","title":"Long-run average behavior of vector addition systems with states"},{"oa_version":"Published Version","_id":"6887","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","article_number":"7","date_updated":"2025-07-10T11:53:59Z","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"08","publication_status":"published","volume":140,"type":"conference","department":[{"_id":"KrCh"}],"ec_funded":1,"alternative_title":["LIPIcs"],"corr_author":"1","scopus_import":"1","publication":"Leibniz International Proceedings in Informatics","project":[{"grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"ddc":["000"],"file_date_updated":"2020-07-14T12:47:43Z","citation":{"ista":"Chatterjee K, Dvorák W, Henzinger M, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 140, 7.","ieee":"K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7","short":"K. Chatterjee, W. Dvorák, M. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ama":"Chatterjee K, Dvorák W, Henzinger M, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.7","mla":"Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” Leibniz International Proceedings in Informatics, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7."},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"access_level":"open_access","checksum":"e1f0e4061212454574f34a1368d018ec","relation":"main_file","file_id":"6922","date_created":"2019-10-01T08:20:30Z","file_size":730112,"date_updated":"2020-07-14T12:47:43Z","content_type":"application/pdf","creator":"kschuh","file_name":"2019_LIPIcs_Chatterjee.pdf"}],"article_processing_charge":"No","title":"Near-linear time algorithms for Streett objectives in graphs and MDPs","has_accepted_license":"1","intvolume":" 140","date_created":"2019-09-18T08:07:58Z","year":"2019","doi":"10.4230/LIPICS.CONCUR.2019.7","conference":{"location":"Amsterdam, Netherlands","start_date":"2019-08-27","name":"CONCUR: Conference on Concurrency Theory","end_date":"2019-08-30"},"abstract":[{"lang":"eng","text":"The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. "}],"day":"01","date_published":"2019-08-01T00:00:00Z","oa":1,"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Wolfgang","full_name":"Dvorák, Wolfgang","last_name":"Dvorák"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"first_name":"Alexander","full_name":"Svozil, Alexander","last_name":"Svozil"}]},{"alternative_title":["LIPIcs"],"scopus_import":"1","type":"conference","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"project":[{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"article_number":"6","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6889","oa_version":"Published Version","publication_status":"published","month":"08","volume":140,"status":"public","date_updated":"2025-07-10T11:53:59Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.4230/LIPICS.CONCUR.2019.6","date_published":"2019-08-01T00:00:00Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Piterman","full_name":"Piterman, Nir","first_name":"Nir"}],"oa":1,"abstract":[{"lang":"eng","text":"We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. "}],"conference":{"location":"Amsterdam, Netherlands","start_date":"2019-08-27","end_date":"2019-08-30","name":"CONCUR: Conference on Concurrency Theory"},"day":"01","citation":{"apa":"Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6","chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6.","ieee":"K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","ista":"Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 140, 6.","mla":"Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6.","ama":"Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.6","short":"K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019."},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_processing_charge":"No","file":[{"checksum":"7b2ecfd4d9d02360308c0ca986fc10a7","access_level":"open_access","relation":"main_file","file_id":"6923","date_created":"2019-10-01T08:49:45Z","content_type":"application/pdf","creator":"kschuh","file_name":"2019_LIPIcs_Chatterjee.pdf","file_size":509163,"date_updated":"2020-07-14T12:47:43Z"}],"file_date_updated":"2020-07-14T12:47:43Z","ddc":["000"],"year":"2019","date_created":"2019-09-18T08:11:43Z","intvolume":" 140","title":"Combinations of Qualitative Winning for Stochastic Parity Games","has_accepted_license":"1"},{"citation":{"ama":"Ashok P, Brázdil T, Chatterjee K, Křetínský J, Lampert C, Toman V. Strategy representation by decision trees with linear classifiers. In: 16th International Conference on Quantitative Evaluation of Systems. Vol 11785. Springer Nature; 2019:109-128. doi:10.1007/978-3-030-30281-8_7","mla":"Ashok, Pranav, et al. “Strategy Representation by Decision Trees with Linear Classifiers.” 16th International Conference on Quantitative Evaluation of Systems, vol. 11785, Springer Nature, 2019, pp. 109–28, doi:10.1007/978-3-030-30281-8_7.","short":"P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, V. Toman, in:, 16th International Conference on Quantitative Evaluation of Systems, Springer Nature, 2019, pp. 109–128.","chicago":"Ashok, Pranav, Tomáš Brázdil, Krishnendu Chatterjee, Jan Křetínský, Christoph Lampert, and Viktor Toman. “Strategy Representation by Decision Trees with Linear Classifiers.” In 16th International Conference on Quantitative Evaluation of Systems, 11785:109–28. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-30281-8_7.","apa":"Ashok, P., Brázdil, T., Chatterjee, K., Křetínský, J., Lampert, C., & Toman, V. (2019). Strategy representation by decision trees with linear classifiers. In 16th International Conference on Quantitative Evaluation of Systems (Vol. 11785, pp. 109–128). Glasgow, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-030-30281-8_7","ista":"Ashok P, Brázdil T, Chatterjee K, Křetínský J, Lampert C, Toman V. 2019. Strategy representation by decision trees with linear classifiers. 16th International Conference on Quantitative Evaluation of Systems. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11785, 109–128.","ieee":"P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, and V. Toman, “Strategy representation by decision trees with linear classifiers,” in 16th International Conference on Quantitative Evaluation of Systems, Glasgow, United Kingdom, 2019, vol. 11785, pp. 109–128."},"publisher":"Springer Nature","article_processing_charge":"No","title":"Strategy representation by decision trees with linear classifiers","intvolume":" 11785","year":"2019","date_created":"2019-10-14T06:57:49Z","publication_identifier":{"issn":["0302-9743"],"eisbn":["9783030302818"],"isbn":["9783030302801"]},"external_id":{"arxiv":["1906.08178"],"isi":["000679281300007"]},"doi":"10.1007/978-3-030-30281-8_7","conference":{"end_date":"2019-09-12","name":"QEST: Quantitative Evaluation of Systems","location":"Glasgow, United Kingdom","start_date":"2019-09-10"},"abstract":[{"text":"Graph games and Markov decision processes (MDPs) are standard models in reactive synthesis and verification of probabilistic systems with nondeterminism. The class of 𝜔 -regular winning conditions; e.g., safety, reachability, liveness, parity conditions; provides a robust and expressive specification formalism for properties that arise in analysis of reactive systems. The resolutions of nondeterminism in games and MDPs are represented as strategies, and we consider succinct representation of such strategies. The decision-tree data structure from machine learning retains the flavor of decisions of strategies and allows entropy-based minimization to obtain succinct trees. However, in contrast to traditional machine-learning problems where small errors are allowed, for winning strategies in graph games and MDPs no error is allowed, and the decision tree must represent the entire strategy. In this work we propose decision trees with linear classifiers for representation of strategies in graph games and MDPs. We have implemented strategy representation using this data structure and we present experimental results for problems on graph games and MDPs, which show that this new data structure presents a much more efficient strategy representation as compared to standard decision trees.","lang":"eng"}],"day":"04","date_published":"2019-09-04T00:00:00Z","oa":1,"author":[{"full_name":"Ashok, Pranav","first_name":"Pranav","last_name":"Ashok"},{"first_name":"Tomáš","full_name":"Brázdil, Tomáš","last_name":"Brázdil"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Křetínský, Jan","first_name":"Jan","last_name":"Křetínský"},{"first_name":"Christoph","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert"},{"id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","last_name":"Toman","first_name":"Viktor","full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X"}],"arxiv":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6942","page":"109-128","oa_version":"Preprint","quality_controlled":"1","date_updated":"2025-04-14T13:51:05Z","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1906.08178"}],"month":"09","volume":11785,"publication_status":"published","isi":1,"type":"conference","department":[{"_id":"KrCh"},{"_id":"ChLa"}],"alternative_title":["LNCS"],"scopus_import":"1","publication":"16th International Conference on Quantitative Evaluation of Systems","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"language":[{"iso":"eng"}]},{"publication_status":"published","volume":11781,"month":"10","isi":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1907.11010"}],"status":"public","date_updated":"2026-04-16T09:51:24Z","quality_controlled":"1","_id":"7183","page":"462-478","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa_version":"Preprint","language":[{"iso":"eng"}],"project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"}],"publication":"International Symposium on Automated Technology for Verification and Analysis","scopus_import":"1","alternative_title":["LNCS"],"department":[{"_id":"KrCh"}],"type":"conference","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030317836"]},"external_id":{"isi":["000723515700027"],"arxiv":["1907.11010"]},"intvolume":" 11781","date_created":"2019-12-15T23:00:44Z","year":"2019","title":"Deciding fast termination for probabilistic VASS with nondeterminism","article_processing_charge":"No","publisher":"Springer Nature","citation":{"mla":"Brázdil, Tomás, et al. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.” International Symposium on Automated Technology for Verification and Analysis, vol. 11781, Springer Nature, 2019, pp. 462–78, doi:10.1007/978-3-030-31784-3_27.","ama":"Brázdil T, Chatterjee K, Kucera A, Novotný P, Velan D. Deciding fast termination for probabilistic VASS with nondeterminism. In: International Symposium on Automated Technology for Verification and Analysis. Vol 11781. Springer Nature; 2019:462-478. doi:10.1007/978-3-030-31784-3_27","short":"T. Brázdil, K. Chatterjee, A. Kucera, P. Novotný, D. Velan, in:, International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2019, pp. 462–478.","chicago":"Brázdil, Tomás, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, and Dominik Velan. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.” In International Symposium on Automated Technology for Verification and Analysis, 11781:462–78. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-31784-3_27.","apa":"Brázdil, T., Chatterjee, K., Kucera, A., Novotný, P., & Velan, D. (2019). Deciding fast termination for probabilistic VASS with nondeterminism. In International Symposium on Automated Technology for Verification and Analysis (Vol. 11781, pp. 462–478). Taipei, Taiwan: Springer Nature. https://doi.org/10.1007/978-3-030-31784-3_27","ieee":"T. Brázdil, K. Chatterjee, A. Kucera, P. Novotný, and D. Velan, “Deciding fast termination for probabilistic VASS with nondeterminism,” in International Symposium on Automated Technology for Verification and Analysis, Taipei, Taiwan, 2019, vol. 11781, pp. 462–478.","ista":"Brázdil T, Chatterjee K, Kucera A, Novotný P, Velan D. 2019. Deciding fast termination for probabilistic VASS with nondeterminism. International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated TEchnology for Verification and Analysis, LNCS, vol. 11781, 462–478."},"oa":1,"arxiv":1,"author":[{"last_name":"Brázdil","full_name":"Brázdil, Tomás","first_name":"Tomás"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Antonín","full_name":"Kucera, Antonín","last_name":"Kucera"},{"last_name":"Novotný","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","full_name":"Novotný, Petr"},{"first_name":"Dominik","full_name":"Velan, Dominik","last_name":"Velan"}],"date_published":"2019-10-21T00:00:00Z","day":"21","conference":{"name":"ATVA: Automated TEchnology for Verification and Analysis","end_date":"2019-10-31","start_date":"2019-10-28","location":"Taipei, Taiwan"},"abstract":[{"text":"A probabilistic vector addition system with states (pVASS) is a finite state Markov process augmented with non-negative integer counters that can be incremented or decremented during each state transition, blocking any behaviour that would cause a counter to decrease below zero. The pVASS can be used as abstractions of probabilistic programs with many decidable properties. The use of pVASS as abstractions requires the presence of nondeterminism in the model. In this paper, we develop techniques for checking fast termination of pVASS with nondeterminism. That is, for every initial configuration of size n, we consider the worst expected number of transitions needed to reach a configuration with some counter negative (the expected termination time). We show that the problem whether the asymptotic expected termination time is linear is decidable in polynomial time for a certain natural class of pVASS with nondeterminism. Furthermore, we show the following dichotomy: if the asymptotic expected termination time is not linear, then it is at least quadratic, i.e., in Ω(n2).","lang":"eng"}],"doi":"10.1007/978-3-030-31784-3_27"},{"date_published":"2019-04-23T00:00:00Z","oa":1,"author":[{"first_name":"Josef","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec"},{"last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Nowak","first_name":"Martin A.","full_name":"Nowak, Martin A."}],"abstract":[{"text":"The rate of biological evolution depends on the fixation probability and on the fixation time of new mutants. Intensive research has focused on identifying population structures that augment the fixation probability of advantageous mutants. But these amplifiers of natural selection typically increase fixation time. Here we study population structures that achieve a tradeoff between fixation probability and time. First, we show that no amplifiers can have an asymptotically lower absorption time than the well-mixed population. Then we design population structures that substantially augment the fixation probability with just a minor increase in fixation time. Finally, we show that those structures enable higher effective rate of evolution than the well-mixed population provided that the rate of generating advantageous mutants is relatively low. Our work sheds light on how population structure affects the rate of evolution. Moreover, our structures could be useful for lab-based, medical, or industrial applications of evolutionary optimization.","lang":"eng"}],"day":"23","doi":"10.1038/s42003-019-0373-y","article_type":"original","intvolume":" 2","year":"2019","date_created":"2019-12-23T13:36:50Z","publication_identifier":{"issn":["2399-3642"]},"external_id":{"isi":["000465425700006"],"pmid":["31044163"]},"pmid":1,"title":"Population structure determines the tradeoff between fixation probability and fixation time","has_accepted_license":"1","citation":{"apa":"Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2019). Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. Springer Nature. https://doi.org/10.1038/s42003-019-0373-y","chicago":"Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.” Communications Biology. Springer Nature, 2019. https://doi.org/10.1038/s42003-019-0373-y.","ieee":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Population structure determines the tradeoff between fixation probability and fixation time,” Communications Biology, vol. 2. Springer Nature, 2019.","ista":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2019. Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. 2, 138.","ama":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. 2019;2. doi:10.1038/s42003-019-0373-y","mla":"Tkadlec, Josef, et al. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.” Communications Biology, vol. 2, 138, Springer Nature, 2019, doi:10.1038/s42003-019-0373-y.","short":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Communications Biology 2 (2019)."},"publisher":"Springer Nature","article_processing_charge":"No","file":[{"relation":"main_file","checksum":"d1a69bfe73767e4246f0a38e4e1554dd","access_level":"open_access","file_id":"7211","date_created":"2019-12-23T13:39:30Z","file_name":"2019_CommBio_Tkadlec.pdf","creator":"dernst","content_type":"application/pdf","date_updated":"2020-07-14T12:47:53Z","file_size":1670274}],"ddc":["000"],"file_date_updated":"2020-07-14T12:47:53Z","language":[{"iso":"eng"}],"publication":"Communications Biology","project":[{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"scopus_import":"1","type":"journal_article","department":[{"_id":"KrCh"}],"month":"04","publication_status":"published","volume":2,"isi":1,"date_updated":"2026-04-08T07:24:11Z","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","article_number":"138","related_material":{"record":[{"id":"7196","status":"public","relation":"part_of_dissertation"}]},"_id":"7210","oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"quality_controlled":"1","related_material":{"record":[{"relation":"later_version","id":"11402","status":"public"}]},"oa_version":"Preprint","_id":"7402","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"1-13","month":"06","publication_status":"published","isi":1,"status":"public","date_updated":"2025-07-10T11:54:35Z","main_file_link":[{"url":"https://arxiv.org/abs/1802.03642","open_access":"1"}],"scopus_import":"1","type":"conference","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"publication":"34th Annual ACM/IEEE Symposium on Logic in Computer Science","citation":{"short":"K. Chatterjee, L. Doyen, in:, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2019, pp. 1–13.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” 34th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2019, pp. 1–13, doi:10.1109/lics.2019.8785706.","ama":"Chatterjee K, Doyen L. Graph planning with expected finite horizon. In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2019:1-13. doi:10.1109/lics.2019.8785706","ieee":"K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,” in 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Vancouver, BC, Canada, 2019, pp. 1–13.","ista":"Chatterjee K, Doyen L. 2019. Graph planning with expected finite horizon. 34th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 1–13.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” In 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. IEEE, 2019. https://doi.org/10.1109/lics.2019.8785706.","apa":"Chatterjee, K., & Doyen, L. (2019). Graph planning with expected finite horizon. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Vancouver, BC, Canada: IEEE. https://doi.org/10.1109/lics.2019.8785706"},"publisher":"IEEE","article_processing_charge":"No","year":"2019","date_created":"2020-01-29T16:18:33Z","publication_identifier":{"isbn":["9781728136080"]},"external_id":{"isi":["000805002800001"],"arxiv":["1802.03642"]},"title":"Graph planning with expected finite horizon","doi":"10.1109/lics.2019.8785706","date_published":"2019-06-01T00:00:00Z","oa":1,"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"}],"arxiv":1,"abstract":[{"text":"Graph planning gives rise to fundamental algorithmic questions such as shortest path, traveling salesman problem, etc. A classical problem in discrete planning is to consider a weighted graph and construct a path that maximizes the sum of weights for a given time horizon T. However, in many scenarios, the time horizon is not fixed, but the stopping time is chosen according to some distribution such that the expected stopping time is T. If the stopping time distribution is not known, then to ensure robustness, the distribution is chosen by an adversary, to represent the worst-case scenario. A stationary plan for every vertex always chooses the same outgoing edge. For fixed horizon or fixed stopping-time distribution, stationary plans are not sufficient for optimality. Quite surprisingly we show that when an adversary chooses the stopping-time distribution with expected stopping time T, then stationary plans are sufficient. While computing optimal stationary plans for fixed horizon is NP-complete, we show that computing optimal stationary plans under adversarial stopping-time distribution can be achieved in polynomial time. Consequently, our polynomial-time algorithm for adversarial stopping time also computes an optimal plan among all possible plans.","lang":"eng"}],"conference":{"location":"Vancouver, BC, Canada","start_date":"2019-06-24","end_date":"2019-06-27","name":"LICS: Logic in Computer Science"},"day":"01"},{"quality_controlled":"1","article_number":"129","related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"oa_version":"Published Version","_id":"6780","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","license":"https://creativecommons.org/licenses/by-nc/4.0/","month":"10","publication_status":"published","volume":3,"date_updated":"2026-07-03T22:35:23Z","status":"public","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"ec_funded":1,"scopus_import":"1","type":"conference","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications ","project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"citation":{"short":"M. Huang, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , ACM, 2019.","ama":"Huang M, Fu H, Chatterjee K, Goharshady AK. Modular verification for almost-sure termination of probabilistic programs. In: Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . Vol 3. ACM; 2019. doi:10.1145/3360555","mla":"Huang, Mingzhang, et al. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , vol. 3, 129, ACM, 2019, doi:10.1145/3360555.","ista":"Huang M, Fu H, Chatterjee K, Goharshady AK. 2019. Modular verification for almost-sure termination of probabilistic programs. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 129.","ieee":"M. Huang, H. Fu, K. Chatterjee, and A. K. Goharshady, “Modular verification for almost-sure termination of probabilistic programs,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Athens, Greece, 2019, vol. 3.","apa":"Huang, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (2019). Modular verification for almost-sure termination of probabilistic programs. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360555","chicago":"Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Vol. 3. ACM, 2019. https://doi.org/10.1145/3360555."},"publisher":"ACM","article_processing_charge":"No","file":[{"date_updated":"2020-07-14T12:47:40Z","file_size":1024643,"creator":"akafshda","file_name":"oopsla-2019.pdf","content_type":"application/pdf","date_created":"2019-08-12T15:40:57Z","file_id":"6807","relation":"main_file","checksum":"3482d8ace6fb4991eb7810e3b70f1b9f","access_level":"open_access"},{"file_id":"7821","access_level":"open_access","checksum":"4e5a6fb2b59a75222a4e8335a5a60eac","relation":"main_file","content_type":"application/pdf","creator":"dernst","file_name":"2019_ACM_Huang.pdf","file_size":538579,"date_updated":"2020-07-14T12:47:40Z","date_created":"2020-05-12T15:15:14Z"}],"ddc":["000"],"file_date_updated":"2020-07-14T12:47:40Z","intvolume":" 3","date_created":"2019-08-09T09:54:20Z","year":"2019","external_id":{"arxiv":["1901.06087"]},"title":"Modular verification for almost-sure termination of probabilistic programs","has_accepted_license":"1","doi":"10.1145/3360555","date_published":"2019-10-01T00:00:00Z","oa":1,"author":[{"first_name":"Mingzhang","full_name":"Huang, Mingzhang","last_name":"Huang"},{"full_name":"Fu, Hongfei","first_name":"Hongfei","last_name":"Fu"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584"}],"arxiv":1,"conference":{"end_date":"2019-10-25","name":"OOPSLA: Object-oriented Programming, Systems, Languages and Applications","location":"Athens, Greece","start_date":"2019-10-23"},"abstract":[{"lang":"eng","text":"In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a\r\ngiven probabilistic program terminates with probability 1. Scalable approaches for program analysis often\r\nrely on modularity as their theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule)\r\nof Floyd-Hoare logic provides the foundation for modular analysis. Extension of this rule to almost-sure\r\ntermination of probabilistic programs is quite tricky, and a probabilistic variant was proposed in [16]. While the\r\nproposed probabilistic variant cautiously addresses the key issue of integrability, we show that the proposed\r\nmodular rule is still not sound for almost-sure termination of probabilistic programs.\r\nBesides establishing unsoundness of the previous rule, our contributions are as follows: First, we present a\r\nsound modular rule for almost-sure termination of probabilistic programs. Our approach is based on a novel\r\nnotion of descent supermartingales. Second, for algorithmic approaches, we consider descent supermartingales\r\nthat are linear and show that they can be synthesized in polynomial time. Finally, we present experimental\r\nresults on a variety of benchmarks and several natural examples that model various types of nested while\r\nloops in probabilistic programs and demonstrate that our approach is able to efficiently prove their almost-sure\r\ntermination property"}],"day":"01"},{"day":"01","conference":{"location":"Limassol, Cyprus","start_date":"2019-04-08","end_date":"2019-04-12","name":"SAC: Symposium on Applied Computing"},"abstract":[{"text":"Smart contracts are programs that are stored and executed on the Blockchain and can receive, manage and transfer money (cryptocurrency units). Two important problems regarding smart contracts are formal analysis and compiler optimization. Formal analysis is extremely important, because smart contracts hold funds worth billions of dollars and their code is immutable after deployment. Hence, an undetected bug can cause significant financial losses. Compiler optimization is also crucial, because every action of a smart contract has to be executed by every node in the Blockchain network. Therefore, optimizations in compiling smart contracts can lead to significant savings in computation, time and energy.\r\n\r\nTwo classical approaches in program analysis and compiler optimization are intraprocedural and interprocedural analysis. In intraprocedural analysis, each function is analyzed separately, while interprocedural analysis considers the entire program. In both cases, the analyses are usually reduced to graph problems over the control flow graph (CFG) of the program. These graph problems are often computationally expensive. Hence, there has been ample research on exploiting structural properties of CFGs for efficient algorithms. One such well-studied property is the treewidth, which is a measure of tree-likeness of graphs. It is known that intraprocedural CFGs of structured programs have treewidth at most 6, whereas the interprocedural treewidth cannot be bounded. This result has been used as a basis for many efficient intraprocedural analyses.\r\n\r\nIn this paper, we explore the idea of exploiting the treewidth of smart contracts for formal analysis and compiler optimization. First, similar to classical programs, we show that the intraprocedural treewidth of structured Solidity and Vyper smart contracts is at most 9. Second, for global analysis, we prove that the interprocedural treewidth of structured smart contracts is bounded by 10 and, in sharp contrast with classical programs, treewidth-based algorithms can be easily applied for interprocedural analysis. Finally, we supplement our theoretical results with experiments using a tool we implemented for computing treewidth of smart contracts and show that the treewidth is much lower in practice. We use 36,764 real-world Ethereum smart contracts as benchmarks and find that they have an average treewidth of at most 3.35 for the intraprocedural case and 3.65 for the interprocedural case.\r\n","lang":"eng"}],"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Goharshady","full_name":"Goharshady, Ehsan Kafshdar","first_name":"Ehsan Kafshdar"}],"oa":1,"date_published":"2019-04-01T00:00:00Z","doi":"10.1145/3297280.3297322","has_accepted_license":"1","title":"The treewidth of smart contracts","external_id":{"isi":["000474685800052"]},"publication_identifier":{"isbn":["9781450359337"]},"date_created":"2019-05-26T21:59:15Z","year":"2019","ddc":["000"],"file_date_updated":"2020-07-14T12:47:32Z","publisher":"ACM","file":[{"access_level":"open_access","checksum":"dddc20f6d9881f23b8755eb720ec9d6f","relation":"main_file","file_id":"7827","date_created":"2020-05-14T09:50:11Z","date_updated":"2020-07-14T12:47:32Z","file_size":6937138,"content_type":"application/pdf","creator":"dernst","file_name":"2019_ACM_Chatterjee.pdf"}],"article_processing_charge":"No","citation":{"ieee":"K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol. Part F147772, pp. 400–408.","ista":"Chatterjee K, Goharshady AK, Goharshady EK. 2019. The treewidth of smart contracts. Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on Applied Computing vol. Part F147772, 400–408.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “The Treewidth of Smart Contracts.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:400–408. ACM, 2019. https://doi.org/10.1145/3297280.3297322.","apa":"Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (2019). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322","short":"K. Chatterjee, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, 2019, pp. 400–408.","mla":"Chatterjee, Krishnendu, et al. “The Treewidth of Smart Contracts.” Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, 2019, pp. 400–08, doi:10.1145/3297280.3297322.","ama":"Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; 2019:400-408. doi:10.1145/3297280.3297322"},"publication":"Proceedings of the 34th ACM Symposium on Applied Computing","language":[{"iso":"eng"}],"pubrep_id":"1070","department":[{"_id":"KrCh"}],"type":"conference","corr_author":"1","scopus_import":"1","status":"public","date_updated":"2026-07-03T22:35:23Z","isi":1,"volume":"Part F147772","publication_status":"published","month":"04","_id":"6490","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"400-408","related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"quality_controlled":"1"},{"ec_funded":1,"scopus_import":"1","type":"journal_article","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"publication":"ACM Transactions on Programming Languages and Systems","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"}],"quality_controlled":"1","article_number":"23","related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"_id":"7158","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","volume":41,"publication_status":"published","month":"11","isi":1,"date_updated":"2026-07-03T22:35:23Z","status":"public","doi":"10.1145/3363525","article_type":"original","issue":"4","date_published":"2019-11-01T00:00:00Z","oa":1,"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar"},{"last_name":"Goyal","first_name":"Prateesh","full_name":"Goyal, Prateesh"},{"orcid":"0000-0003-4783-0389","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis"}],"abstract":[{"lang":"eng","text":"Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, and so on. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, and so on. The traditional algorithms for interprocedural analysis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider possible multiple queries as required in many applications such as in alias analysis. The study of multiple queries allows us to bring in an important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect we consider is that the control flow graphs for most programs have constant treewidth.\r\n\r\nOur main contributions are simple and implementable algorithms that support multiple queries for algebraic path properties for RSMs that have constant treewidth. Our theoretical results show that our algorithms have small additional one-time preprocessing but can answer subsequent queries significantly faster as compared to the current algorithmic solutions for interprocedural dataflow analysis. We have also implemented our algorithms and evaluated their performance for performing on-demand interprocedural dataflow analysis on various domains, such as for live variable analysis and reaching definitions, on a standard benchmark set. Our experimental results align with our theoretical statements and show that after a lightweight preprocessing, on-demand queries are answered much faster than the standard existing algorithmic approaches.\r\n"}],"day":"01","citation":{"ieee":"K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.","ista":"Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 41(4), 23.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3363525.","apa":"Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3363525","short":"K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019).","ama":"Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 2019;41(4). doi:10.1145/3363525","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 23, ACM, 2019, doi:10.1145/3363525."},"file":[{"date_updated":"2020-10-08T12:58:10Z","file_size":667357,"content_type":"application/pdf","creator":"dernst","success":1,"file_name":"2019_ACMTransactions_Chatterjee.pdf","date_created":"2020-10-08T12:58:10Z","file_id":"8632","access_level":"open_access","checksum":"291cc86a07bd010d4815e177dac57b70","relation":"main_file"}],"article_processing_charge":"No","publisher":"ACM","file_date_updated":"2020-10-08T12:58:10Z","ddc":["000"],"intvolume":" 41","year":"2019","date_created":"2019-12-09T08:33:33Z","publication_identifier":{"issn":["0164-0925"]},"external_id":{"isi":["000564108400004"]},"title":"Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth","has_accepted_license":"1"},{"ddc":["004"],"file_date_updated":"2020-07-14T12:47:29Z","publisher":"ACM","file":[{"file_id":"6379","checksum":"fbfbcd5a0c7a743862bfc3045539a614","access_level":"open_access","relation":"main_file","file_size":1023934,"date_updated":"2020-07-14T12:47:29Z","content_type":"application/pdf","creator":"dernst","file_name":"2019_ACM_Chatterjee.pdf","date_created":"2019-05-06T12:09:27Z"}],"article_processing_charge":"No","citation":{"ama":"Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; 2019:374-381. doi:10.1145/3297280.3297319","mla":"Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, 2019, pp. 374–81, doi:10.1145/3297280.3297319.","short":"K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, 2019, pp. 374–381.","apa":"Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:374–81. ACM, 2019. https://doi.org/10.1145/3297280.3297319.","ieee":"K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol. Part F147772, pp. 374–381.","ista":"Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. Proceedings of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing vol. Part F147772, 374–381."},"has_accepted_license":"1","title":"Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving","publication_identifier":{"isbn":["9781450359337"]},"external_id":{"isi":["000474685800049"]},"year":"2019","date_created":"2019-05-06T12:11:36Z","doi":"10.1145/3297280.3297319","day":"01","abstract":[{"text":"In today's cryptocurrencies, Hashcash proof of work is the most commonly-adopted approach to mining. In Hashcash, when a miner decides to add a block to the chain, she has to solve the difficult computational puzzle of inverting a hash function. While Hashcash has been successfully adopted in both Bitcoin and Ethereum, it has attracted significant and harsh criticism due to its massive waste of electricity, its carbon footprint and environmental effects, and the inherent lack of usefulness in inverting a hash function. Various other mining protocols have been suggested, including proof of stake, in which a miner's chance of adding the next block is proportional to her current balance. However, such protocols lead to a higher entry cost for new miners who might not still have any stake in the cryptocurrency, and can in the worst case lead to an oligopoly, where the rich have complete control over mining. In this paper, we propose Hybrid Mining: a new mining protocol that combines solving real-world useful problems with Hashcash. Our protocol allows new miners to join the network by taking part in Hashcash mining without having to own an initial stake. It also allows nodes of the network to submit hard computational problems whose solutions are of interest in the real world, e.g.~protein folding problems. Then, miners can choose to compete in solving these problems, in lieu of Hashcash, for adding a new block. Hence, Hybrid Mining incentivizes miners to solve useful problems, such as hard computational problems arising in biology, in a distributed manner. It also gives researchers in other areas an easy-to-use tool to outsource their hard computations to the blockchain network, which has enormous computational power, by paying a reward to the miner who solves the problem for them. Moreover, our protocol provides strong security guarantees and is at least as resilient to double spending as Bitcoin.","lang":"eng"}],"conference":{"start_date":"2019-04-08","location":"Limassol, Cyprus","end_date":"2019-04-12","name":"ACM Symposium on Applied Computing"},"oa":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady"},{"full_name":"Pourdamghani, Arash","first_name":"Arash","last_name":"Pourdamghani"}],"date_published":"2019-04-01T00:00:00Z","_id":"6378","page":"374-381","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Submitted Version","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8934"}]},"quality_controlled":"1","date_updated":"2026-07-03T22:35:24Z","status":"public","publication_status":"published","volume":"Part F147772","month":"04","isi":1,"department":[{"_id":"KrCh"}],"type":"conference","scopus_import":"1","ec_funded":1,"project":[{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"}],"publication":"Proceedings of the 34th ACM Symposium on Applied Computing","language":[{"iso":"eng"}],"pubrep_id":"1069"},{"abstract":[{"lang":"eng","text":"We consider the problem of expected cost analysis over nondeterministic probabilistic programs,\r\nwhich aims at automated methods for analyzing the resource-usage of such programs.\r\nPrevious approaches for this problem could only handle nonnegative bounded costs.\r\nHowever, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols,\r\nboth positive and negative costs are necessary and the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and efficient approach to obtain polynomial bounds on the\r\nexpected accumulated cost of nondeterministic probabilistic programs.\r\nOur approach can handle (a) general positive and negative costs with bounded updates in\r\nvariables; and (b) nonnegative costs with general updates to variables.\r\nWe show that several natural examples which could not be\r\nhandled by previous approaches are captured in our framework.\r\n\r\nMoreover, our approach leads to an efficient polynomial-time algorithm, while no\r\nprevious approach for cost analysis of probabilistic programs could guarantee polynomial runtime.\r\nFinally, we show the effectiveness of our approach using experimental results on a variety of programs for which we efficiently synthesize tight resource-usage bounds."}],"conference":{"location":"Phoenix, AZ, United States","start_date":"2019-06-22","name":"PLDI: Conference on Programming Language Design and Implementation","end_date":"2019-06-26"},"day":"08","date_published":"2019-06-08T00:00:00Z","author":[{"last_name":"Wang","full_name":"Wang, Peixin","first_name":"Peixin"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","last_name":"Fu","full_name":"Fu, Hongfei","first_name":"Hongfei"},{"last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Xudong","full_name":"Qin, Xudong","last_name":"Qin"},{"last_name":"Shi","full_name":"Shi, Wenjun","first_name":"Wenjun"}],"arxiv":1,"oa":1,"doi":"10.1145/3314221.3314581","title":"Cost analysis of nondeterministic probabilistic programs","has_accepted_license":"1","year":"2019","date_created":"2019-03-25T10:13:25Z","external_id":{"arxiv":["1902.04659"],"isi":["000523190300014"]},"file_date_updated":"2020-07-14T12:47:20Z","ddc":["000"],"citation":{"chicago":"Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.” In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 204–20. Association for Computing Machinery, 2019. https://doi.org/10.1145/3314221.3314581.","apa":"Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3314221.3314581","ista":"Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 204–220.","ieee":"P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Phoenix, AZ, United States, 2019, pp. 204–220.","ama":"Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of nondeterministic probabilistic programs. In: PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2019:204-220. doi:10.1145/3314221.3314581","mla":"Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.” PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–20, doi:10.1145/3314221.3314581.","short":"P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–220."},"article_processing_charge":"No","publisher":"Association for Computing Machinery","file":[{"date_created":"2019-03-25T10:11:22Z","file_size":4051066,"date_updated":"2020-07-14T12:47:20Z","content_type":"application/pdf","file_name":"paper.pdf","creator":"akafshda","access_level":"open_access","checksum":"703a5e9b8c8587f2a44085ffd9a4db64","relation":"main_file","file_id":"6176"}],"publication":"PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","keyword":["Program Cost Analysis","Program Termination","Probabilistic Programs","Martingales"],"project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"type":"conference","department":[{"_id":"KrCh"}],"ec_funded":1,"scopus_import":"1","status":"public","date_updated":"2026-07-03T22:35:25Z","isi":1,"month":"06","publication_status":"published","_id":"6175","oa_version":"Submitted Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","page":"204-220","quality_controlled":"1","related_material":{"record":[{"relation":"earlier_version","id":"5457","status":"public"},{"status":"public","id":"8934","relation":"dissertation_contains"}]}},{"citation":{"short":"K. Chatterjee, H. Fu, A.K. Goharshady, ACM Transactions on Programming Languages and Systems 41 (2019).","mla":"Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 20, ACM, 2019, doi:10.1145/3339984.","ama":"Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 2019;41(4). doi:10.1145/3339984","ieee":"K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis of recursive programs,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.","ista":"Chatterjee K, Fu H, Goharshady AK. 2019. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 41(4), 20.","apa":"Chatterjee, K., Fu, H., & Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3339984","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3339984."},"article_processing_charge":"No","publisher":"ACM","title":"Non-polynomial worst-case analysis of recursive programs","year":"2019","date_created":"2019-11-13T08:33:43Z","intvolume":" 41","external_id":{"isi":["000564108400001"],"arxiv":["1705.00317"]},"article_type":"original","issue":"4","doi":"10.1145/3339984","abstract":[{"lang":"eng","text":"We study the problem of developing efficient approaches for proving\r\nworst-case bounds of non-deterministic recursive programs. Ranking functions\r\nare sound and complete for proving termination and worst-case bounds of\r\nnonrecursive programs. First, we apply ranking functions to recursion,\r\nresulting in measure functions. We show that measure functions provide a sound\r\nand complete approach to prove worst-case bounds of non-deterministic recursive\r\nprograms. Our second contribution is the synthesis of measure functions in\r\nnonpolynomial forms. We show that non-polynomial measure functions with\r\nlogarithm and exponentiation can be synthesized through abstraction of\r\nlogarithmic or exponentiation terms, Farkas' Lemma, and Handelman's Theorem\r\nusing linear programming. While previous methods obtain worst-case polynomial\r\nbounds, our approach can synthesize bounds of the form $\\mathcal{O}(n\\log n)$\r\nas well as $\\mathcal{O}(n^r)$ where $r$ is not an integer. We present\r\nexperimental results to demonstrate that our approach can obtain efficiently\r\nworst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the\r\ndivide-and-conquer algorithm for the Closest-Pair problem, where we obtain\r\n$\\mathcal{O}(n \\log n)$ worst-case bound, and (ii) Karatsuba's algorithm for\r\npolynomial multiplication and Strassen's algorithm for matrix multiplication,\r\nwhere we obtain $\\mathcal{O}(n^r)$ bound such that $r$ is not an integer and\r\nclose to the best-known bounds for the respective algorithms."}],"day":"01","date_published":"2019-10-01T00:00:00Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584"}],"arxiv":1,"oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"7014","oa_version":"Preprint","article_number":"20","quality_controlled":"1","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"639"},{"id":"8934","status":"public","relation":"dissertation_contains"}]},"status":"public","date_updated":"2026-07-03T22:35:26Z","main_file_link":[{"url":"https://arxiv.org/abs/1705.00317","open_access":"1"}],"isi":1,"volume":41,"month":"10","publication_status":"published","type":"journal_article","department":[{"_id":"KrCh"}],"ec_funded":1,"scopus_import":"1","publication":"ACM Transactions on Programming Languages and Systems","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}]},{"volume":3,"publication_status":"published","month":"01","OA_type":"hybrid","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2026-07-03T22:35:28Z","status":"public","related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"article_number":"53","quality_controlled":"1","_id":"6380","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","language":[{"iso":"eng"}],"pubrep_id":"1056","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"publication":"Proceedings of the ACM on Programming Languages","scopus_import":"1","ec_funded":1,"department":[{"_id":"KrCh"}],"type":"journal_article","OA_place":"publisher","publication_identifier":{"issn":["2475-1421"]},"date_created":"2019-05-06T12:18:17Z","year":"2019","intvolume":" 3","has_accepted_license":"1","title":"Efficient parameterized algorithms for data packing","article_processing_charge":"Yes (in subscription journal)","file":[{"content_type":"application/pdf","file_name":"2019_ACM_POPL_Chatterjee.pdf","creator":"dernst","file_size":1294962,"date_updated":"2020-07-14T12:47:29Z","date_created":"2019-05-06T12:23:11Z","file_id":"6381","checksum":"c157752f96877b36685ad7063ada4524","access_level":"open_access","relation":"main_file"}],"publisher":"ACM","citation":{"short":"K. Chatterjee, A.K. Goharshady, N. Okati, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 3 (2019).","ama":"Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 2019;3(POPL). doi:10.1145/3290366","mla":"Chatterjee, Krishnendu, et al. “Efficient Parameterized Algorithms for Data Packing.” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, 53, ACM, 2019, doi:10.1145/3290366.","ista":"Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 3(POPL), 53.","ieee":"K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL. ACM, 2019.","apa":"Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. ACM. https://doi.org/10.1145/3290366","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.” Proceedings of the ACM on Programming Languages. ACM, 2019. https://doi.org/10.1145/3290366."},"file_date_updated":"2020-07-14T12:47:29Z","ddc":["004"],"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar"},{"first_name":"Nastaran","full_name":"Okati, Nastaran","last_name":"Okati"},{"last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas"}],"oa":1,"date_published":"2019-01-01T00:00:00Z","day":"01","abstract":[{"text":"There is a huge gap between the speeds of modern caches and main memories, and therefore cache misses account for a considerable loss of efficiency in programs. The predominant technique to address this issue has been Data Packing: data elements that are frequently accessed within time proximity are packed into the same cache block, thereby minimizing accesses to the main memory. We consider the algorithmic problem of Data Packing on a two-level memory system. Given a reference sequence R of accesses to data elements, the task is to partition the elements into cache blocks such that the number of cache misses on R is minimized. The problem is notoriously difficult: it is NP-hard even when the cache has size 1, and is hard to approximate for any cache size larger than 4. Therefore, all existing techniques for Data Packing are based on heuristics and lack theoretical guarantees. In this work, we present the first positive theoretical results for Data Packing, along with new and stronger negative results. We consider the problem under the lens of the underlying access hypergraphs, which are hypergraphs of affinities between the data elements, where the order of an access hypergraph corresponds to the size of the affinity group. We study the problem parameterized by the treewidth of access hypergraphs, which is a standard notion in graph theory to measure the closeness of a graph to a tree. Our main results are as follows: We show there is a number q* depending on the cache parameters such that (a) if the access hypergraph of order q* has constant treewidth, then there is a linear-time algorithm for Data Packing; (b)the Data Packing problem remains NP-hard even if the access hypergraph of order q*-1 has constant treewidth. Thus, we establish a fine-grained dichotomy depending on a single parameter, namely, the highest order among access hypegraphs that have constant treewidth; and establish the optimal value q* of this parameter. Finally, we present an experimental evaluation of a prototype implementation of our algorithm. Our results demonstrate that, in practice, access hypergraphs of many commonly-used algorithms have small treewidth. We compare our approach with several state-of-the-art heuristic-based algorithms and show that our algorithm leads to significantly fewer cache-misses. ","lang":"eng"}],"doi":"10.1145/3290366","acknowledgement":"The research was partially supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC\r\nStarting Grant (279307: Graph Games), and the IBM PhD Fellowship program.","issue":"POPL","article_type":"original"},{"month":"05","publication_status":"published","isi":1,"date_updated":"2026-07-03T22:35:29Z","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.07986"}],"quality_controlled":"1","article_number":"8751326","related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"oa_version":"Preprint","_id":"6056","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"publication":"IEEE International Conference on Blockchain and Cryptocurrency","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies"}],"ec_funded":1,"scopus_import":"1","type":"conference","department":[{"_id":"KrCh"}],"year":"2019","date_created":"2019-02-26T09:03:15Z","external_id":{"isi":["000491257000076"],"arxiv":["1902.07986"]},"title":"Probabilistic smart contracts: Secure randomness on the blockchain","citation":{"mla":"Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” IEEE International Conference on Blockchain and Cryptocurrency, 8751326, IEEE, 2019, doi:10.1109/BLOC.2019.8751326.","ama":"Chatterjee K, Goharshady AK, Pourdamghani A. Probabilistic smart contracts: Secure randomness on the blockchain. In: IEEE International Conference on Blockchain and Cryptocurrency. IEEE; 2019. doi:10.1109/BLOC.2019.8751326","short":"K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, IEEE International Conference on Blockchain and Cryptocurrency, IEEE, 2019.","apa":"Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE. https://doi.org/10.1109/BLOC.2019.8751326","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” In IEEE International Conference on Blockchain and Cryptocurrency. IEEE, 2019. https://doi.org/10.1109/BLOC.2019.8751326.","ista":"Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Probabilistic smart contracts: Secure randomness on the blockchain. IEEE International Conference on Blockchain and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency, 8751326.","ieee":"K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart contracts: Secure randomness on the blockchain,” in IEEE International Conference on Blockchain and Cryptocurrency, Seoul, Korea, 2019."},"publisher":"IEEE","article_processing_charge":"No","date_published":"2019-05-01T00:00:00Z","oa":1,"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584"},{"last_name":"Pourdamghani","first_name":"Arash","full_name":"Pourdamghani, Arash"}],"arxiv":1,"abstract":[{"text":"In today's programmable blockchains, smart contracts are limited to being deterministic and non-probabilistic. This lack of randomness is a consequential limitation, given that a wide variety of real-world financial contracts, such as casino games and lotteries, depend entirely on randomness. As a result, several ad-hoc random number generation approaches have been developed to be used in smart contracts. These include ideas such as using an oracle or relying on the block hash. However, these approaches are manipulatable, i.e. their output can be tampered with by parties who might not be neutral, such as the owner of the oracle or the miners.We propose a novel game-theoretic approach for generating provably unmanipulatable pseudorandom numbers on the blockchain. Our approach allows smart contracts to access a trustworthy source of randomness that does not rely on potentially compromised miners or oracles, hence enabling the creation of a new generation of smart contracts that are not limited to being non-probabilistic and can be drawn from the much more general class of probabilistic programs.","lang":"eng"}],"conference":{"name":"IEEE International Conference on Blockchain and Cryptocurrency","end_date":"2019-05-17","location":"Seoul, Korea","start_date":"2019-05-14"},"day":"01","doi":"10.1109/BLOC.2019.8751326"},{"project":[{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"}],"publication":"22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"type":"conference","scopus_import":"1","ec_funded":1,"alternative_title":["EPiC Series in Computing"],"status":"public","date_updated":"2025-07-10T11:50:02Z","month":"10","publication_status":"published","volume":57,"page":"233-253","_id":"10883","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","quality_controlled":"1","day":"23","abstract":[{"lang":"eng","text":"Solving parity games, which are equivalent to modal μ-calculus model checking, is a central algorithmic problem in formal methods, with applications in reactive synthesis, program repair, verification of branching-time properties, etc. Besides the standard compu- tation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well as for infinite-state systems with finite quotient. Consider parity games on graphs with n vertices and parity conditions with d priorities. While there is a rich literature of explicit algorithms for parity games, the main results for set-based symbolic algorithms are as follows: (a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations and O(n) symbolic space. In this work, our contributions are as follows: (1) We present a black-box set-based symbolic algorithm based on the explicit progress measure algorithm. Two important consequences of our algorithm are as follows: (a) a set-based symbolic algorithm for parity games that requires quasi-polynomially many symbolic operations and O(n) symbolic space; and (b) any future improvement in progress measure based explicit algorithms immediately imply an efficiency improvement in our set-based symbolic algorithm for parity games. (2) We present a set-based symbolic algorithm that requires quasi-polynomially many symbolic operations and O(d · log n) symbolic space. Moreover, for the important special case of d ≤ log n, our algorithm requires only polynomially many symbolic operations and poly-logarithmic symbolic space."}],"conference":{"end_date":"2018-11-21","name":"LPAR: Logic for Programming, Artificial Intelligence and Reasoning","start_date":"2018-11-17","location":"Awassa, Ethiopia"},"oa":1,"arxiv":1,"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Dvořák","full_name":"Dvořák, Wolfgang","first_name":"Wolfgang"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"full_name":"Svozil, Alexander","first_name":"Alexander","last_name":"Svozil"}],"date_published":"2018-10-23T00:00:00Z","acknowledgement":"A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K.C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Starting grant (279307: Graph Games). For M.H the research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) /ERC Grant Agreement no. 340506.","doi":"10.29007/5z5k","has_accepted_license":"1","title":"Quasipolynomial set-based symbolic algorithms for parity games","publication_identifier":{"issn":["2398-7340"]},"external_id":{"arxiv":["1909.04983"]},"intvolume":" 57","date_created":"2022-03-18T12:46:32Z","year":"2018","ddc":["000"],"file_date_updated":"2022-05-17T07:51:08Z","article_processing_charge":"No","file":[{"relation":"main_file","checksum":"1229aa8640bd6db610c85decf2265480","access_level":"open_access","file_id":"11392","date_created":"2022-05-17T07:51:08Z","file_size":720893,"date_updated":"2022-05-17T07:51:08Z","success":1,"creator":"dernst","file_name":"2018_EPiCs_Chatterjee.pdf","content_type":"application/pdf"}],"publisher":"EasyChair","citation":{"ieee":"K. Chatterjee, W. Dvořák, M. Henzinger, and A. Svozil, “Quasipolynomial set-based symbolic algorithms for parity games,” in 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 2018, vol. 57, pp. 233–253.","ista":"Chatterjee K, Dvořák W, Henzinger M, Svozil A. 2018. Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR: Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k.","apa":"Chatterjee, K., Dvořák, W., Henzinger, M., & Svozil, A. (2018). Quasipolynomial set-based symbolic algorithms for parity games. In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57, pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k","short":"K. Chatterjee, W. Dvořák, M. Henzinger, A. Svozil, in:, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair, 2018, pp. 233–253.","ama":"Chatterjee K, Dvořák W, Henzinger M, Svozil A. Quasipolynomial set-based symbolic algorithms for parity games. In: 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Vol 57. EasyChair; 2018:233-253. doi:10.29007/5z5k","mla":"Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol. 57, EasyChair, 2018, pp. 233–53, doi:10.29007/5z5k."}},{"doi":"10.24963/ijcai.2018/652","acknowledgement":"This research was supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and an ERC Start Grant (279307:Graph Games).\r\n","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Elgyütt","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian","full_name":"Elgyütt, Adrian"},{"first_name":"Petr","full_name":"Novotny, Petr","last_name":"Novotny","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rouillé","first_name":"Owen","full_name":"Rouillé, Owen"}],"arxiv":1,"oa":1,"date_published":"2018-07-01T00:00:00Z","day":"01","abstract":[{"lang":"eng","text":"Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it."}],"conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2018-07-19","location":"Stockholm, Sweden","start_date":"2018-07-13"},"publisher":"IJCAI","article_processing_charge":"No","citation":{"short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.","mla":"Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.","ama":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:10.24963/ijcai.2018/652","ista":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.","ieee":"K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.","chicago":"Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652.","apa":"Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652"},"external_id":{"isi":["000764175404117"],"arxiv":["1804.10601"]},"date_created":"2018-12-11T11:44:13Z","year":"2018","intvolume":" 2018","title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","scopus_import":"1","ec_funded":1,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"type":"conference","language":[{"iso":"eng"}],"project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"}],"quality_controlled":"1","page":"4692 - 4699","_id":"24","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","isi":1,"month":"07","volume":2018,"publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/1804.10601","open_access":"1"}],"publist_id":"8031","status":"public","date_updated":"2025-04-14T13:51:04Z"},{"doi":"10.24963/ijcai.2018/662","acknowledgement":"∗This work has been supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games). This research was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). ","date_published":"2018-07-01T00:00:00Z","author":[{"last_name":"Horák","first_name":"Karel","full_name":"Horák, Karel"},{"full_name":"Bošanský, Branislav","first_name":"Branislav","last_name":"Bošanský"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"abstract":[{"lang":"eng","text":"Partially observable Markov decision processes (POMDPs) are the standard models for planning under uncertainty with both finite and infinite horizon. Besides the well-known discounted-sum objective, indefinite-horizon objective (aka Goal-POMDPs) is another classical objective for POMDPs. In this case, given a set of target states and a positive cost for each transition, the optimization objective is to minimize the expected total cost until a target state is reached. In the literature, RTDP-Bel or heuristic search value iteration (HSVI) have been used for solving Goal-POMDPs. Neither of these algorithms has theoretical convergence guarantees, and HSVI may even fail to terminate its trials. We give the following contributions: (1) We discuss the challenges introduced in Goal-POMDPs and illustrate how they prevent the original HSVI from converging. (2) We present a novel algorithm inspired by HSVI, termed Goal-HSVI, and show that our algorithm has convergence guarantees. (3) We show that Goal-HSVI outperforms RTDP-Bel on a set of well-known examples."}],"conference":{"location":"Stockholm, Sweden","start_date":"2018-07-13","name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2018-07-19"},"day":"01","citation":{"short":"K. Horák, B. Bošanský, K. Chatterjee, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4764–4770.","ama":"Horák K, Bošanský B, Chatterjee K. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Vol 2018-July. IJCAI; 2018:4764-4770. doi:10.24963/ijcai.2018/662","mla":"Horák, Karel, et al. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018–July, IJCAI, 2018, pp. 4764–70, doi:10.24963/ijcai.2018/662.","ista":"Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July, 4764–4770.","ieee":"K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.","apa":"Horák, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/662","chicago":"Horák, Karel, Branislav Bošanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018–July:4764–70. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/662."},"article_processing_charge":"No","publisher":"IJCAI","ddc":["000"],"date_created":"2018-12-11T11:44:13Z","year":"2018","external_id":{"isi":["000764175404127"]},"title":"Goal-HSVI: Heuristic search value iteration for goal-POMDPs","ec_funded":1,"scopus_import":"1","type":"conference","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","page":"4764 - 4770","_id":"25","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"volume":"2018-July","month":"07","publication_status":"published","date_updated":"2026-06-18T18:34:17Z","status":"public","publist_id":"8030","main_file_link":[{"url":"https://doi.org/10.24963/ijcai.2018/662","open_access":"1"}]},{"oa":1,"author":[{"first_name":"Moshe","full_name":"Hoffman, Moshe","last_name":"Hoffman"},{"full_name":"Hilbe, Christian","first_name":"Christian","orcid":"0000-0001-5116-955X","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","last_name":"Hilbe"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"date_published":"2018-05-28T00:00:00Z","day":"28","abstract":[{"text":"People sometimes make their admirable deeds and accomplishments hard to spot, such as by giving anonymously or avoiding bragging. Such ‘buried’ signals are hard to reconcile with standard models of signalling or indirect reciprocity, which motivate costly pro-social behaviour by reputational gains. To explain these phenomena, we design a simple game theory model, which we call the signal-burying game. This game has the feature that senders can bury their signal by deliberately reducing the probability of the signal being observed. If the signal is observed, however, it is identified as having been buried. We show under which conditions buried signals can be maintained, using static equilibrium concepts and calculations of the evolutionary dynamics. We apply our analysis to shed light on a number of otherwise puzzling social phenomena, including modesty, anonymous donations, subtlety in art and fashion, and overeagerness.","lang":"eng"}],"doi":"10.1038/s41562-018-0354-z","acknowledgement":"This work was supported by a grant from the John Templeton Foundation and by the Office of Naval Research Grant N00014-16-1-2914 (M.A.N.). C.H. acknowledges generous support from the ISTFELLOW programme and by the Schrödinger scholarship of the Austrian Science Fund (FWF) J3475.","article_type":"original","external_id":{"isi":["000435551300009"]},"intvolume":" 2","date_created":"2018-12-11T11:45:39Z","year":"2018","has_accepted_license":"1","title":"The signal-burying game can explain why we obscure positive traits and good deeds","article_processing_charge":"No","file":[{"date_created":"2019-11-19T08:17:23Z","creator":"dernst","file_name":"2018_NatureHumanBeh_Hoffman.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:54Z","file_size":194734,"relation":"main_file","access_level":"open_access","checksum":"32efaf06a597495c184df91b3fbb19c0","file_id":"7051"}],"publisher":"Nature Publishing Group","citation":{"ieee":"M. Hoffman, C. Hilbe, and M. Nowak, “The signal-burying game can explain why we obscure positive traits and good deeds,” Nature Human Behaviour, vol. 2. Nature Publishing Group, pp. 397–404, 2018.","ista":"Hoffman M, Hilbe C, Nowak M. 2018. The signal-burying game can explain why we obscure positive traits and good deeds. Nature Human Behaviour. 2, 397–404.","apa":"Hoffman, M., Hilbe, C., & Nowak, M. (2018). The signal-burying game can explain why we obscure positive traits and good deeds. Nature Human Behaviour. Nature Publishing Group. https://doi.org/10.1038/s41562-018-0354-z","chicago":"Hoffman, Moshe, Christian Hilbe, and Martin Nowak. “The Signal-Burying Game Can Explain Why We Obscure Positive Traits and Good Deeds.” Nature Human Behaviour. Nature Publishing Group, 2018. https://doi.org/10.1038/s41562-018-0354-z.","short":"M. Hoffman, C. Hilbe, M. Nowak, Nature Human Behaviour 2 (2018) 397–404.","mla":"Hoffman, Moshe, et al. “The Signal-Burying Game Can Explain Why We Obscure Positive Traits and Good Deeds.” Nature Human Behaviour, vol. 2, Nature Publishing Group, 2018, pp. 397–404, doi:10.1038/s41562-018-0354-z.","ama":"Hoffman M, Hilbe C, Nowak M. The signal-burying game can explain why we obscure positive traits and good deeds. Nature Human Behaviour. 2018;2:397-404. doi:10.1038/s41562-018-0354-z"},"file_date_updated":"2020-07-14T12:45:54Z","ddc":["000"],"language":[{"iso":"eng"}],"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7"}],"publication":"Nature Human Behaviour","corr_author":"1","scopus_import":"1","ec_funded":1,"department":[{"_id":"KrCh"}],"type":"journal_article","volume":2,"month":"05","publication_status":"published","isi":1,"publist_id":"7588","date_updated":"2025-04-15T06:50:21Z","status":"public","related_material":{"link":[{"url":"https://ist.ac.at/en/news/the-logic-of-modesty-why-it-pays-to-be-humble/","description":"News on IST Homepage","relation":"press_release"}]},"quality_controlled":"1","oa_version":"Submitted Version","_id":"293","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"397 - 404"},{"project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"type":"conference","scopus_import":"1","ec_funded":1,"alternative_title":["LNCS"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publist_id":"7584","date_updated":"2025-03-31T16:01:11Z","status":"public","isi":1,"month":"04","volume":10805,"publication_status":"published","page":"385 - 407","_id":"297","oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","day":"12","conference":{"start_date":"2018-04-14","location":"Thessaloniki, Greece","end_date":"2018-04-20","name":"TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems"},"abstract":[{"lang":"eng","text":"Graph games played by two players over finite-state graphs are central in many problems in computer science. In particular, graph games with ω -regular winning conditions, specified as parity objectives, which can express properties such as safety, liveness, fairness, are the basic framework for verification and synthesis of reactive systems. The decisions for a player at various states of the graph game are represented as strategies. While the algorithmic problem for solving graph games with parity objectives has been widely studied, the most prominent data-structure for strategy representation in graph games has been binary decision diagrams (BDDs). However, due to the bit-level representation, BDDs do not retain the inherent flavor of the decisions of strategies, and are notoriously hard to minimize to obtain succinct representation. In this work we propose decision trees for strategy representation in graph games. Decision trees retain the flavor of decisions of strategies and allow entropy-based minimization to obtain succinct trees. However, decision trees work in settings (e.g., probabilistic models) where errors are allowed, and overfitting of data is typically avoided. In contrast, for strategies in graph games no error is allowed, and the decision tree must represent the entire strategy. We develop new techniques to extend decision trees to overcome the above obstacles, while retaining the entropy-based techniques to obtain succinct trees. We have implemented our techniques to extend the existing decision tree solvers. We present experimental results for problems in reactive synthesis to show that decision trees provide a much more efficient data-structure for strategy representation as compared to BDDs."}],"author":[{"full_name":"Brázdil, Tomáš","first_name":"Tomáš","last_name":"Brázdil"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky"},{"first_name":"Viktor","full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","last_name":"Toman"}],"oa":1,"date_published":"2018-04-12T00:00:00Z","doi":"10.1007/978-3-319-89960-2_21","has_accepted_license":"1","title":"Strategy representation by decision trees in reactive synthesis","external_id":{"isi":["000546326300021"]},"date_created":"2018-12-11T11:45:41Z","year":"2018","intvolume":" 10805","file_date_updated":"2020-07-14T12:45:57Z","ddc":["000"],"file":[{"content_type":"application/pdf","creator":"dernst","file_name":"2018_LNCS_Brazdil.pdf","file_size":1829940,"date_updated":"2020-07-14T12:45:57Z","date_created":"2018-12-17T16:29:08Z","file_id":"5723","checksum":"b13874ffb114932ad9cc2586b7469db4","access_level":"open_access","relation":"main_file"}],"article_processing_charge":"No","publisher":"Springer","citation":{"short":"T. Brázdil, K. Chatterjee, J. Kretinsky, V. Toman, in:, Springer, 2018, pp. 385–407.","ama":"Brázdil T, Chatterjee K, Kretinsky J, Toman V. Strategy representation by decision trees in reactive synthesis. In: Vol 10805. Springer; 2018:385-407. doi:10.1007/978-3-319-89960-2_21","mla":"Brázdil, Tomáš, et al. Strategy Representation by Decision Trees in Reactive Synthesis. Vol. 10805, Springer, 2018, pp. 385–407, doi:10.1007/978-3-319-89960-2_21.","ieee":"T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.","ista":"Brázdil T, Chatterjee K, Kretinsky J, Toman V. 2018. Strategy representation by decision trees in reactive synthesis. TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10805, 385–407.","apa":"Brázdil, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89960-2_21","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407. Springer, 2018. https://doi.org/10.1007/978-3-319-89960-2_21."}}]