[{"language":[{"iso":"eng"}],"has_accepted_license":"1","publication":"Information and Computation","month":"06","oa_version":"Submitted Version","related_material":{"record":[{"relation":"earlier_version","id":"3884","status":"public"}]},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","file":[{"relation":"main_file","access_level":"open_access","creator":"system","file_id":"4911","checksum":"13bff93f3c2a014e2908145a4517f177","file_size":189120,"date_created":"2018-12-12T10:11:54Z","content_type":"application/pdf","file_name":"IST-2012-56-v1+1_Strategy_logic.pdf","date_updated":"2020-07-14T12:46:18Z"}],"type":"journal_article","date_published":"2010-06-01T00:00:00Z","publist_id":"2317","oa":1,"file_date_updated":"2020-07-14T12:46:18Z","quality_controlled":"1","page":"677 - 693","publisher":"Elsevier","issue":"6","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Nir","last_name":"Piterman","full_name":"Piterman, Nir"}],"scopus_import":1,"_id":"3861","intvolume":"       208","pubrep_id":"56","title":"Strategy logic","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:34Z","publication_status":"published","ddc":["000","004"],"volume":208,"year":"2010","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” <i>Information and Computation</i>, vol. 208, no. 6. Elsevier, pp. 677–693, 2010.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic.” <i>Information and Computation</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">https://doi.org/10.1016/j.ic.2009.07.004</a>.","ama":"Chatterjee K, Henzinger TA, Piterman N. Strategy logic. <i>Information and Computation</i>. 2010;208(6):677-693. doi:<a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">10.1016/j.ic.2009.07.004</a>","apa":"Chatterjee, K., Henzinger, T. A., &#38; Piterman, N. (2010). Strategy logic. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">https://doi.org/10.1016/j.ic.2009.07.004</a>","ista":"Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.","short":"K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208 (2010) 677–693.","mla":"Chatterjee, Krishnendu, et al. “Strategy Logic.” <i>Information and Computation</i>, vol. 208, no. 6, Elsevier, 2010, pp. 677–93, doi:<a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">10.1016/j.ic.2009.07.004</a>."},"date_updated":"2023-02-23T11:46:57Z","abstract":[{"lang":"eng","text":"We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alternation fragment of strategy logic is strong enough to express the existence of Nash equilibria and secure equilibria, and subsumes other logics that were introduced to reason about games, such as ATL, ATL*, and game logic. We show that strategy logic is decidable, by constructing tree automata that recognize sets of strategies. While for the general logic, our decision procedure is nonelementary, for the simple fragment that is used above we show that the complexity is polynomial in the size of the game graph and optimal in the size of the formula (ranging from polynomial to 2EXPTIME depending on the form of the formula)."}],"day":"01","doi":"10.1016/j.ic.2009.07.004"},{"_id":"3863","scopus_import":1,"author":[{"first_name":"Dietmar","last_name":"Berwanger","full_name":"Berwanger, Dietmar"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"De Wulf","first_name":"Martin","full_name":"De Wulf, Martin"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"issue":"10","publication_status":"published","date_created":"2018-12-11T12:05:35Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Strategy construction for parity games with imperfect information","pubrep_id":"58","intvolume":"       208","page":"1206 - 1220","ec_funded":1,"quality_controlled":"1","file_date_updated":"2020-07-14T12:46:18Z","publisher":"Elsevier","date_updated":"2023-02-23T11:46:47Z","citation":{"apa":"Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., &#38; Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">https://doi.org/10.1016/j.ic.2009.09.006</a>","ama":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. Strategy construction for parity games with imperfect information. <i>Information and Computation</i>. 2010;208(10):1206-1220. doi:<a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">10.1016/j.ic.2009.09.006</a>","chicago":"Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect Information.” <i>Information and Computation</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">https://doi.org/10.1016/j.ic.2009.09.006</a>.","ieee":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Strategy construction for parity games with imperfect information,” <i>Information and Computation</i>, vol. 208, no. 10. Elsevier, pp. 1206–1220, 2010.","mla":"Berwanger, Dietmar, et al. “Strategy Construction for Parity Games with Imperfect Information.” <i>Information and Computation</i>, vol. 208, no. 10, Elsevier, 2010, pp. 1206–20, doi:<a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">10.1016/j.ic.2009.09.006</a>.","short":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 1206–1220.","ista":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy construction for parity games with imperfect information. Information and Computation. 208(10), 1206–1220."},"year":"2010","doi":"10.1016/j.ic.2009.09.006","day":"01","abstract":[{"text":"We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding winning strategies, one can use the subset construction to build an equivalent perfect-information game. Recently, an algorithm that avoids the inefficient subset construction has been proposed. The algorithm performs a fixed-point computation in a lattice of antichains, thus maintaining a succinct representation of state sets. However, this representation does not allow to recover winning strategies. In this paper, we build on the antichain approach to develop an algorithm for constructing the winning strategies in parity games of imperfect information. One major obstacle in adapting the classical procedure is that the complementation of attractor sets would break the invariant of downward-closedness on which the antichain representation relies. We overcome this difficulty by decomposing problem instances recursively into games with a combination of reachability, safety, and simpler parity conditions. We also report on an experimental implementation of our algorithm: to our knowledge, this is the first implementation of a procedure for solving imperfect-information parity games on graphs.","lang":"eng"}],"volume":208,"ddc":["005"],"publication":"Information and Computation","has_accepted_license":"1","oa_version":"Submitted Version","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"}],"month":"10","language":[{"iso":"eng"}],"date_published":"2010-10-01T00:00:00Z","type":"journal_article","publist_id":"2319","oa":1,"file":[{"file_id":"5300","creator":"system","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:18Z","file_name":"IST-2012-58-v1+1_Strategy_construction_for_parity_games_with_imperfect_information.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:17:44Z","file_size":287496,"checksum":"29d146e4f8049dbb7f80bbf7ea3700ed"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"3880","relation":"earlier_version"}]},"status":"public"},{"publisher":"Springer","page":"380 - 395","quality_controlled":"1","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:35Z","title":"Measuring and synthesizing systems in probabilistic environments","alternative_title":["LNCS"],"intvolume":"      6174","_id":"3864","scopus_import":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"full_name":"Singh, Rohit","first_name":"Rohit","last_name":"Singh"}],"acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","volume":6174,"doi":"10.1007/978-3-642-14295-6_34","day":"09","abstract":[{"text":"Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal-synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification tinder the given input assumption, synthesize a system that optimizes the measured value. For safety specifications and measures that are defined by mean-payoff automata, the optimal-synthesis problem amounts to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be done in polynomial time. For general omega-regular specifications, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. We present some experimental results showing optimal systems that were automatically generated in this way.","lang":"eng"}],"date_updated":"2023-02-23T10:17:28Z","citation":{"ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174, 380–395.","mla":"Chatterjee, Krishnendu, et al. <i>Measuring and Synthesizing Systems in Probabilistic Environments</i>. Vol. 6174, Springer, 2010, pp. 380–95, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">10.1007/978-3-642-14295-6_34</a>.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,” 6174:380–95. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">https://doi.org/10.1007/978-3-642-14295-6_34</a>.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. In: Vol 6174. Springer; 2010:380-395. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">10.1007/978-3-642-14295-6_34</a>","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">https://doi.org/10.1007/978-3-642-14295-6_34</a>"},"year":"2010","conference":{"location":"Edinburgh, United Kingdom","end_date":"2010-07-19","name":"CAV: Computer Aided Verification","start_date":"201-07-15"},"language":[{"iso":"eng"}],"oa_version":"Preprint","month":"07","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1004.0739"}],"status":"public","related_material":{"record":[{"id":"1856","relation":"later_version","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publist_id":"2313","date_published":"2010-07-09T00:00:00Z","type":"conference"},{"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2020-07-14T12:46:19Z","content_type":"application/pdf","file_name":"IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf","date_created":"2018-12-12T10:16:52Z","file_size":213083,"checksum":"9d204611c8d7855bed8134f8708a0010","file_id":"5243","creator":"system","relation":"main_file","access_level":"open_access"}],"oa":1,"publist_id":"2310","type":"conference","date_published":"2010-07-01T00:00:00Z","conference":{"location":"Edinburgh, UK","end_date":"2010-07-19","name":"CAV: Computer Aided Verification","start_date":"2010-07-15"},"language":[{"iso":"eng"}],"month":"07","project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"oa_version":"Submitted Version","has_accepted_license":"1","ddc":["004"],"volume":6174,"abstract":[{"text":"Systems ought to behave reasonably even in circumstances that are not anticipated in their specifications. We propose a definition of robustness for liveness specifications which prescribes, for any number of environment assumptions that are violated, a minimal number of system guarantees that must still be fulfilled. This notion of robustness can be formulated and realized using a Generalized Reactivity formula. We present an algorithm for synthesizing robust systems from such formulas. For the important special case of Generalized Reactivity formulas of rank 1, our algorithm improves the complexity of [PPS06] for large specifications with a small number of assumptions and guarantees.","lang":"eng"}],"day":"01","doi":"10.1007/978-3-642-14295-6_36","citation":{"apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., &#38; Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, &#38; P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">https://doi.org/10.1007/978-3-642-14295-6_36</a>","ama":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Robustness in the presence of liveness. In: Touili T, Cook B, Jackson P, eds. Vol 6174. Springer; 2010:410-424. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">10.1007/978-3-642-14295-6_36</a>","ieee":"R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness in the presence of liveness,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 410–424.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.” edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">https://doi.org/10.1007/978-3-642-14295-6_36</a>.","short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T. Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424.","mla":"Bloem, Roderick, et al. <i>Robustness in the Presence of Liveness</i>. Edited by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">10.1007/978-3-642-14295-6_36</a>.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174, 410–424."},"year":"2010","date_updated":"2021-01-12T07:52:47Z","editor":[{"last_name":"Touili","first_name":"Tayssir","full_name":"Touili, Tayssir"},{"last_name":"Cook","first_name":"Byron","full_name":"Cook, Byron"},{"full_name":"Jackson, Paul","first_name":"Paul","last_name":"Jackson"}],"publisher":"Springer","file_date_updated":"2020-07-14T12:46:19Z","quality_controlled":"1","ec_funded":1,"page":"410 - 424","intvolume":"      6174","pubrep_id":"54","title":"Robustness in the presence of liveness","alternative_title":["LNCS"],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:36Z","publication_status":"published","author":[{"full_name":"Bloem, Roderick","first_name":"Roderick","last_name":"Bloem"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Greimel, Karin","last_name":"Greimel","first_name":"Karin"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jobstmann","first_name":"Barbara","full_name":"Jobstmann, Barbara"}],"scopus_import":1,"_id":"3866"},{"file":[{"date_updated":"2020-07-14T12:46:19Z","file_name":"IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:17:54Z","file_size":216598,"checksum":"0243da726476817f2ea33b48b78be696","file_id":"5312","creator":"system","access_level":"open_access","relation":"main_file"},{"file_size":302416,"checksum":"5e512b8503a9cb263de26331c4ee9cf2","date_created":"2018-12-12T10:17:55Z","file_name":"IST-2016-55-v2+1_1007.4018.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:19Z","access_level":"open_access","relation":"main_file","creator":"system","file_id":"5313"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"earlier_version","id":"4540","status":"public"}]},"status":"public","oa":1,"publist_id":"2311","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"type":"journal_article","date_published":"2010-08-30T00:00:00Z","language":[{"iso":"eng"}],"project":[{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"oa_version":"Published Version","month":"08","has_accepted_license":"1","publication":"Logical Methods in Computer Science","volume":6,"ddc":["000","004"],"day":"30","doi":"10.2168/LMCS-6(3:10)2010","abstract":[{"text":"Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the transition weights. The value of a word w is the supremum of the values of the runs over w. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be omega-regular for deterministic limit-average and discounted-sum automata, while this set is always omega-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the omega-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L-1 and L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1 - L-1, which generalize the boolean operations on languages, as well as the sum L-1 + L-2. We establish the closure properties of all classes of quantitative languages with respect to these four operations.","lang":"eng"}],"citation":{"ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3. International Federation of Computational Logic, pp. 1–23, 2010.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2010. <a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">https://doi.org/10.2168/LMCS-6(3:10)2010</a>.","ama":"Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties for quantitative languages. <i>Logical Methods in Computer Science</i>. 2010;6(3):1-23. doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">10.2168/LMCS-6(3:10)2010</a>","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">https://doi.org/10.2168/LMCS-6(3:10)2010</a>","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.","mla":"Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–23, doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">10.2168/LMCS-6(3:10)2010</a>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23."},"year":"2010","date_updated":"2023-02-23T12:15:42Z","publisher":"International Federation of Computational Logic","quality_controlled":"1","ec_funded":1,"page":"1 - 23","file_date_updated":"2020-07-14T12:46:19Z","date_created":"2018-12-11T12:05:36Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","intvolume":"         6","title":"Expressiveness and closure properties for quantitative languages","pubrep_id":"504","scopus_import":1,"license":"https://creativecommons.org/licenses/by-nd/4.0/","_id":"3867","issue":"3","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}]},{"oa_version":"Submitted Version","month":"03","has_accepted_license":"1","conference":{"start_date":"2010-03-20","name":"FoSSaCS: Foundations of Software Science and Computation Structures","location":"Paphos, Cyprus","end_date":"2010-03-28"},"language":[{"iso":"eng"}],"publist_id":"1099","oa":1,"date_published":"2010-03-01T00:00:00Z","type":"conference","file":[{"checksum":"3e610de84937d821316362658239134a","file_size":240766,"date_created":"2018-12-12T10:08:17Z","content_type":"application/pdf","file_name":"IST-2012-50-v1+1_Forward_analysis_of_depth-bounded_processes.pdf","date_updated":"2020-07-14T12:46:27Z","relation":"main_file","access_level":"open_access","creator":"system","file_id":"4677"}],"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1405"}]},"publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:08:27Z","alternative_title":["LNCS"],"pubrep_id":"50","title":"Forward analysis of depth-bounded processes","intvolume":"      6014","_id":"4361","scopus_import":1,"author":[{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies","first_name":"Thomas","full_name":"Wies, Thomas"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","first_name":"Damien","last_name":"Zufferey"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"}],"publisher":"Springer","editor":[{"first_name":"Luke","last_name":"Ong","full_name":"Ong, Luke"}],"page":"94 - 108","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:27Z","doi":"10.1007/978-3-642-12032-9_8","day":"01","abstract":[{"lang":"eng","text":"Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an adequate domain of limits for the well-structured transition systems that are induced by depth-bounded processes. An immediate consequence of our result is that there exists a forward algorithm that decides the covering problem for this class. Unlike backward algorithms, the forward algorithm terminates even if the depth of the process is not known a priori. More importantly, our result suggests a whole spectrum of forward algorithms that enable the effective verification of a large class of mobile systems."}],"date_updated":"2023-09-07T11:36:36Z","citation":{"ama":"Wies T, Zufferey D, Henzinger TA. Forward analysis of depth-bounded processes. In: Ong L, ed. Vol 6014. Springer; 2010:94-108. doi:<a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">10.1007/978-3-642-12032-9_8</a>","apa":"Wies, T., Zufferey, D., &#38; Henzinger, T. A. (2010). Forward analysis of depth-bounded processes. In L. Ong (Ed.) (Vol. 6014, pp. 94–108). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">https://doi.org/10.1007/978-3-642-12032-9_8</a>","ieee":"T. Wies, D. Zufferey, and T. A. Henzinger, “Forward analysis of depth-bounded processes,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus, 2010, vol. 6014, pp. 94–108.","chicago":"Wies, Thomas, Damien Zufferey, and Thomas A Henzinger. “Forward Analysis of Depth-Bounded Processes.” edited by Luke Ong, 6014:94–108. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">https://doi.org/10.1007/978-3-642-12032-9_8</a>.","short":"T. Wies, D. Zufferey, T.A. Henzinger, in:, L. Ong (Ed.), Springer, 2010, pp. 94–108.","mla":"Wies, Thomas, et al. <i>Forward Analysis of Depth-Bounded Processes</i>. Edited by Luke Ong, vol. 6014, Springer, 2010, pp. 94–108, doi:<a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">10.1007/978-3-642-12032-9_8</a>.","ista":"Wies T, Zufferey D, Henzinger TA. 2010. Forward analysis of depth-bounded processes. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 6014, 94–108."},"year":"2010","volume":6014,"ddc":["004"]},{"publist_id":"1096","abstract":[{"text":"Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict graph algorithm for verifying correctness of STMs, we develop TRACER, a tool for runtime verification of STM implementations. The novelty of TRACER lies in the way it combines coarse and precise runtime analyses to guarantee sound and complete verification in an efficient manner. We implement TRACER in the TL2 STM implementation. We evaluate the performance of TRACER on STAMP benchmarks. While a precise runtime verification technique based on conflict graphs results in an average slowdown of 60x, the two-level approach of TRACER performs complete verification with an average slowdown of around 25x across different benchmarks.","lang":"eng"}],"day":"01","doi":"10.1007/978-3-642-16612-9_32","type":"conference","date_published":"2010-01-01T00:00:00Z","year":"2010","citation":{"ama":"Singh V. Runtime verification for software transactional memories. In: Sokolsky O, Rosu G, Tilmann N, et al., eds. Vol 6418. Springer; 2010:421-435. doi:<a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">10.1007/978-3-642-16612-9_32</a>","apa":"Singh, V. (2010). Runtime verification for software transactional memories. In O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner, … G. Pace (Eds.) (Vol. 6418, pp. 421–435). Presented at the RV: International Conference on Runtime Verification, St. Julians, Malta: Springer. <a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">https://doi.org/10.1007/978-3-642-16612-9_32</a>","chicago":"Singh, Vasu. “Runtime Verification for Software Transactional Memories.” edited by Oleg Sokolsky, Grigore Rosu, Nikolai Tilmann, Howard Barringer, Ylies Falcone, Bernd Finkbeiner, Klaus Havelund, Insup Lee, and Gordon Pace, 6418:421–35. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">https://doi.org/10.1007/978-3-642-16612-9_32</a>.","ieee":"V. Singh, “Runtime verification for software transactional memories,” presented at the RV: International Conference on Runtime Verification, St. Julians, Malta, 2010, vol. 6418, pp. 421–435.","short":"V. Singh, in:, O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner, K. Havelund, I. Lee, G. Pace (Eds.), Springer, 2010, pp. 421–435.","mla":"Singh, Vasu. <i>Runtime Verification for Software Transactional Memories</i>. Edited by Oleg Sokolsky et al., vol. 6418, Springer, 2010, pp. 421–35, doi:<a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">10.1007/978-3-642-16612-9_32</a>.","ista":"Singh V. 2010. Runtime verification for software transactional memories. RV: International Conference on Runtime Verification, LNCS, vol. 6418, 421–435."},"date_updated":"2021-01-12T07:56:25Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","volume":6418,"intvolume":"      6418","title":"Runtime verification for software transactional memories","alternative_title":["LNCS"],"month":"01","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:08:28Z","publication_status":"published","oa_version":"None","author":[{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu","first_name":"Vasu","last_name":"Singh"}],"scopus_import":1,"_id":"4362","conference":{"end_date":"2010-11-04","location":"St. Julians, Malta","start_date":"2010-11-01","name":"RV: International Conference on Runtime Verification"},"editor":[{"full_name":"Sokolsky, Oleg","first_name":"Oleg","last_name":"Sokolsky"},{"first_name":"Grigore","last_name":"Rosu","full_name":"Rosu, Grigore"},{"last_name":"Tilmann","first_name":"Nikolai","full_name":"Tilmann, Nikolai"},{"last_name":"Barringer","first_name":"Howard","full_name":"Barringer, Howard"},{"first_name":"Ylies","last_name":"Falcone","full_name":"Falcone, Ylies"},{"last_name":"Finkbeiner","first_name":"Bernd","full_name":"Finkbeiner, Bernd"},{"full_name":"Havelund, Klaus","first_name":"Klaus","last_name":"Havelund"},{"full_name":"Lee, Insup","first_name":"Insup","last_name":"Lee"},{"first_name":"Gordon","last_name":"Pace","full_name":"Pace, Gordon"}],"publisher":"Springer","language":[{"iso":"eng"}],"quality_controlled":"1","page":"421 - 435"},{"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"system","file_id":"5028","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"IST-2012-49-v1+1_From_MTL_to_deterministic_timed_automata.pdf","date_updated":"2020-07-14T12:46:27Z","checksum":"b0ca5f5fbe8a3d20ccbc6f51a344a459","file_size":249789,"date_created":"2018-12-12T10:13:43Z"}],"date_published":"2010-09-08T00:00:00Z","type":"conference","publist_id":"1090","oa":1,"language":[{"iso":"eng"}],"conference":{"start_date":"2010-09-08","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","location":"Klosterneuburg, Austria","end_date":"2010-09-10"},"has_accepted_license":"1","month":"09","oa_version":"Submitted Version","project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"ddc":["004"],"volume":6246,"date_updated":"2021-01-12T07:56:27Z","year":"2010","citation":{"ama":"Nickovic D, Piterman N. From MTL to deterministic timed automata. In: Henzinger TA, Chatterjee K, eds. Vol 6246. Springer; 2010:152-167. doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">10.1007/978-3-642-15297-9_13</a>","apa":"Nickovic, D., &#38; Piterman, N. (2010). From MTL to deterministic timed automata. In T. A. Henzinger &#38; K. Chatterjee (Eds.) (Vol. 6246, pp. 152–167). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">https://doi.org/10.1007/978-3-642-15297-9_13</a>","chicago":"Nickovic, Dejan, and Nir Piterman. “From MTL to Deterministic Timed Automata.” edited by Thomas A. Henzinger and Krishnendu Chatterjee, 6246:152–67. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">https://doi.org/10.1007/978-3-642-15297-9_13</a>.","ieee":"D. Nickovic and N. Piterman, “From MTL to deterministic timed automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria, 2010, vol. 6246, pp. 152–167.","mla":"Nickovic, Dejan, and Nir Piterman. <i>From MTL to Deterministic Timed Automata</i>. Edited by Thomas A. Henzinger and Krishnendu Chatterjee, vol. 6246, Springer, 2010, pp. 152–67, doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">10.1007/978-3-642-15297-9_13</a>.","short":"D. Nickovic, N. Piterman, in:, T.A. Henzinger, K. Chatterjee (Eds.), Springer, 2010, pp. 152–167.","ista":"Nickovic D, Piterman N. 2010. From MTL to deterministic timed automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6246, 152–167."},"abstract":[{"lang":"eng","text":"In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic mtl, under bounded-variability assumptions. We handle full mtl and include all future operators. Our construction is based on separation of the continuous time monitoring of the input sequence and discrete predictions regarding the future. The separation of the continuous from the discrete allows us to determinize our automata in an exponential construction that does not increase the number of clocks. This leads to a doubly exponential construction from mtl to deterministic timed automata, compared with triply exponential using existing approaches. We offer an alternative to the existing approach to linear real-time model checking, which has never been implemented. It further offers a unified framework for model checking, runtime monitoring, and synthesis, in an approach that can reuse tools, implementations, and insights from the discrete setting."}],"doi":"10.1007/978-3-642-15297-9_13","day":"08","file_date_updated":"2020-07-14T12:46:27Z","page":"152 - 167","ec_funded":1,"quality_controlled":"1","publisher":"Springer","editor":[{"first_name":"Thomas A.","last_name":"Henzinger","full_name":"Henzinger, Thomas A."},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"author":[{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan","full_name":"Nickovic, Dejan"},{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"}],"_id":"4369","scopus_import":1,"alternative_title":["LNCS"],"title":"From MTL to deterministic timed automata","pubrep_id":"49","intvolume":"      6246","publication_status":"published","date_created":"2018-12-11T12:08:30Z","department":[{"_id":"ToHe"}]},{"publisher":"Springer","editor":[{"full_name":"Barthe, Gilles","first_name":"Gilles","last_name":"Barthe"},{"first_name":"Manuel","last_name":"Hermenegildo","full_name":"Hermenegildo, Manuel"}],"page":"26 - 44","quality_controlled":"1","publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:08:33Z","title":"Building a calculus of data structures","alternative_title":["LNCS"],"intvolume":"      5944","_id":"4378","scopus_import":1,"author":[{"first_name":"Viktor","last_name":"Kuncak","full_name":"Kuncak, Viktor"},{"full_name":"Piskac, Ruzica","first_name":"Ruzica","last_name":"Piskac"},{"last_name":"Suter","first_name":"Philippe","full_name":"Suter, Philippe"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Wies","full_name":"Wies, Thomas"}],"volume":5944,"doi":"10.1007/978-3-642-11319-2_6","day":"01","abstract":[{"lang":"eng","text":"Techniques such as verification condition generation, predicate abstraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Programs and their specifications often make use of data structures such as sets, multisets, algebraic data types, or graphs. Consequently, formulas generated from verification also involve such data structures. To automate the proofs of such formulas we propose a logic (a “calculus”) of such data structures. We build the calculus by starting from decidable logics of individual data structures, and connecting them through functions and sets, in ways that go beyond the frameworks such as Nelson-Oppen. The result are new decidable logics that can simultaneously specify properties of different kinds of data structures and overcome the limitations of the individual logics. Several of our decidable logics include abstraction functions that map a data structure into its more abstract view (a tree into a multiset, a multiset into a set), into a numerical quantity (the size or the height), or into the truth value of a candidate data structure invariant (sortedness, or the heap property). For algebraic data types, we identify an asymptotic many-to-one condition on the abstraction function that guarantees the existence of a decision procedure. In addition to the combination based on abstraction functions, we can combine multiple data structure theories if they all reduce to the same data structure logic. As an instance of this approach, we describe a decidable logic whose formulas are propositional combinations of formulas in: weak monadic second-order logic of two successors, two-variable logic with counting, multiset algebra with Presburger arithmetic, the Bernays-Schönfinkel-Ramsey class of first-order logic, and the logic of algebraic data types with the set content function. The subformulas in this combination can share common variables that refer to sets of objects along with the common set algebra operations. Such sound and complete combination is possible because the relations on sets definable in the component logics are all expressible in Boolean Algebra with Presburger Arithmetic. Presburger arithmetic and its new extensions play an important role in our decidability results. In several cases, when we combine logics that belong to NP, we can prove the satisfiability for the combined logic is still in NP."}],"date_updated":"2021-01-12T07:56:31Z","year":"2010","citation":{"apa":"Kuncak, V., Piskac, R., Suter, P., &#38; Wies, T. (2010). Building a calculus of data structures. In G. Barthe &#38; M. Hermenegildo (Eds.) (Vol. 5944, pp. 26–44). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">https://doi.org/10.1007/978-3-642-11319-2_6</a>","ama":"Kuncak V, Piskac R, Suter P, Wies T. Building a calculus of data structures. In: Barthe G, Hermenegildo M, eds. Vol 5944. Springer; 2010:26-44. doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">10.1007/978-3-642-11319-2_6</a>","ieee":"V. Kuncak, R. Piskac, P. Suter, and T. Wies, “Building a calculus of data structures,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 26–44.","chicago":"Kuncak, Viktor, Ruzica Piskac, Philippe Suter, and Thomas Wies. “Building a Calculus of Data Structures.” edited by Gilles Barthe and Manuel Hermenegildo, 5944:26–44. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">https://doi.org/10.1007/978-3-642-11319-2_6</a>.","short":"V. Kuncak, R. Piskac, P. Suter, T. Wies, in:, G. Barthe, M. Hermenegildo (Eds.), Springer, 2010, pp. 26–44.","mla":"Kuncak, Viktor, et al. <i>Building a Calculus of Data Structures</i>. Edited by Gilles Barthe and Manuel Hermenegildo, vol. 5944, Springer, 2010, pp. 26–44, doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">10.1007/978-3-642-11319-2_6</a>.","ista":"Kuncak V, Piskac R, Suter P, Wies T. 2010. Building a calculus of data structures. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 5944, 26–44."},"conference":{"location":"Madrid, Spain","end_date":"2010-01-19","start_date":"2010-01-17","name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"language":[{"iso":"eng"}],"oa_version":"Submitted Version","month":"01","main_file_link":[{"url":"https://infoscience.epfl.ch/record/161290/","open_access":"1"}],"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"1081","oa":1,"date_published":"2010-01-01T00:00:00Z","type":"conference"},{"page":"1 - 8","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:28Z","publisher":"ACM","_id":"4380","scopus_import":1,"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Anmol","last_name":"Tomar","full_name":"Tomar, Anmol","id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Singh, Vasu","last_name":"Singh","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas","last_name":"Wies","full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien"}],"publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:08:33Z","title":"A marketplace for cloud resources","pubrep_id":"48","ddc":["005"],"date_updated":"2021-01-12T07:56:32Z","citation":{"ieee":"T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “A marketplace for cloud resources,” presented at the EMSOFT: Embedded Software , Arizona, USA, 2010, pp. 1–8.","chicago":"Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “A Marketplace for Cloud Resources,” 1–8. ACM, 2010. <a href=\"https://doi.org/10.1145/1879021.1879022\">https://doi.org/10.1145/1879021.1879022</a>.","ama":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. A marketplace for cloud resources. In: ACM; 2010:1-8. doi:<a href=\"https://doi.org/10.1145/1879021.1879022\">10.1145/1879021.1879022</a>","apa":"Henzinger, T. A., Tomar, A., Singh, V., Wies, T., &#38; Zufferey, D. (2010). A marketplace for cloud resources (pp. 1–8). Presented at the EMSOFT: Embedded Software , Arizona, USA: ACM. <a href=\"https://doi.org/10.1145/1879021.1879022\">https://doi.org/10.1145/1879021.1879022</a>","ista":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. 2010. A marketplace for cloud resources. EMSOFT: Embedded Software , 1–8.","short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2010, pp. 1–8.","mla":"Henzinger, Thomas A., et al. <i>A Marketplace for Cloud Resources</i>. ACM, 2010, pp. 1–8, doi:<a href=\"https://doi.org/10.1145/1879021.1879022\">10.1145/1879021.1879022</a>."},"year":"2010","doi":"10.1145/1879021.1879022","day":"24","abstract":[{"lang":"eng","text":"Cloud computing is an emerging paradigm aimed to offer users pay-per-use computing resources, while leaving the burden of managing the computing infrastructure to the cloud provider. We present a new programming and pricing model that gives the cloud user the flexibility of trading execution speed and price on a per-job basis. We discuss the scheduling and resource management challenges for the cloud provider that arise in the implementation of this model. We argue that techniques from real-time and embedded software can be useful in this context."}],"language":[{"iso":"eng"}],"conference":{"location":"Arizona, USA","end_date":"2010-10-29","name":"EMSOFT: Embedded Software ","start_date":"2010-10-24"},"has_accepted_license":"1","oa_version":"Submitted Version","month":"10","file":[{"content_type":"application/pdf","file_name":"IST-2012-48-v1+1_A_marketplace_for_cloud_resources.pdf","date_updated":"2020-07-14T12:46:28Z","checksum":"7680dd24016810710f7c977bc94f85e9","file_size":222626,"date_created":"2018-12-12T10:09:42Z","creator":"system","file_id":"4767","access_level":"open_access","relation":"main_file"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_published":"2010-10-24T00:00:00Z","type":"conference","oa":1,"publist_id":"1078"},{"ddc":["004"],"citation":{"mla":"Henzinger, Thomas A., et al. <i>FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment</i>. IEEE, 2010, pp. 83–90, doi:<a href=\"https://doi.org/10.1109/CLOUD.2010.71\">10.1109/CLOUD.2010.71</a>.","short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, IEEE, 2010, pp. 83–90.","ista":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. 2010. FlexPRICE: Flexible provisioning of resources in a cloud environment. CLOUD: Cloud Computing, 83–90.","apa":"Henzinger, T. A., Tomar, A., Singh, V., Wies, T., &#38; Zufferey, D. (2010). FlexPRICE: Flexible provisioning of resources in a cloud environment (pp. 83–90). Presented at the CLOUD: Cloud Computing, Miami, USA: IEEE. <a href=\"https://doi.org/10.1109/CLOUD.2010.71\">https://doi.org/10.1109/CLOUD.2010.71</a>","ama":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. FlexPRICE: Flexible provisioning of resources in a cloud environment. In: IEEE; 2010:83-90. doi:<a href=\"https://doi.org/10.1109/CLOUD.2010.71\">10.1109/CLOUD.2010.71</a>","ieee":"T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “FlexPRICE: Flexible provisioning of resources in a cloud environment,” presented at the CLOUD: Cloud Computing, Miami, USA, 2010, pp. 83–90.","chicago":"Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment,” 83–90. IEEE, 2010. <a href=\"https://doi.org/10.1109/CLOUD.2010.71\">https://doi.org/10.1109/CLOUD.2010.71</a>."},"year":"2010","date_updated":"2021-01-12T07:56:33Z","abstract":[{"text":"Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We claim that, in order to realize the full potential of cloud computing, the user must be presented with a pricing model that offers flexibility at the requirements level, such as a choice between different degrees of execution speed and the cloud provider must be presented with a programming model that offers flexibility at the execution level, such as a choice between different scheduling policies. In such a flexible framework, with each job, the user purchases a virtual computer with the desired speed and cost characteristics, and the cloud provider can optimize the utilization of resources across a stream of jobs from different users. We designed a flexible framework to test our hypothesis, which is called FlexPRICE (Flexible Provisioning of Resources in a Cloud Environment) and works as follows. A user presents a job to the cloud. The cloud finds different schedules to execute the job and presents a set of quotes to the user in terms of price and duration for the execution. The user then chooses a particular quote and the cloud is obliged to execute the job according to the chosen quote. FlexPRICE thus hides the complexity of the actual scheduling decisions from the user, but still provides enough flexibility to meet the users actual demands. We implemented FlexPRICE in a simulator called PRICES that allows us to experiment with our framework. We observe that FlexPRICE provides a wide range of execution options-from fast and expensive to slow and cheap-- for the whole spectrum of data-intensive and computation-intensive jobs. We also observe that the set of quotes computed by FlexPRICE do not vary as the number of simultaneous jobs increases.","lang":"eng"}],"day":"26","doi":"10.1109/CLOUD.2010.71","file_date_updated":"2020-07-14T12:46:28Z","quality_controlled":"1","page":"83 - 90","publisher":"IEEE","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87","full_name":"Tomar, Anmol","last_name":"Tomar","first_name":"Anmol"},{"full_name":"Singh, Vasu","first_name":"Vasu","last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas","last_name":"Wies","full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien"}],"scopus_import":1,"_id":"4381","title":"FlexPRICE: Flexible provisioning of resources in a cloud environment","pubrep_id":"47","date_created":"2018-12-11T12:08:33Z","article_processing_charge":"No","department":[{"_id":"ToHe"}],"publication_status":"published","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"IST-2012-47-v1+1_FlexPRICE-_Flexible_provisioning_of_resources_in_a_cloud_environment.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:28Z","checksum":"98e534675339a8e2beca08890d048145","file_size":467436,"date_created":"2018-12-12T10:16:03Z","creator":"system","file_id":"5188","access_level":"open_access","relation":"main_file"}],"type":"conference","date_published":"2010-08-26T00:00:00Z","publist_id":"1077","oa":1,"language":[{"iso":"eng"}],"conference":{"start_date":"2010-07-05","name":"CLOUD: Cloud Computing","location":"Miami, USA","end_date":"2010-07-10"},"has_accepted_license":"1","month":"08","oa_version":"Submitted Version"},{"publication_status":"published","oa_version":"Submitted Version","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:08:34Z","title":"Transactions in the jungle","pubrep_id":"46","month":"06","_id":"4382","has_accepted_license":"1","author":[{"full_name":"Guerraoui, Rachid","last_name":"Guerraoui","first_name":"Rachid"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kapalka","first_name":"Michal","full_name":"Kapalka, Michal"},{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu","last_name":"Singh","first_name":"Vasu"}],"publisher":"ACM","conference":{"name":"SPAA: ACM Symposium on Parallel Algorithms and Architectures","start_date":"2010-06-13","end_date":"2010-06-15","location":"Santorini, Greece"},"page":"263 - 272","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:28Z","language":[{"iso":"eng"}],"doi":"10.1145/1810479.1810529","day":"13","abstract":[{"lang":"eng","text":"Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of TM executions have been proposed. Many of these definitions assumed that accesses to shared data are solely performed through transactions. In practice, due to legacy code and concurrency libraries, transactions in a TM have to share data with non-transactional operations. The semantics of such interaction, while widely discussed by practitioners, lacks a clear formal specification. Those interactions can vary, sometimes in subtle ways, between TM implementations and underlying memory models. We propose a correctness condition for TMs, parametrized opacity, to formally capture the now folklore notion of strong atomicity by stipulating the two following intuitive requirements: first, every transaction appears as if it is executed instantaneously with respect to other transactions and non-transactional operations, and second, non-transactional operations conform to the given underlying memory model. We investigate the inherent cost of implementing parametrized opacity. We first prove that parametrized opacity requires either instrumenting non-transactional operations (for most memory models) or writing to memory by transactions using potentially expensive read-modify-write instructions (such as compare-and-swap). Then, we show that for a class of practical relaxed memory models, parametrized opacity can indeed be implemented with constant-time instrumentation of non-transactional writes and no instrumentation of non-transactional reads. We show that, in practice, parametrizing the notion of correctness allows developing more efficient TM implementations."}],"publist_id":"1076","oa":1,"date_updated":"2021-01-12T07:56:33Z","year":"2010","citation":{"mla":"Guerraoui, Rachid, et al. <i>Transactions in the Jungle</i>. ACM, 2010, pp. 263–72, doi:<a href=\"https://doi.org/10.1145/1810479.1810529\">10.1145/1810479.1810529</a>.","short":"R. Guerraoui, T.A. Henzinger, M. Kapalka, V. Singh, in:, ACM, 2010, pp. 263–272.","ista":"Guerraoui R, Henzinger TA, Kapalka M, Singh V. 2010. Transactions in the jungle. SPAA: ACM Symposium on Parallel Algorithms and Architectures, 263–272.","apa":"Guerraoui, R., Henzinger, T. A., Kapalka, M., &#38; Singh, V. (2010). Transactions in the jungle (pp. 263–272). Presented at the SPAA: ACM Symposium on Parallel Algorithms and Architectures, Santorini, Greece: ACM. <a href=\"https://doi.org/10.1145/1810479.1810529\">https://doi.org/10.1145/1810479.1810529</a>","ama":"Guerraoui R, Henzinger TA, Kapalka M, Singh V. Transactions in the jungle. In: ACM; 2010:263-272. doi:<a href=\"https://doi.org/10.1145/1810479.1810529\">10.1145/1810479.1810529</a>","chicago":"Guerraoui, Rachid, Thomas A Henzinger, Michal Kapalka, and Vasu Singh. “Transactions in the Jungle,” 263–72. ACM, 2010. <a href=\"https://doi.org/10.1145/1810479.1810529\">https://doi.org/10.1145/1810479.1810529</a>.","ieee":"R. Guerraoui, T. A. Henzinger, M. Kapalka, and V. Singh, “Transactions in the jungle,” presented at the SPAA: ACM Symposium on Parallel Algorithms and Architectures, Santorini, Greece, 2010, pp. 263–272."},"date_published":"2010-06-13T00:00:00Z","type":"conference","file":[{"creator":"system","file_id":"5080","relation":"main_file","access_level":"open_access","file_name":"IST-2012-46-v1+1_Transactions_in_the_jungle.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:28Z","file_size":246409,"checksum":"f2ad6c00a6304da34bf21bcdcfd36c4b","date_created":"2018-12-12T10:14:28Z"}],"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","ddc":["005"]},{"abstract":[{"text":"GIST is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable specifications. Our tool provides the first and efficient implementations of several reduction-based techniques to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic games for synthesizing environment assumptions for unrealizable specifications.","lang":"eng"}],"doi":"10.1007/978-3-642-14295-6_57","arxiv":1,"day":"01","external_id":{"arxiv":["1004.2367"]},"date_updated":"2023-02-23T12:24:17Z","year":"2010","citation":{"ista":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.","mla":"Chatterjee, Krishnendu, et al. <i>GIST: A Solver for Probabilistic Games</i>. Vol. 6174, Springer, 2010, pp. 665–69, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">10.1007/978-3-642-14295-6_57</a>.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, “GIST: A solver for probabilistic games,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 665–669.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,” 6174:665–69. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">https://doi.org/10.1007/978-3-642-14295-6_57</a>.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. GIST: A solver for probabilistic games. In: Vol 6174. Springer; 2010:665-669. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">10.1007/978-3-642-14295-6_57</a>","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">https://doi.org/10.1007/978-3-642-14295-6_57</a>"},"ddc":["004"],"volume":6174,"alternative_title":["LNCS"],"pubrep_id":"43","title":"GIST: A solver for probabilistic games","intvolume":"      6174","publication_status":"published","date_created":"2018-12-11T12:08:36Z","article_processing_charge":"No","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jobstmann, Barbara","first_name":"Barbara","last_name":"Jobstmann"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","first_name":"Arjun","full_name":"Radhakrishna, Arjun"}],"_id":"4388","scopus_import":1,"publisher":"Springer","file_date_updated":"2020-07-14T12:46:28Z","page":"665 - 669","quality_controlled":"1","ec_funded":1,"publist_id":"1068","oa":1,"date_published":"2010-07-01T00:00:00Z","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"record":[{"status":"public","id":"5393","relation":"earlier_version"}]},"file":[{"date_created":"2018-12-12T10:16:33Z","file_size":293605,"checksum":"0b2ef8c4037ffccc6902d93081af24f7","date_updated":"2020-07-14T12:46:28Z","content_type":"application/pdf","file_name":"IST-2012-43-v1+1_GIST-_A_solver_for_probabilistic_games.pdf","relation":"main_file","access_level":"open_access","file_id":"5221","creator":"system"}],"month":"07","oa_version":"Submitted Version","project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","conference":{"end_date":"2010-07-17","location":"Edinburgh, UK","name":"CAV: Computer Aided Verification","start_date":"2010-07-15"},"language":[{"iso":"eng"}]},{"has_accepted_license":"1","month":"08","oa_version":"Submitted Version","language":[{"iso":"eng"}],"conference":{"name":"ACSD: Application of Concurrency to System Design"},"date_published":"2010-08-23T00:00:00Z","type":"conference","publist_id":"1069","oa":1,"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"42b2952bfc6b6974617bd554842b904a","file_size":159920,"date_created":"2018-12-12T10:09:10Z","content_type":"application/pdf","file_name":"IST-2012-44-v1+1_Robustness_of_sequential_circuits.pdf","date_updated":"2020-07-14T12:46:28Z","access_level":"open_access","relation":"main_file","creator":"system","file_id":"4733"}],"author":[{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Legay","first_name":"Axel","full_name":"Legay, Axel"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan","full_name":"Nickovic, Dejan"}],"_id":"4389","scopus_import":1,"pubrep_id":"44","title":"Robustness of sequential circuits","publication_status":"published","date_created":"2018-12-11T12:08:36Z","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:28Z","page":"77 - 84","quality_controlled":"1","publisher":"IEEE","date_updated":"2021-01-12T07:56:36Z","year":"2010","citation":{"ista":"Doyen L, Henzinger TA, Legay A, Nickovic D. 2010. Robustness of sequential circuits. ACSD: Application of Concurrency to System Design, 77–84.","mla":"Doyen, Laurent, et al. <i>Robustness of Sequential Circuits</i>. IEEE, 2010, pp. 77–84, doi:<a href=\"https://doi.org/10.1109/ACSD.2010.26\">10.1109/ACSD.2010.26</a>.","short":"L. Doyen, T.A. Henzinger, A. Legay, D. Nickovic, in:, IEEE, 2010, pp. 77–84.","chicago":"Doyen, Laurent, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Robustness of Sequential Circuits,” 77–84. IEEE, 2010. <a href=\"https://doi.org/10.1109/ACSD.2010.26\">https://doi.org/10.1109/ACSD.2010.26</a>.","ieee":"L. Doyen, T. A. Henzinger, A. Legay, and D. Nickovic, “Robustness of sequential circuits,” presented at the ACSD: Application of Concurrency to System Design, 2010, pp. 77–84.","apa":"Doyen, L., Henzinger, T. A., Legay, A., &#38; Nickovic, D. (2010). Robustness of sequential circuits (pp. 77–84). Presented at the ACSD: Application of Concurrency to System Design, IEEE. <a href=\"https://doi.org/10.1109/ACSD.2010.26\">https://doi.org/10.1109/ACSD.2010.26</a>","ama":"Doyen L, Henzinger TA, Legay A, Nickovic D. Robustness of sequential circuits. In: IEEE; 2010:77-84. doi:<a href=\"https://doi.org/10.1109/ACSD.2010.26\">10.1109/ACSD.2010.26</a>"},"abstract":[{"lang":"eng","text":"Digital components play a central role in the design of complex embedded systems. These components are interconnected with other, possibly analog, devices and the physical environment. This environment cannot be entirely captured and can provide inaccurate input data to the component. It is thus important for digital components to have a robust behavior, i.e. the presence of a small change in the input sequences should not result in a drastic change in the output sequences. In this paper, we study a notion of robustness for sequential circuits. However, since sequential circuits may have parts that are naturally discontinuous (e.g., digital controllers with switching behavior), we need a flexible framework that accommodates this fact and leaves discontinuous parts of the circuit out from the robustness analysis. As a consequence, we consider sequential circuits that have their input variables partitioned into two disjoint sets: control and disturbance variables. Our contributions are (1) a definition of robustness for sequential circuits as a form of continuity with respect to disturbance variables, (2) the characterization of the exact class of sequential circuits that are robust according to our definition, (3) an algorithm to decide whether a sequential circuit is robust or not."}],"doi":"10.1109/ACSD.2010.26","day":"23","ddc":["004"]},{"language":[{"iso":"eng"}],"conference":{"end_date":"2010-07-17","location":"Edinburgh, UK","name":"CAV: Computer Aided Verification","start_date":"2010-07-15"},"has_accepted_license":"1","oa_version":"Submitted Version","month":"07","file":[{"access_level":"open_access","relation":"main_file","creator":"dernst","file_id":"7873","file_size":3633276,"checksum":"2eb211ce40b3c4988bce3a3592980704","date_created":"2020-05-19T16:31:56Z","content_type":"application/pdf","file_name":"2010_CAV_Cerny.pdf","date_updated":"2020-07-14T12:46:28Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"earlier_version","id":"5391","status":"public"}]},"status":"public","date_published":"2010-07-01T00:00:00Z","type":"conference","oa":1,"publist_id":"1066","page":"465 - 479","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:28Z","publisher":"Springer","_id":"4390","author":[{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Radhakrishna","first_name":"Arjun","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","first_name":"Damien","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736"},{"first_name":"Swarat","last_name":"Chaudhuri","full_name":"Chaudhuri, Swarat"},{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"}],"publication_status":"published","date_created":"2018-12-11T12:08:36Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","title":"Model checking of linearizability of concurrent list implementations","alternative_title":["LNCS"],"pubrep_id":"27","intvolume":"      6174","volume":6174,"ddc":["000"],"date_updated":"2023-02-23T12:24:12Z","year":"2010","citation":{"ama":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. Model checking of linearizability of concurrent list implementations. In: Vol 6174. Springer; 2010:465-479. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">10.1007/978-3-642-14295-6_41</a>","apa":"Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., &#38; Alur, R. (2010). Model checking of linearizability of concurrent list implementations (Vol. 6174, pp. 465–479). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">https://doi.org/10.1007/978-3-642-14295-6_41</a>","ieee":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, “Model checking of linearizability of concurrent list implementations,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 465–479.","chicago":"Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. “Model Checking of Linearizability of Concurrent List Implementations,” 6174:465–79. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">https://doi.org/10.1007/978-3-642-14295-6_41</a>.","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, in:, Springer, 2010, pp. 465–479.","mla":"Cerny, Pavol, et al. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. Vol. 6174, Springer, 2010, pp. 465–79, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_41\">10.1007/978-3-642-14295-6_41</a>.","ista":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. 2010. Model checking of linearizability of concurrent list implementations. CAV: Computer Aided Verification, LNCS, vol. 6174, 465–479."},"doi":"10.1007/978-3-642-14295-6_41","day":"01","abstract":[{"text":"Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each vertex stores an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free implementation and proved that the corrected version is linearizable.","lang":"eng"}]},{"month":"07","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems"}],"oa_version":"None","publication":"Time For Verification: Essays in Memory of Amir Pnueli","language":[{"iso":"eng"}],"publist_id":"1064","type":"book_chapter","date_published":"2010-07-29T00:00:00Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","intvolume":"      6200","title":"Quantitative Simulation Games","alternative_title":["LNCS"],"date_created":"2018-12-11T12:08:37Z","department":[{"_id":"ToHe"}],"publication_status":"published","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"_id":"4392","editor":[{"full_name":"Manna, Zohar","first_name":"Zohar","last_name":"Manna"},{"last_name":"Peled","first_name":"Doron","full_name":"Peled, Doron"}],"publisher":"Springer","series_title":"Essays in Memory of Amir Pnueli","quality_controlled":"1","ec_funded":1,"page":"42 - 60","abstract":[{"lang":"eng","text":"While a boolean notion of correctness is given by a preorder on systems and properties, a quantitative notion of correctness is defined by a distance function on systems and properties, where the distance between a system and a property provides a measure of “fit” or “desirability.” In this article, we explore several ways how the simulation preorder can be generalized to a distance function. This is done by equipping the classical simulation game between a system and a property with quantitative objectives. In particular, for systems that satisfy a property, a quantitative simulation game can measure the “robustness” of the satisfaction, that is, how much the system can deviate from its nominal behavior while still satisfying the property. For systems that violate a property, a quantitative simulation game can measure the “seriousness” of the violation, that is, how much the property has to be modified so that it is satisfied by the system. These distances can be computed in polynomial time, since the computation reduces to the value problem in limit average games with constant weights. Finally, we demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes. "}],"day":"29","doi":"10.1007/978-3-642-13754-9_3","year":"2010","citation":{"ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010.Quantitative Simulation Games. In: Time For Verification: Essays in Memory of Amir Pnueli. LNCS, vol. 6200, 42–60.","mla":"Cerny, Pavol, et al. “Quantitative Simulation Games.” <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, edited by Zohar Manna and Doron Peled, vol. 6200, Springer, 2010, pp. 42–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">10.1007/978-3-642-13754-9_3</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Z. Manna, D. Peled (Eds.), Time For Verification: Essays in Memory of Amir Pnueli, Springer, 2010, pp. 42–60.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Simulation Games.” In <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, edited by Zohar Manna and Doron Peled, 6200:42–60. Essays in Memory of Amir Pnueli. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">https://doi.org/10.1007/978-3-642-13754-9_3</a>.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative Simulation Games,” in <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, vol. 6200, Z. Manna and D. Peled, Eds. Springer, 2010, pp. 42–60.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). Quantitative Simulation Games. In Z. Manna &#38; D. Peled (Eds.), <i>Time For Verification: Essays in Memory of Amir Pnueli</i> (Vol. 6200, pp. 42–60). Springer. <a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">https://doi.org/10.1007/978-3-642-13754-9_3</a>","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative Simulation Games. In: Manna Z, Peled D, eds. <i>Time For Verification: Essays in Memory of Amir Pnueli</i>. Vol 6200. Essays in Memory of Amir Pnueli. Springer; 2010:42-60. doi:<a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">10.1007/978-3-642-13754-9_3</a>"},"date_updated":"2021-01-12T07:56:38Z","volume":6200},{"acknowledgement":"This work was partially supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","volume":6269,"ddc":["005"],"year":"2010","citation":{"ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances. CONCUR: Concurrency Theory, LNCS, vol. 6269, 235–268.","mla":"Cerny, Pavol, et al. <i>Simulation Distances</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–68, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">10.1007/978-3-642-15375-4_18</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–268.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 235–268.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances,” 6269:235–68. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">https://doi.org/10.1007/978-3-642-15375-4_18</a>.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). Simulation distances (Vol. 6269, pp. 235–268). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">https://doi.org/10.1007/978-3-642-15375-4_18</a>","ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation distances. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:235-268. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">10.1007/978-3-642-15375-4_18</a>"},"date_updated":"2023-02-23T12:24:04Z","day":"01","doi":"10.1007/978-3-642-15375-4_18","abstract":[{"lang":"eng","text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the implementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes."}],"ec_funded":1,"quality_controlled":"1","page":"235 - 268","file_date_updated":"2020-07-14T12:46:28Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":1,"_id":"4393","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"}],"department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:08:37Z","publication_status":"published","intvolume":"      6269","pubrep_id":"42","title":"Simulation distances","alternative_title":["LNCS"],"file":[{"date_created":"2018-12-12T10:15:12Z","checksum":"ea567903676ba8afe0507ee11313dce5","file_size":198913,"date_updated":"2020-07-14T12:46:28Z","content_type":"application/pdf","file_name":"IST-2012-42-v1+1_Simulation_distances.pdf","access_level":"open_access","relation":"main_file","file_id":"5130","creator":"system"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"3249","relation":"later_version"},{"relation":"earlier_version","id":"5389","status":"public"}]},"status":"public","type":"conference","date_published":"2010-11-01T00:00:00Z","oa":1,"publist_id":"1065","language":[{"iso":"eng"}],"conference":{"end_date":"2010-09-03","location":"Paris, France","start_date":"2010-08-31","name":"CONCUR: Concurrency Theory"},"has_accepted_license":"1","project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems"}],"oa_version":"Submitted Version","month":"11"},{"oa":1,"publist_id":"1061","date_published":"2010-04-21T00:00:00Z","type":"conference","file":[{"content_type":"application/pdf","file_name":"IST-2012-41-v1+1_Shape_refinement_through_explicit_heap_analysis.pdf","date_updated":"2020-07-14T12:46:29Z","checksum":"7d26e59a9681487d7283eba337292b2c","file_size":312147,"date_created":"2018-12-12T10:18:13Z","creator":"system","file_id":"5332","relation":"main_file","access_level":"open_access"}],"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","project":[{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"month":"04","has_accepted_license":"1","conference":{"start_date":"2010-03-20","name":"FASE: Fundamental Approaches To Software Engineering","location":"Paphos, Cyprus","end_date":"2010-03-28"},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-12029-9_19","day":"21","abstract":[{"text":"Shape analysis is a promising technique to prove program properties about recursive data structures. The challenge is to automatically determine the data-structure type, and to supply the shape analysis with the necessary information about the data structure. We present a stepwise approach to the selection of instrumentation predicates for a TVLA-based shape analysis, which takes us a step closer towards the fully automatic verification of data structures. The approach uses two techniques to guide the refinement of shape abstractions: (1) during program exploration, an explicit heap analysis collects sample instances of the heap structures, which are used to identify the data structures that are manipulated by the program; and (2) during abstraction refinement along an infeasible error path, we consider different possible heap abstractions and choose the coarsest one that eliminates the infeasible path. We have implemented this combined approach for automatic shape refinement as an extension of the software model checker BLAST. Example programs from a data-structure library that manipulate doubly-linked lists and trees were successfully verified by our tool.","lang":"eng"}],"date_updated":"2021-01-12T07:56:40Z","year":"2010","citation":{"apa":"Beyer, D., Henzinger, T. A., Théoduloz, G., &#38; Zufferey, D. (2010). Shape refinement through explicit heap analysis. In D. Rosenblum &#38; G. Taenzer (Eds.) (Vol. 6013, pp. 263–277). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">https://doi.org/10.1007/978-3-642-12029-9_19</a>","ama":"Beyer D, Henzinger TA, Théoduloz G, Zufferey D. Shape refinement through explicit heap analysis. In: Rosenblum D, Taenzer G, eds. Vol 6013. Springer; 2010:263-277. doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">10.1007/978-3-642-12029-9_19</a>","ieee":"D. Beyer, T. A. Henzinger, G. Théoduloz, and D. Zufferey, “Shape refinement through explicit heap analysis,” presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 263–277.","chicago":"Beyer, Dirk, Thomas A Henzinger, Grégory Théoduloz, and Damien Zufferey. “Shape Refinement through Explicit Heap Analysis.” edited by David Rosenblum and Gabriele Taenzer, 6013:263–77. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">https://doi.org/10.1007/978-3-642-12029-9_19</a>.","short":"D. Beyer, T.A. Henzinger, G. Théoduloz, D. Zufferey, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 263–277.","mla":"Beyer, Dirk, et al. <i>Shape Refinement through Explicit Heap Analysis</i>. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 263–77, doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">10.1007/978-3-642-12029-9_19</a>.","ista":"Beyer D, Henzinger TA, Théoduloz G, Zufferey D. 2010. Shape refinement through explicit heap analysis. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 263–277."},"volume":6013,"ddc":["004"],"publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:08:38Z","pubrep_id":"41","title":"Shape refinement through explicit heap analysis","alternative_title":["LNCS"],"intvolume":"      6013","_id":"4396","scopus_import":1,"author":[{"first_name":"Dirk","last_name":"Beyer","full_name":"Beyer, Dirk"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Grégory","last_name":"Théoduloz","full_name":"Théoduloz, Grégory"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","last_name":"Zufferey","first_name":"Damien"}],"publisher":"Springer","editor":[{"full_name":"Rosenblum, David","first_name":"David","last_name":"Rosenblum"},{"first_name":"Gabriele","last_name":"Taenzer","full_name":"Taenzer, Gabriele"}],"page":"263 - 277","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:29Z"},{"date_created":"2018-12-12T11:39:05Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"oa_version":"Published Version","publication_status":"published","alternative_title":["IST Austria Technical Report"],"pubrep_id":"29","title":"Gist: A solver for probabilistic games","month":"10","has_accepted_license":"1","_id":"5393","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jobstmann","first_name":"Barbara","full_name":"Jobstmann, Barbara"},{"full_name":"Radhakrishna, Arjun","first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"publisher":"IST Austria","page":"12","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:43Z","day":"09","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2009-0003","oa":1,"abstract":[{"text":"Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable specifications. Our tool provides efficient implementations of several reduction based techniques to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic games for synthesizing environment assumptions for unrealizable specifications.","lang":"eng"}],"year":"2009","citation":{"ista":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver for probabilistic games, IST Austria, 12p.","mla":"Chatterjee, Krishnendu, et al. <i>Gist: A Solver for Probabilistic Games</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">10.15479/AT:IST-2009-0003</a>.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, Gist: A Solver for Probabilistic Games, IST Austria, 2009.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. <i>Gist: A Solver for Probabilistic Games</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">https://doi.org/10.15479/AT:IST-2009-0003</a>.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, <i>Gist: A solver for probabilistic games</i>. IST Austria, 2009.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Radhakrishna, A. (2009). <i>Gist: A solver for probabilistic games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">https://doi.org/10.15479/AT:IST-2009-0003</a>","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. <i>Gist: A Solver for Probabilistic Games</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">10.15479/AT:IST-2009-0003</a>"},"date_updated":"2023-02-23T12:09:01Z","type":"technical_report","date_published":"2009-10-09T00:00:00Z","file":[{"access_level":"open_access","relation":"main_file","creator":"system","file_id":"5459","checksum":"49551ac552915b17593a14c993845274","file_size":386866,"date_created":"2018-12-12T11:52:58Z","file_name":"IST-2009-0003_IST-2009-0003.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:43Z"}],"status":"public","ddc":["000","005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"later_version","id":"4388"}]}},{"date_published":"2009-09-09T00:00:00Z","type":"technical_report","date_updated":"2020-07-14T23:07:47Z","year":"2009","citation":{"apa":"Chatterjee, K., Henzinger, T. A., &#38; Horn, F. (2009). <i>Improved lower bounds for request-response and finitary Streett games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">https://doi.org/10.15479/AT:IST-2009-0002</a>","ama":"Chatterjee K, Henzinger TA, Horn F. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">10.15479/AT:IST-2009-0002</a>","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, <i>Improved lower bounds for request-response and finitary Streett games</i>. IST Austria, 2009.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">https://doi.org/10.15479/AT:IST-2009-0002</a>.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.","mla":"Chatterjee, Krishnendu, et al. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">10.15479/AT:IST-2009-0002</a>.","ista":"Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p."},"abstract":[{"lang":"eng","text":"We consider two-player games played on graphs with request-response and finitary Streett objectives. We show these games are PSPACE-hard, improving the previous known NP-hardness. We also improve the lower bounds on memory required by the winning strategies for the players."}],"oa":1,"doi":"10.15479/AT:IST-2009-0002","publication_identifier":{"issn":["2664-1690"]},"day":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"status":"public","file":[{"relation":"main_file","access_level":"open_access","file_id":"5511","creator":"system","date_created":"2018-12-12T11:53:50Z","checksum":"1c50a9723fbae1b2c46d18138968efb3","file_size":238091,"date_updated":"2020-07-14T12:46:43Z","content_type":"application/pdf","file_name":"IST-2009-0002_IST-2009-0002.pdf"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"37327ACE-F248-11E8-B48F-1D18A9856A87","last_name":"Horn","first_name":"Florian","full_name":"Horn, Florian"}],"_id":"5394","has_accepted_license":"1","month":"09","title":"Improved lower bounds for request-response and finitary Streett games","pubrep_id":"30","alternative_title":["IST Austria Technical Report"],"publication_status":"published","oa_version":"Published Version","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-12T11:39:05Z","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:43Z","page":"11","publisher":"IST Austria"}]