[{"publication_status":"published","status":"public","publication_identifier":{"issn":["0162-8828"]},"issue":"5","pmid":1,"date_updated":"2024-10-22T08:02:31Z","volume":33,"article_processing_charge":"No","citation":{"ieee":"M. M. Bronstein and A. M. Bronstein, “Shape recognition with spectral distances,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 33, no. 5. Institute of Electrical and Electronics Engineers, pp. 1065–1071, 2011.","mla":"Bronstein, Michael M., and Alex M. Bronstein. “Shape Recognition with Spectral Distances.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 33, no. 5, Institute of Electrical and Electronics Engineers, 2011, pp. 1065–71, doi:<a href=\"https://doi.org/10.1109/tpami.2010.210\">10.1109/tpami.2010.210</a>.","chicago":"Bronstein, Michael M, and Alex M. Bronstein. “Shape Recognition with Spectral Distances.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. Institute of Electrical and Electronics Engineers, 2011. <a href=\"https://doi.org/10.1109/tpami.2010.210\">https://doi.org/10.1109/tpami.2010.210</a>.","ista":"Bronstein MM, Bronstein AM. 2011. Shape recognition with spectral distances. IEEE Transactions on Pattern Analysis and Machine Intelligence. 33(5), 1065–1071.","ama":"Bronstein MM, Bronstein AM. Shape recognition with spectral distances. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2011;33(5):1065-1071. doi:<a href=\"https://doi.org/10.1109/tpami.2010.210\">10.1109/tpami.2010.210</a>","apa":"Bronstein, M. M., &#38; Bronstein, A. M. (2011). Shape recognition with spectral distances. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/tpami.2010.210\">https://doi.org/10.1109/tpami.2010.210</a>","short":"M.M. Bronstein, A.M. Bronstein, IEEE Transactions on Pattern Analysis and Machine Intelligence 33 (2011) 1065–1071."},"external_id":{"pmid":["21135442"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1109/tpami.2010.210","date_published":"2011-05-01T00:00:00Z","scopus_import":"1","language":[{"iso":"eng"}],"publisher":"Institute of Electrical and Electronics Engineers","month":"05","extern":"1","year":"2011","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","_id":"18411","abstract":[{"text":"Recent works have shown the use of diffusion geometry for various pattern recognition applications, including nonrigid shape analysis. In this paper, we introduce spectral shape distance as a general framework for distribution-based shape similarity and show that two recent methods for shape similarity due to Rustamov and Mahmoudi and Sapiro are particular cases thereof.","lang":"eng"}],"title":"Shape recognition with spectral distances","OA_type":"closed access","quality_controlled":"1","article_type":"original","doi":"10.1109/tpami.2010.210","oa_version":"None","date_created":"2024-10-15T11:20:54Z","author":[{"last_name":"Bronstein","first_name":"Michael M","full_name":"Bronstein, Michael M"},{"full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","orcid":"0000-0001-9699-8730","last_name":"Bronstein"}],"type":"journal_article","intvolume":"        33","page":"1065-1071","day":"01"},{"abstract":[{"text":"The computer vision and pattern recognition communities have recently witnessed a surge of feature-based methods in object recognition and image retrieval applications. These methods allow representing images as collections of “visual words” and treat them using text search approaches following the “bag of features” paradigm. In this article, we explore analogous approaches in the 3D world applied to the problem of nonrigid shape retrieval in large databases. Using multiscale diffusion heat kernels as “geometric words,” we construct compact and informative shape descriptors by means of the “bag of features” approach. We also show that considering pairs of “geometric words” (“geometric expressions”) allows creating spatially sensitive bags of features with better discriminative power. Finally, adopting metric learning approaches, we show that shapes can be efficiently represented as binary codes. Our approach achieves state-of-the-art results on the SHREC 2010 large-scale shape retrieval benchmark.","lang":"eng"}],"publication_status":"published","title":"Shape google: Geometric words and expressions for invariant shape retrieval","status":"public","quality_controlled":"1","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"issue":"1","doi":"10.1145/1899404.1899405","oa_version":"None","date_updated":"2024-12-18T14:59:43Z","volume":30,"citation":{"short":"A.M. Bronstein, M.M. Bronstein, L.J. Guibas, M. Ovsjanikov, ACM Transactions on Graphics 30 (2011) 1–20.","apa":"Bronstein, A. M., Bronstein, M. M., Guibas, L. J., &#38; Ovsjanikov, M. (2011). Shape google: Geometric words and expressions for invariant shape retrieval. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/1899404.1899405\">https://doi.org/10.1145/1899404.1899405</a>","ista":"Bronstein AM, Bronstein MM, Guibas LJ, Ovsjanikov M. 2011. Shape google: Geometric words and expressions for invariant shape retrieval. ACM Transactions on Graphics. 30(1), 1–20.","ama":"Bronstein AM, Bronstein MM, Guibas LJ, Ovsjanikov M. Shape google: Geometric words and expressions for invariant shape retrieval. <i>ACM Transactions on Graphics</i>. 2011;30(1):1-20. doi:<a href=\"https://doi.org/10.1145/1899404.1899405\">10.1145/1899404.1899405</a>","chicago":"Bronstein, Alex M., Michael M. Bronstein, Leonidas J. Guibas, and Maks Ovsjanikov. “Shape Google: Geometric Words and Expressions for Invariant Shape Retrieval.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2011. <a href=\"https://doi.org/10.1145/1899404.1899405\">https://doi.org/10.1145/1899404.1899405</a>.","mla":"Bronstein, Alex M., et al. “Shape Google: Geometric Words and Expressions for Invariant Shape Retrieval.” <i>ACM Transactions on Graphics</i>, vol. 30, no. 1, Association for Computing Machinery, 2011, pp. 1–20, doi:<a href=\"https://doi.org/10.1145/1899404.1899405\">10.1145/1899404.1899405</a>.","ieee":"A. M. Bronstein, M. M. Bronstein, L. J. Guibas, and M. Ovsjanikov, “Shape google: Geometric words and expressions for invariant shape retrieval,” <i>ACM Transactions on Graphics</i>, vol. 30, no. 1. Association for Computing Machinery, pp. 1–20, 2011."},"article_processing_charge":"No","date_created":"2024-10-15T11:20:55Z","author":[{"last_name":"Bronstein","orcid":"0000-0001-9699-8730","first_name":"Alexander","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"last_name":"Bronstein","full_name":"Bronstein, Michael M.","first_name":"Michael M."},{"first_name":"Leonidas J.","full_name":"Guibas, Leonidas J.","last_name":"Guibas"},{"last_name":"Ovsjanikov","full_name":"Ovsjanikov, Maks","first_name":"Maks"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1145/1899404.1899405","intvolume":"        30","scopus_import":"1","date_published":"2011-01-01T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","month":"01","publisher":"Association for Computing Machinery","page":"1-20","extern":"1","year":"2011","publication":"ACM Transactions on Graphics","_id":"18433","day":"01"},{"day":"01","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1002.1756","open_access":"1"}],"page":"1805-1817","intvolume":"       139","type":"journal_article","mathsc":["35L71"],"OA_place":"repository","author":[{"full_name":"Killip, Rowan","first_name":"Rowan","last_name":"Killip"},{"first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","full_name":"Visan, Monica","last_name":"Visan"}],"date_created":"2026-06-19T08:11:09Z","oa_version":"Preprint","doi":"10.1090/s0002-9939-2010-10615-9","article_type":"original","OA_type":"green","quality_controlled":"1","title":"The radial defocusing energy-supercritical nonlinear wave equation in all space dimensions","das_tickbox":"1","abstract":[{"lang":"eng","text":"We consider the defocusing nonlinear wave equation utt − Δu +\r\n|u|\r\npu = 0 with spherically-symmetric initial data in the regime 4\r\nd−2 <p< 4\r\nd−3\r\n(which is energy-supercritical) and dimensions 3 ≤ d ≤ 6; we also consider\r\nd ≥ 7, but for a smaller range of p> 4\r\nd−2 . The principal result is that\r\nblowup (or failure to scatter) must be accompanied by blowup of the critical\r\nSobolev norm. An equivalent formulation is that maximal-lifespan solutions\r\nwith bounded critical Sobolev norm are global and scatter"}],"_id":"22061","publication":"Proceedings of the American Mathematical Society","year":"2011","extern":"1","month":"05","publisher":"American Mathematical Society","scopus_import":"1","fulldoi":"https://doi.org/10.1090/s0002-9939-2010-10615-9","date_published":"2011-05-01T00:00:00Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"oa":1,"external_id":{"arxiv":["1002.1756"]},"citation":{"mla":"Killip, Rowan, and Monica Vişan. “The Radial Defocusing Energy-Supercritical Nonlinear Wave Equation in All Space Dimensions.” <i>Proceedings of the American Mathematical Society</i>, vol. 139, no. 5, American Mathematical Society, 2011, pp. 1805–17, doi:<a href=\"https://doi.org/10.1090/s0002-9939-2010-10615-9\">10.1090/s0002-9939-2010-10615-9</a>.","chicago":"Killip, Rowan, and Monica Vişan. “The Radial Defocusing Energy-Supercritical Nonlinear Wave Equation in All Space Dimensions.” <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society, 2011. <a href=\"https://doi.org/10.1090/s0002-9939-2010-10615-9\">https://doi.org/10.1090/s0002-9939-2010-10615-9</a>.","ieee":"R. Killip and M. Vişan, “The radial defocusing energy-supercritical nonlinear wave equation in all space dimensions,” <i>Proceedings of the American Mathematical Society</i>, vol. 139, no. 5. American Mathematical Society, pp. 1805–1817, 2011.","apa":"Killip, R., &#38; Vişan, M. (2011). The radial defocusing energy-supercritical nonlinear wave equation in all space dimensions. <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/s0002-9939-2010-10615-9\">https://doi.org/10.1090/s0002-9939-2010-10615-9</a>","short":"R. Killip, M. Vişan, Proceedings of the American Mathematical Society 139 (2011) 1805–1817.","ama":"Killip R, Vişan M. The radial defocusing energy-supercritical nonlinear wave equation in all space dimensions. <i>Proceedings of the American Mathematical Society</i>. 2011;139(5):1805-1817. doi:<a href=\"https://doi.org/10.1090/s0002-9939-2010-10615-9\">10.1090/s0002-9939-2010-10615-9</a>","ista":"Killip R, Vişan M. 2011. The radial defocusing energy-supercritical nonlinear wave equation in all space dimensions. Proceedings of the American Mathematical Society. 139(5), 1805–1817."},"article_processing_charge":"No","volume":139,"date_updated":"2026-06-29T10:44:15Z","issue":"5","publication_identifier":{"eissn":["1088-6826"],"issn":["0002-9939"]},"status":"public","publication_status":"published"},{"day":"14","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3876"}]},"corr_author":"1","date_created":"2018-12-11T12:02:37Z","type":"journal_article","intvolume":"         7","license":"https://creativecommons.org/licenses/by-nd/4.0/","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"}],"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Prabhu","first_name":"Vinayak","full_name":"Prabhu, Vinayak"}],"doi":"10.2168/LMCS-7(4:8)2011","oa_version":"Published Version","ddc":["000","005"],"das_tickbox":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Timed parity games: Complexity and robustness","abstract":[{"text":"We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are concurrent in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is chosen. To prevent a player from winning by blocking time, we restrict each player to play strategies that ensure that the player cannot be responsible for causing a zeno run. First, we present an efficient reduction of these games to turn-based (i.e., not concurrent) finite-state (i.e., untimed) parity games. Our reduction improves the best known complexity for solving timed parity games. Moreover, the rich class of algorithms for classical parity games can now be applied to timed parity games. The states of the resulting game are based on clock regions of the original game, and the state space of the finite game is linear in the size of the region graph. Second, we consider two restricted classes of strategies for the player that represents the controller in a real-time synthesis problem, namely, limit-robust and bounded-robust winning strategies. Using a limit-robust winning strategy, the controller cannot choose an exact real-valued time delay but must allow for some nonzero jitter in each of its actions. If there is a given lower bound on the jitter, then the strategy is bounded-robust winning. We show that exact strategies are more powerful than limit-robust strategies, which are more powerful than bounded-robust winning strategies for any bound. For both kinds of robust strategies, we present efficient reductions to standard timed automaton games. These reductions provide algorithms for the synthesis of robust real-time controllers.","lang":"eng"}],"quality_controlled":"1","year":"2011","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png"},"month":"12","publisher":"International Federation for Computational Logic","_id":"3315","publication":"Logical Methods in Computer Science","has_accepted_license":"1","oa":1,"file_date_updated":"2020-07-14T12:46:07Z","volume":7,"article_processing_charge":"No","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” <i>Logical Methods in Computer Science</i>, vol. 7, no. 4. International Federation for Computational Logic, 2011.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2011. <a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">https://doi.org/10.2168/LMCS-7(4:8)2011</a>.","mla":"Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.” <i>Logical Methods in Computer Science</i>, vol. 7, no. 4, International Federation for Computational Logic, 2011, doi:<a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">10.2168/LMCS-7(4:8)2011</a>.","ama":"Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness. <i>Logical Methods in Computer Science</i>. 2011;7(4). doi:<a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">10.2168/LMCS-7(4:8)2011</a>","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).","apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2011). Timed parity games: Complexity and robustness. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">https://doi.org/10.2168/LMCS-7(4:8)2011</a>"},"fulldoi":"https://doi.org/10.2168/LMCS-7(4:8)2011","date_published":"2011-12-14T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":"1","file":[{"date_created":"2018-12-12T10:16:42Z","checksum":"3480e1594bbef25ff7462fa93a8a814e","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5231","date_updated":"2020-07-14T12:46:07Z","creator":"system","file_name":"IST-2016-86-v2+1_1011.0688_3_.pdf","file_size":588863}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"3324","ec_funded":1,"date_updated":"2026-07-06T13:25:39Z","pubrep_id":"506","status":"public","publication_status":"published","issue":"4"},{"type":"conference","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Anmol","full_name":"Singh, Anmol","id":"72A86902-E99F-11E9-9F62-915534D1B916","last_name":"Singh"},{"last_name":"Singh","first_name":"Vasu","full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas"},{"orcid":"0000-0002-3197-8736","last_name":"Zufferey","first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien"}],"date_created":"2018-12-11T12:02:33Z","day":"14","corr_author":"1","page":"1 - 6","quality_controlled":"1","title":"Static scheduling in clouds","das_tickbox":"1","department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We present a new job execution environment Flextic that exploits scal- able static scheduling techniques to provide the user with a flexible pricing model, such as a tradeoff between dif- ferent degrees of execution speed and execution price, and at the same time, reduce scheduling overhead for the cloud provider. We have evaluated a prototype of Flextic on Amazon EC2 and compared it against Hadoop. For various data parallel jobs from machine learning, im- age processing, and gene sequencing that we considered, Flextic has low scheduling overhead and reduces job du- ration by up to 15% compared to Hadoop, a dynamic cloud scheduler."}],"oa_version":"Submitted Version","ddc":["000","005"],"language":[{"iso":"eng"}],"date_published":"2011-06-14T00:00:00Z","file":[{"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2012-90-v1+1_Static_scheduling_in_clouds.pdf","file_size":232770,"creator":"system","date_updated":"2020-07-14T12:46:06Z","file_id":"5333","date_created":"2018-12-12T10:18:14Z","relation":"main_file","checksum":"21a461ac004bb535c83320fe79b30375"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:06Z","conference":{"name":"HotCloud: Workshop on Hot Topics in Cloud Computing","end_date":"2011-06-15","location":"Portland, OR, United States","start_date":"2011-06-14"},"citation":{"short":"T.A. Henzinger, A. Singh, V. Singh, T. Wies, D. Zufferey, in:, 3rd USENIX Workshop on Hot Topics in Cloud Computing, Usenix Association, 2011, pp. 1–6.","apa":"Henzinger, T. A., Singh, A., Singh, V., Wies, T., &#38; Zufferey, D. (2011). Static scheduling in clouds. In <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i> (pp. 1–6). Portland, OR, United States: Usenix Association.","ista":"Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. 2011. Static scheduling in clouds. 3rd USENIX Workshop on Hot Topics in Cloud Computing. HotCloud: Workshop on Hot Topics in Cloud Computing, 1–6.","ama":"Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. Static scheduling in clouds. In: <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>. Usenix Association; 2011:1-6.","chicago":"Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey. “Static Scheduling in Clouds.” In <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>, 1–6. Usenix Association, 2011.","mla":"Henzinger, Thomas A., et al. “Static Scheduling in Clouds.” <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>, Usenix Association, 2011, pp. 1–6.","ieee":"T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling in clouds,” in <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>, Portland, OR, United States, 2011, pp. 1–6."},"article_processing_charge":"No","_id":"3302","publication":"3rd USENIX Workshop on Hot Topics in Cloud Computing","year":"2011","month":"06","publisher":"Usenix Association","pubrep_id":"90","status":"public","publication_status":"published","date_updated":"2026-07-07T06:07:16Z","publist_id":"3338"},{"abstract":[{"lang":"eng","text":"There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point of time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with \"controlled-accumulation\", allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable."}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"title":"Temporal specifications with accumulative values","doi":"10.1109/LICS.2011.33","oa_version":"Submitted Version","ddc":["000","004"],"isi":1,"date_created":"2018-12-11T12:02:52Z","author":[{"last_name":"Boker","first_name":"Udi","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"}],"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"type":"conference","related_material":{"record":[{"id":"5385","status":"public","relation":"earlier_version"},{"id":"2038","status":"public","relation":"later_version"}]},"day":"21","publication_status":"published","article_number":"5970226","pubrep_id":"83","status":"public","publist_id":"3259","ec_funded":1,"date_updated":"2026-07-07T14:01:43Z","article_processing_charge":"No","citation":{"mla":"Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>. 5970226, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/LICS.2011.33\">10.1109/LICS.2011.33</a>.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” IEEE, 2011. <a href=\"https://doi.org/10.1109/LICS.2011.33\">https://doi.org/10.1109/LICS.2011.33</a>.","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. <a href=\"https://doi.org/10.1109/LICS.2011.33\">https://doi.org/10.1109/LICS.2011.33</a>","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. In: IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/LICS.2011.33\">10.1109/LICS.2011.33</a>"},"conference":{"name":"LICS: Logic in Computer Science","end_date":"2011-06-24","location":"Toronto, Canada","start_date":"2011-06-21"},"external_id":{"isi":["000297350400007"]},"file_date_updated":"2020-07-14T12:46:09Z","oa":1,"has_accepted_license":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file":[{"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:46:09Z","file_id":"4960","file_size":225426,"file_name":"IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf","creator":"system","date_created":"2018-12-12T10:12:42Z","checksum":"792128f5455f0f40f1105f0398e05fa9","relation":"main_file"}],"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1109/LICS.2011.33","scopus_import":"1","date_published":"2011-06-21T00:00:00Z","publisher":"IEEE","month":"06","year":"2011","_id":"3356"},{"title":"Temporal specifications with accumulative values","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point of time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with “controlled-accumulation”, allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable."}],"alternative_title":["IST Austria Technical Report"],"doi":"10.15479/AT:IST-2011-0003","oa_version":"Published Version","ddc":["000","004"],"date_created":"2018-12-12T11:39:02Z","type":"technical_report","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","first_name":"Udi","last_name":"Boker"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"page":"14","day":"04","related_material":{"record":[{"relation":"later_version","id":"3356","status":"public"},{"relation":"later_version","status":"public","id":"2038"}]},"pubrep_id":"21","status":"public","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"ec_funded":1,"date_updated":"2026-07-07T14:01:43Z","oa":1,"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:41Z","citation":{"ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. <i>Temporal Specifications with Accumulative Values</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">10.15479/AT:IST-2011-0003</a>","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). <i>Temporal specifications with accumulative values</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">https://doi.org/10.15479/AT:IST-2011-0003</a>","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, <i>Temporal specifications with accumulative values</i>. IST Austria, 2011.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. <i>Temporal Specifications with Accumulative Values</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">https://doi.org/10.15479/AT:IST-2011-0003</a>.","mla":"Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">10.15479/AT:IST-2011-0003</a>."},"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.15479/AT:IST-2011-0003","date_published":"2011-04-04T00:00:00Z","file":[{"checksum":"8491d0d48c4911620ecd5350b413c11e","relation":"main_file","date_created":"2018-12-12T11:53:00Z","file_id":"5461","date_updated":"2020-07-14T12:46:41Z","creator":"system","file_name":"IST-2011-0003_IST-2011-0003.pdf","file_size":366281,"access_level":"open_access","content_type":"application/pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2011","month":"04","publisher":"IST Austria","_id":"5385"},{"doi":"10.15479/AT:IST-2011-0007","oa_version":"Published Version","ddc":["000","005"],"title":"Partial-observation stochastic games: How to win when belief fails","department":[{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"In two-player finite-state stochastic games of partial obser- vation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distri- bution over the successor states. The game is played for infinitely many rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1) or pos- itively (i.e., with positive probability), no matter the strategy of the second player.\r\n\r\nWe classify such games according to the information and to the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two- sided with (c) both players having partial observation. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization.\r\n\r\nOur main results for pure strategies are as follows: (1) For one-sided games with player 2 perfect observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strate- gies are not sufficient, and present an exponential upper bound on mem- ory both for almost-sure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid the explicit exponential construction. (2) For one-sided games with player 1 perfect observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and posi- tive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least non-elementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence re- sult exhibit serious flaws in previous results in the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed."}],"alternative_title":["IST Austria Technical Report"],"page":"43","related_material":{"record":[{"relation":"later_version","id":"1903","status":"public"},{"relation":"later_version","status":"public","id":"2955"},{"relation":"later_version","status":"public","id":"2211"}]},"day":"05","date_created":"2018-12-12T11:39:00Z","type":"technical_report","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"}],"date_updated":"2026-07-07T14:01:25Z","pubrep_id":"17","status":"public","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"year":"2011","publisher":"IST Austria","month":"07","_id":"5381","file_date_updated":"2020-07-14T12:46:39Z","oa":1,"has_accepted_license":"1","citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>.","ieee":"K. Chatterjee and L. Doyen, <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria, 2011.","short":"K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011.","apa":"Chatterjee, K., &#38; Doyen, L. (2011). <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>","ista":"Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p.","ama":"Chatterjee K, Doyen L. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>"},"fulldoi":"https://doi.org/10.15479/AT:IST-2011-0007","language":[{"iso":"eng"}],"date_published":"2011-07-05T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2018-12-12T11:53:27Z","checksum":"06bf6dfc97f6006e3fd0e9a3f31bc961","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5488","date_updated":"2020-07-14T12:46:39Z","creator":"system","file_name":"IST-2011-0007_IST-2011-0007.pdf","file_size":574055}]},{"isi":1,"date_created":"2018-12-11T12:02:51Z","intvolume":"        33","type":"journal_article","author":[{"last_name":"Tripakis","first_name":"Stavros","full_name":"Tripakis, Stavros"},{"last_name":"Lickly","full_name":"Lickly, Ben","first_name":"Ben"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"full_name":"Lee, Edward","first_name":"Edward","last_name":"Lee"}],"project":[{"call_identifier":"FP7","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques"},{"call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"}],"day":"01","das_tickbox":"1","department":[{"_id":"ToHe"}],"title":"A theory of synchronous relational interfaces","abstract":[{"text":"Compositional theories are crucial when designing large and complex systems from smaller components. In this work we propose such a theory for synchronous concurrent systems. Our approach follows so-called interface theories, which use game-theoretic interpretations of composition and refinement. These are appropriate for systems with distinct inputs and outputs, and explicit conditions on inputs that must be enforced during composition. Our interfaces model systems that execute in an infinite sequence of synchronous rounds. At each round, a contract must be satisfied. The contract is simply a relation specifying the set of valid input/output pairs. Interfaces can be composed by parallel, serial or feedback composition. A refinement relation between interfaces is defined, and shown to have two main properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability, namely, the ability to replace an interface by another one in any context. Shared refinement and abstraction operators, corresponding to greatest lower and least upper bounds with respect to refinement, are also defined. Input-complete interfaces, that impose no restrictions on inputs, and deterministic interfaces, that produce a unique output for any legal input, are discussed as special cases, and an interesting duality between the two classes is exposed. A number of illustrative examples are provided, as well as algorithms to compute compositions, check refinement, and so on, for finite-state interfaces.","lang":"eng"}],"quality_controlled":"1","doi":"10.1145/1985342.1985345","ddc":["000","005"],"oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:46:09Z","external_id":{"isi":["000292766400003"]},"has_accepted_license":"1","oa":1,"volume":33,"citation":{"ieee":"S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous relational interfaces,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 33, no. 4. ACM, 2011.","mla":"Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 33, no. 4, 14, ACM, 2011, doi:<a href=\"https://doi.org/10.1145/1985342.1985345\">10.1145/1985342.1985345</a>.","chicago":"Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.” <i>ACM Transactions on Programming Languages and Systems</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/1985342.1985345\">https://doi.org/10.1145/1985342.1985345</a>.","ista":"Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems. 33(4), 14.","ama":"Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational interfaces. <i>ACM Transactions on Programming Languages and Systems</i>. 2011;33(4). doi:<a href=\"https://doi.org/10.1145/1985342.1985345\">10.1145/1985342.1985345</a>","apa":"Tripakis, S., Lickly, B., Henzinger, T. A., &#38; Lee, E. (2011). A theory of synchronous relational interfaces. <i>ACM Transactions on Programming Languages and Systems</i>. ACM. <a href=\"https://doi.org/10.1145/1985342.1985345\">https://doi.org/10.1145/1985342.1985345</a>","short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems 33 (2011)."},"article_processing_charge":"No","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1145/1985342.1985345","scopus_import":"1","date_published":"2011-07-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2018-12-12T10:16:45Z","checksum":"5d44a8aa81e33210649beae507602138","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:46:09Z","file_id":"5235","creator":"system","file_size":775662,"file_name":"IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf"}],"year":"2011","publisher":"ACM","month":"07","_id":"3353","publication":"ACM Transactions on Programming Languages and Systems","pubrep_id":"85","status":"public","article_number":"14","publication_status":"published","issue":"4","publist_id":"3263","ec_funded":1,"date_updated":"2026-07-07T14:03:34Z"},{"date_updated":"2026-07-07T14:02:38Z","publist_id":"3262","issue":"4","publication_status":"published","article_number":"28","status":"public","publication":"ACM Transactions on Computational Logic","_id":"3354","publisher":"ACM","month":"07","year":"2011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2011-07-04T00:00:00Z","fulldoi":"https://doi.org/10.1145/1970398.1970404","language":[{"iso":"eng"}],"scopus_import":"1","volume":12,"citation":{"ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” <i>ACM Transactions on Computational Logic</i>, vol. 12, no. 4. ACM, 2011.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.” <i>ACM Transactions on Computational Logic</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/1970398.1970404\">https://doi.org/10.1145/1970398.1970404</a>.","mla":"Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” <i>ACM Transactions on Computational Logic</i>, vol. 12, no. 4, 28, ACM, 2011, doi:<a href=\"https://doi.org/10.1145/1970398.1970404\">10.1145/1970398.1970404</a>.","ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic. 12(4), 28.","ama":"Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games. <i>ACM Transactions on Computational Logic</i>. 2011;12(4). doi:<a href=\"https://doi.org/10.1145/1970398.1970404\">10.1145/1970398.1970404</a>","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic 12 (2011).","apa":"Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2011). Qualitative concurrent parity games. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/1970398.1970404\">https://doi.org/10.1145/1970398.1970404</a>"},"article_processing_charge":"No","external_id":{"isi":["000296202300006"]},"oa_version":"None","doi":"10.1145/1970398.1970404","quality_controlled":"1","abstract":[{"lang":"eng","text":"We consider two-player games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We consider ω-regular winning conditions specified as parity objectives. Both players are allowed to use randomization when choosing their moves. We study the computation of the limit-winning set of states, consisting of the states where the sup-inf value of the game for player 1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability of winning arbitrarily close to 1. We show that the limit-winning set can be computed in O(n2d+2) time, where n is the size of the game structure and 2d is the number of priorities (or colors). The membership problem of whether a state belongs to the limit-winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms are considerably more involved than those for turn-based games. This is because concurrent games do not satisfy two of the most fundamental properties of turn-based parity games. First, in concurrent games limit-winning strategies require randomization; and second, they require infinite memory."}],"das_tickbox":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Qualitative concurrent parity games","corr_author":"1","related_material":{"record":[{"id":"2054","status":"public","relation":"later_version"}]},"day":"04","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"De Alfaro, Luca","first_name":"Luca","last_name":"De Alfaro"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"}],"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"type":"journal_article","intvolume":"        12","isi":1,"date_created":"2018-12-11T12:02:51Z"},{"intvolume":"       138","type":"journal_article","author":[{"id":"261CB030-E90D-11E9-B182-F697D44B663C","full_name":"Stockinger, Petra","first_name":"Petra","last_name":"Stockinger"},{"orcid":"0000-0002-0912-4566","last_name":"Heisenberg","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-3688-1474","last_name":"Maître","full_name":"Maître, Jean-Léon","id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87","first_name":"Jean-Léon"}],"isi":1,"date_created":"2018-12-11T12:03:06Z","day":"01","corr_author":"1","page":"4673 - 4683","quality_controlled":"1","department":[{"_id":"CaHe"}],"title":"Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube","abstract":[{"text":"Facial branchiomotor neurons (FBMNs) in zebrafish and mouse embryonic hindbrain undergo a characteristic tangential migration from rhombomere (r) 4, where they are born, to r6/7. Cohesion among neuroepithelial cells (NCs) has been suggested to function in FBMN migration by inhibiting FBMNs positioned in the basal neuroepithelium such that they move apically between NCs towards the midline of the neuroepithelium instead of tangentially along the basal side of the neuroepithelium towards r6/7. However, direct experimental evaluation of this hypothesis is still lacking. Here, we have used a combination of biophysical cell adhesion measurements and high-resolution time-lapse microscopy to determine the role of NC cohesion in FBMN migration. We show that reducing NC cohesion by interfering with Cadherin 2 (Cdh2) activity results in FBMNs positioned at the basal side of the neuroepithelium moving apically towards the neural tube midline instead of tangentially towards r6/7. In embryos with strongly reduced NC cohesion, ectopic apical FBMN movement frequently results in fusion of the bilateral FBMN clusters over the apical midline of the neural tube. By contrast, reducing cohesion among FBMNs by interfering with Contactin 2 (Cntn2) expression in these cells has little effect on apical FBMN movement, but reduces the fusion of the bilateral FBMN clusters in embryos with strongly diminished NC cohesion. These data provide direct experimental evidence that NC cohesion functions in tangential FBMN migration by restricting their apical movement.","lang":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"oa_version":"Published Version","ddc":["570"],"article_type":"original","doi":"10.1242/dev.071233","fulldoi":"https://doi.org/10.1242/dev.071233","date_published":"2011-11-01T00:00:00Z","scopus_import":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","checksum":"ca12b79e01ef36c1ef1aea31cf7e7139","date_created":"2019-10-07T14:19:42Z","file_name":"2011_Development_Stockinger.pdf","file_size":4672439,"creator":"dernst","date_updated":"2020-07-14T12:46:12Z","file_id":"6930","content_type":"application/pdf","access_level":"open_access"}],"external_id":{"isi":["000296060100011"]},"file_date_updated":"2020-07-14T12:46:12Z","oa":1,"has_accepted_license":"1","citation":{"short":"P. Stockinger, C.-P.J. Heisenberg, J.-L. Maître, Development 138 (2011) 4673–4683.","apa":"Stockinger, P., Heisenberg, C.-P. J., &#38; Maître, J.-L. (2011). Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.071233\">https://doi.org/10.1242/dev.071233</a>","ama":"Stockinger P, Heisenberg C-PJ, Maître J-L. Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. <i>Development</i>. 2011;138(21):4673-4683. doi:<a href=\"https://doi.org/10.1242/dev.071233\">10.1242/dev.071233</a>","ista":"Stockinger P, Heisenberg C-PJ, Maître J-L. 2011. Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. Development. 138(21), 4673–4683.","chicago":"Stockinger, Petra, Carl-Philipp J Heisenberg, and Jean-Léon Maître. “Defective Neuroepithelial Cell Cohesion Affects Tangential Branchiomotor Neuron Migration in the Zebrafish Neural Tube.” <i>Development</i>. Company of Biologists, 2011. <a href=\"https://doi.org/10.1242/dev.071233\">https://doi.org/10.1242/dev.071233</a>.","mla":"Stockinger, Petra, et al. “Defective Neuroepithelial Cell Cohesion Affects Tangential Branchiomotor Neuron Migration in the Zebrafish Neural Tube.” <i>Development</i>, vol. 138, no. 21, Company of Biologists, 2011, pp. 4673–83, doi:<a href=\"https://doi.org/10.1242/dev.071233\">10.1242/dev.071233</a>.","ieee":"P. Stockinger, C.-P. J. Heisenberg, and J.-L. Maître, “Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube,” <i>Development</i>, vol. 138, no. 21. Company of Biologists, pp. 4673–4683, 2011."},"article_processing_charge":"No","volume":138,"acknowledgement":"We thank C. Moens and J. Geiger for critical reading of earlier versions of this manuscript and members of the Heisenberg laboratory for discussions. We are grateful to the microscopy facility of the MPI-CBG and IST Austria for continuous support; I. Nüsslein, J. Compagnon and Alex Eichner for help with cell sorting; and the fish facility of the MPI-CBG and IST Austria for excellent fish care.","_id":"3396","publication":"Development","year":"2011","publisher":"Company of Biologists","month":"11","keyword":["Epithelial cohesion","Hindbrain","Neuronal migration","Zebrafish"],"issue":"21","status":"public","publication_status":"published","date_updated":"2026-07-28T08:23:30Z","publist_id":"3210"},{"article_processing_charge":"No","citation":{"short":"R. Row, J.-L. Maître, B. Martin, P. Stockinger, C.-P.J. Heisenberg, D. Kimelman, Developmental Biology 354 (2011) 102–110.","apa":"Row, R., Maître, J.-L., Martin, B., Stockinger, P., Heisenberg, C.-P. J., &#38; Kimelman, D. (2011). Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail. <i>Developmental Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ydbio.2011.03.025\">https://doi.org/10.1016/j.ydbio.2011.03.025</a>","ista":"Row R, Maître J-L, Martin B, Stockinger P, Heisenberg C-PJ, Kimelman D. 2011. Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail. Developmental Biology. 354(1), 102–110.","ama":"Row R, Maître J-L, Martin B, Stockinger P, Heisenberg C-PJ, Kimelman D. Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail. <i>Developmental Biology</i>. 2011;354(1):102-110. doi:<a href=\"https://doi.org/10.1016/j.ydbio.2011.03.025\">10.1016/j.ydbio.2011.03.025</a>","chicago":"Row, Richard, Jean-Léon Maître, Benjamin Martin, Petra Stockinger, Carl-Philipp J Heisenberg, and David Kimelman. “Completion of the Epithelial to Mesenchymal Transition in Zebrafish Mesoderm Requires Spadetail.” <i>Developmental Biology</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.ydbio.2011.03.025\">https://doi.org/10.1016/j.ydbio.2011.03.025</a>.","mla":"Row, Richard, et al. “Completion of the Epithelial to Mesenchymal Transition in Zebrafish Mesoderm Requires Spadetail.” <i>Developmental Biology</i>, vol. 354, no. 1, Elsevier, 2011, pp. 102–10, doi:<a href=\"https://doi.org/10.1016/j.ydbio.2011.03.025\">10.1016/j.ydbio.2011.03.025</a>.","ieee":"R. Row, J.-L. Maître, B. Martin, P. Stockinger, C.-P. J. Heisenberg, and D. Kimelman, “Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail,” <i>Developmental Biology</i>, vol. 354, no. 1. Elsevier, pp. 102–110, 2011."},"volume":354,"acknowledgement":"We thank David Grunwald for providing the spadetail-myc fusion construct. This work was supported by an NIH grant (GM079203) to D.K. and grants from the Austrian Academy of Sciences to P.S., and from the DFG, MPG and IST Austria to C.-P.H. R.R. was supported by a Developmental Biology Predoctoral Training Grant, T32HD007183, from the National Institute of Child Health and Human Development. B.L.M. was supported by an American Cancer Society fellowship (PF-07-048-01-DDC).","external_id":{"pmid":["21463614"],"isi":["000290550500010"]},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1016/j.ydbio.2011.03.025","language":[{"iso":"eng"}],"scopus_import":"1","date_published":"2011-06-01T00:00:00Z","publisher":"Elsevier","month":"06","year":"2011","publication":"Developmental Biology","_id":"3379","publication_status":"published","status":"public","issue":"1","publist_id":"3228","pmid":1,"date_updated":"2026-07-28T08:31:27Z","isi":1,"date_created":"2018-12-11T12:03:00Z","OA_place":"repository","author":[{"first_name":"Richard","full_name":"Row, Richard","last_name":"Row"},{"orcid":"0000-0002-3688-1474","last_name":"Maître","first_name":"Jean-Léon","id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87","full_name":"Maître, Jean-Léon"},{"last_name":"Martin","full_name":"Martin, Benjamin","first_name":"Benjamin"},{"id":"261CB030-E90D-11E9-B182-F697D44B663C","full_name":"Stockinger, Petra","first_name":"Petra","last_name":"Stockinger"},{"first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","last_name":"Heisenberg"},{"last_name":"Kimelman","first_name":"David","full_name":"Kimelman, David"}],"intvolume":"       354","type":"journal_article","page":"102 - 110","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3090540/","open_access":"1"}],"day":"01","abstract":[{"text":"The process of gastrulation is highly conserved across vertebrates on both the genetic and morphological levels, despite great variety in embryonic shape and speed of development. This mechanism spatially separates the germ layers and establishes the organizational foundation for future development. Mesodermal identity is specified in a superficial layer of cells, the epiblast, where cells maintain an epithelioid morphology. These cells involute to join the deeper hypoblast layer where they adopt a migratory, mesenchymal morphology. Expression of a cascade of related transcription factors orchestrates the parallel genetic transition from primitive to mature mesoderm. Although the early and late stages of this process are increasingly well understood, the transition between them has remained largely mysterious. We present here the first high resolution in vivo observations of the blebby transitional morphology of involuting mesodermal cells in a vertebrate embryo. We further demonstrate that the zebrafish spadetail mutation creates a reversible block in the maturation program, stalling cells in the transition state. This mutation creates an ideal system for dissecting the specific properties of cells undergoing the morphological transition of maturing mesoderm, as we demonstrate with a direct measurement of cell–cell adhesion.","lang":"eng"}],"department":[{"_id":"CaHe"}],"title":"Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail","das_tickbox":"1","quality_controlled":"1","OA_type":"green","article_type":"original","doi":"10.1016/j.ydbio.2011.03.025","oa_version":"Submitted Version"},{"date_created":"2018-12-11T12:05:08Z","intvolume":"        77","type":"journal_article","author":[{"full_name":"Fasy, Brittany Terese","id":"F65D502E-E68D-11E9-9252-C644099818F6","first_name":"Brittany Terese","last_name":"Fasy"}],"page":"359 - 367","day":"01","corr_author":"1","das_tickbox":"1","title":"The difference in length of curves in R^n","department":[{"_id":"HeEd"}],"abstract":[{"text":"We bound the difference in length of two curves in terms of their total curvatures and the Fréchet distance. The bound is independent of the dimension of the ambient Euclidean space, it improves upon a bound by Cohen-Steiner and Edelsbrunner, and it generalizes a result by Fáry and Chakerian.","lang":"eng"}],"OA_type":"closed access","quality_controlled":"1","doi":"10.1007/BF03651375","article_type":"original","oa_version":"None","acknowledgement":"Funded by Graduate Aid in Areas of National Need (GAANN) Fellowship. The author would like to thank Herbert Edelsbrunner for his discussions and guidance.","article_processing_charge":"No","volume":77,"citation":{"ieee":"B. T. Fasy, “The difference in length of curves in R^n,” <i>Acta Scientiarum Mathematicarum</i>, vol. 77, no. 1–2. Springer Nature, pp. 359–367, 2011.","mla":"Fasy, Brittany Terese. “The Difference in Length of Curves in R^n.” <i>Acta Scientiarum Mathematicarum</i>, vol. 77, no. 1–2, Springer Nature, 2011, pp. 359–67, doi:<a href=\"https://doi.org/10.1007/BF03651375\">10.1007/BF03651375</a>.","chicago":"Fasy, Brittany Terese. “The Difference in Length of Curves in R^n.” <i>Acta Scientiarum Mathematicarum</i>. Springer Nature, 2011. <a href=\"https://doi.org/10.1007/BF03651375\">https://doi.org/10.1007/BF03651375</a>.","ama":"Fasy BT. The difference in length of curves in R^n. <i>Acta Scientiarum Mathematicarum</i>. 2011;77(1-2):359-367. doi:<a href=\"https://doi.org/10.1007/BF03651375\">10.1007/BF03651375</a>","ista":"Fasy BT. 2011. The difference in length of curves in R^n. Acta Scientiarum Mathematicarum. 77(1–2), 359–367.","apa":"Fasy, B. T. (2011). The difference in length of curves in R^n. <i>Acta Scientiarum Mathematicarum</i>. Springer Nature. <a href=\"https://doi.org/10.1007/BF03651375\">https://doi.org/10.1007/BF03651375</a>","short":"B.T. Fasy, Acta Scientiarum Mathematicarum 77 (2011) 359–367."},"fulldoi":"https://doi.org/10.1007/BF03651375","language":[{"iso":"eng"}],"date_published":"2011-06-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2011","month":"06","publisher":"Springer Nature","_id":"3781","publication":"Acta Scientiarum Mathematicarum","status":"public","publication_status":"published","issue":"1-2","publication_identifier":{"eissn":["2064-8316"],"issn":["0001-6969"]},"publist_id":"2446","date_updated":"2026-07-28T08:11:07Z"},{"type":"conference_abstract","intvolume":"       278","author":[{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","last_name":"Heisenberg"}],"OA_place":"publisher","date_created":"2018-12-11T12:03:01Z","day":"01","corr_author":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1111/j.1742-4658.2011.08136.x"}],"page":"24 - 24","quality_controlled":"1","OA_type":"free access","department":[{"_id":"CaHe"}],"title":"Invited Lectures ‐ Symposia Area","oa_version":"Published Version","doi":"10.1111/j.1742-4658.2011.08136.x","fulldoi":"https://doi.org/10.1111/j.1742-4658.2011.08136.x","language":[{"iso":"eng"}],"date_published":"2011-07-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Torino, Italy","end_date":"2011-06-30","name":"FEBS Congress on Biochemistry for Tomorrow's Medicine","start_date":"2011-06-25"},"oa":1,"citation":{"short":"C.-P.J. Heisenberg, in:, The FEBS Journal, Wiley, 2011, pp. 24–24.","apa":"Heisenberg, C.-P. J. (2011). Invited Lectures ‐ Symposia Area. In <i>The FEBS Journal</i> (Vol. 278, pp. 24–24). Torino, Italy: Wiley. <a href=\"https://doi.org/10.1111/j.1742-4658.2011.08136.x\">https://doi.org/10.1111/j.1742-4658.2011.08136.x</a>","ista":"Heisenberg C-PJ. 2011. Invited Lectures ‐ Symposia Area. The FEBS Journal. FEBS Congress on Biochemistry for Tomorrow’s Medicine vol. 278, 24–24.","ama":"Heisenberg C-PJ. Invited Lectures ‐ Symposia Area. In: <i>The FEBS Journal</i>. Vol 278. Wiley; 2011:24-24. doi:<a href=\"https://doi.org/10.1111/j.1742-4658.2011.08136.x\">10.1111/j.1742-4658.2011.08136.x</a>","chicago":"Heisenberg, Carl-Philipp J. “Invited Lectures ‐ Symposia Area.” In <i>The FEBS Journal</i>, 278:24–24. Wiley, 2011. <a href=\"https://doi.org/10.1111/j.1742-4658.2011.08136.x\">https://doi.org/10.1111/j.1742-4658.2011.08136.x</a>.","mla":"Heisenberg, Carl-Philipp J. “Invited Lectures ‐ Symposia Area.” <i>The FEBS Journal</i>, vol. 278, no. S1, Wiley, 2011, pp. 24–24, doi:<a href=\"https://doi.org/10.1111/j.1742-4658.2011.08136.x\">10.1111/j.1742-4658.2011.08136.x</a>.","ieee":"C.-P. J. Heisenberg, “Invited Lectures ‐ Symposia Area,” in <i>The FEBS Journal</i>, Torino, Italy, 2011, vol. 278, no. S1, pp. 24–24."},"article_processing_charge":"No","volume":278,"_id":"3383","publication":"The FEBS Journal","year":"2011","publisher":"Wiley","month":"07","issue":"S1","status":"public","publication_status":"published","date_updated":"2026-07-28T08:27:55Z","publist_id":"3224"},{"status":"public","publication_status":"published","issue":"3","publist_id":"3244","pmid":1,"date_updated":"2026-07-28T09:03:18Z","external_id":{"pmid":["21212360"],"isi":["000286310300003"]},"oa":1,"article_processing_charge":"No","volume":108,"citation":{"mla":"Krens, Gabriel, et al. “Enveloping Cell Layer Differentiation at the Surface of Zebrafish Germ Layer Tissue Explants.” <i>PNAS</i>, vol. 108, no. 3, National Academy of Sciences, 2011, pp. E9–10, doi:<a href=\"https://doi.org/10.1073/pnas.1010767108\">10.1073/pnas.1010767108</a>.","chicago":"Krens, Gabriel, Stephanie Möllmert, and Carl-Philipp J Heisenberg. “Enveloping Cell Layer Differentiation at the Surface of Zebrafish Germ Layer Tissue Explants.” <i>PNAS</i>. National Academy of Sciences, 2011. <a href=\"https://doi.org/10.1073/pnas.1010767108\">https://doi.org/10.1073/pnas.1010767108</a>.","ieee":"G. Krens, S. Möllmert, and C.-P. J. Heisenberg, “Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants,” <i>PNAS</i>, vol. 108, no. 3. National Academy of Sciences, pp. E9–E10, 2011.","apa":"Krens, G., Möllmert, S., &#38; Heisenberg, C.-P. J. (2011). Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1010767108\">https://doi.org/10.1073/pnas.1010767108</a>","short":"G. Krens, S. Möllmert, C.-P.J. Heisenberg, PNAS 108 (2011) E9–E10.","ama":"Krens G, Möllmert S, Heisenberg C-PJ. Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants. <i>PNAS</i>. 2011;108(3):E9-E10. doi:<a href=\"https://doi.org/10.1073/pnas.1010767108\">10.1073/pnas.1010767108</a>","ista":"Krens G, Möllmert S, Heisenberg C-PJ. 2011. Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants. PNAS. 108(3), E9–E10."},"fulldoi":"https://doi.org/10.1073/pnas.1010767108","date_published":"2011-01-18T00:00:00Z","scopus_import":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2011","publisher":"National Academy of Sciences","month":"01","_id":"3368","publication":"PNAS","department":[{"_id":"CaHe"}],"das_tickbox":"1","title":"Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants","abstract":[{"text":"Tissue surface tension (TST) is an important mechanical property influencing cell sorting and tissue envelopment. The study by Manning et al. (1) reported on a mathematical model describing TST on the basis of the balance between adhesive and tensile properties of the constituent cells. The model predicts that, in high-adhesion cell aggregates, surface cells will be stretched to maintain the same area of cell–cell contact as interior bulk cells, resulting in an elongated and flattened cell shape. The authors (1) observed flat and elongated cells at the surface of high-adhesion zebrafish germ-layer explants, which they argue are undifferentiated stretched germ-layer progenitor cells, and they use this observation as a validation of their model.","lang":"eng"}],"quality_controlled":"1","doi":"10.1073/pnas.1010767108","article_type":"letter_note","oa_version":"Submitted Version","isi":1,"date_created":"2018-12-11T12:02:56Z","intvolume":"       108","type":"journal_article","author":[{"orcid":"0000-0003-4761-5996","last_name":"Krens","id":"2B819732-F248-11E8-B48F-1D18A9856A87","full_name":"Krens, Gabriel","first_name":"Gabriel"},{"last_name":"Möllmert","first_name":"Stephanie","full_name":"Möllmert, Stephanie","id":"260FD49C-E911-11E9-B5EA-D9538404589B"},{"orcid":"0000-0002-0912-4566","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J"}],"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3024655","open_access":"1"}],"page":"E9 - E10","day":"18","corr_author":"1"},{"publication":"Optics Letters","_id":"3373","publisher":"Optica Publishing Group","month":"03","year":"2011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1364/OL.36.001260","scopus_import":"1","date_published":"2011-03-30T00:00:00Z","article_processing_charge":"No","volume":36,"citation":{"ama":"Jahnel M, Behrndt M, Jannasch A, Schaeffer E, Grill S. Measuring the complete force field of an optical trap. <i>Optics Letters</i>. 2011;36(7):1260-1262. doi:<a href=\"https://doi.org/10.1364/OL.36.001260\">10.1364/OL.36.001260</a>","ista":"Jahnel M, Behrndt M, Jannasch A, Schaeffer E, Grill S. 2011. Measuring the complete force field of an optical trap. Optics Letters. 36(7), 1260–1262.","apa":"Jahnel, M., Behrndt, M., Jannasch, A., Schaeffer, E., &#38; Grill, S. (2011). Measuring the complete force field of an optical trap. <i>Optics Letters</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/OL.36.001260\">https://doi.org/10.1364/OL.36.001260</a>","short":"M. Jahnel, M. Behrndt, A. Jannasch, E. Schaeffer, S. Grill, Optics Letters 36 (2011) 1260–1262.","ieee":"M. Jahnel, M. Behrndt, A. Jannasch, E. Schaeffer, and S. Grill, “Measuring the complete force field of an optical trap,” <i>Optics Letters</i>, vol. 36, no. 7. Optica Publishing Group, pp. 1260–1262, 2011.","mla":"Jahnel, Marcus, et al. “Measuring the Complete Force Field of an Optical Trap.” <i>Optics Letters</i>, vol. 36, no. 7, Optica Publishing Group, 2011, pp. 1260–62, doi:<a href=\"https://doi.org/10.1364/OL.36.001260\">10.1364/OL.36.001260</a>.","chicago":"Jahnel, Marcus, Martin Behrndt, Anita Jannasch, Erik Schaeffer, and Stephan Grill. “Measuring the Complete Force Field of an Optical Trap.” <i>Optics Letters</i>. Optica Publishing Group, 2011. <a href=\"https://doi.org/10.1364/OL.36.001260\">https://doi.org/10.1364/OL.36.001260</a>."},"external_id":{"isi":["000289251000080"]},"oa":1,"date_updated":"2026-07-29T10:07:18Z","publist_id":"3234","issue":"7","publication_status":"published","status":"public","related_material":{"record":[{"id":"1403","status":"public","relation":"dissertation_contains"}]},"day":"30","page":"1260 - 1262","main_file_link":[{"open_access":"1","url":"https://www.osapublishing.org/ol/abstract.cfm?uri=ol-36-7-1260"}],"author":[{"last_name":"Jahnel","full_name":"Jahnel, Marcus","first_name":"Marcus"},{"last_name":"Behrndt","first_name":"Martin","full_name":"Behrndt, Martin","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jannasch","full_name":"Jannasch, Anita","first_name":"Anita"},{"first_name":"Erik","full_name":"Schaeffer, Erik","last_name":"Schaeffer"},{"full_name":"Grill, Stephan","first_name":"Stephan","last_name":"Grill"}],"type":"journal_article","intvolume":"        36","isi":1,"date_created":"2018-12-11T12:02:58Z","ddc":["570"],"oa_version":"Published Version","doi":"10.1364/OL.36.001260","quality_controlled":"1","abstract":[{"lang":"eng","text":"The use of optical traps to measure or apply forces on the molecular level requires a precise knowledge of the trapping force field. Close to the trap center, this field is typically approximated as linear in the displacement of the trapped microsphere. However, applications demanding high forces at low laser intensities can probe the light-microsphere interaction beyond the linear regime. Here, we measured the full nonlinear force and displacement response of an optical trap in two dimensions using a dual-beam optical trap setup with back-focal-plane photodetection. We observed a substantial stiffening of the trap beyond the linear regime that depends on microsphere size, in agreement with Mie theory calculations. Surprisingly, we found that the linear detection range for forces exceeds the one for displacement by far. Our approach allows for a complete calibration of an optical trap."}],"department":[{"_id":"CaHe"}],"title":"Measuring the complete force field of an optical trap"},{"publication":"American Naturalist","_id":"3393","month":"09","publisher":"University of Chicago Press","year":"2011","file":[{"file_id":"4692","date_updated":"2020-07-14T12:46:11Z","file_name":"IST-2016-554-v1+1_BartonTurelli2011_copy.pdf","file_size":629130,"creator":"system","access_level":"open_access","content_type":"application/pdf","checksum":"7fd22a2ef3321a6fca6a439b3be5d8f4","relation":"main_file","date_created":"2018-12-12T10:08:31Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1086/661246","date_published":"2011-09-01T00:00:00Z","scopus_import":"1","language":[{"iso":"eng"}],"article_processing_charge":"No","citation":{"ieee":"N. H. Barton and M. Turelli, “Spatial waves of advance with bistable dynamics: Cytoplasmic and genetic analogues of Allee effects,” <i>American Naturalist</i>, vol. 178, no. 3. University of Chicago Press, pp. E48–E75, 2011.","chicago":"Barton, Nicholas H, and Michael Turelli. “Spatial Waves of Advance with Bistable Dynamics: Cytoplasmic and Genetic Analogues of Allee Effects.” <i>American Naturalist</i>. University of Chicago Press, 2011. <a href=\"https://doi.org/10.1086/661246\">https://doi.org/10.1086/661246</a>.","mla":"Barton, Nicholas H., and Michael Turelli. “Spatial Waves of Advance with Bistable Dynamics: Cytoplasmic and Genetic Analogues of Allee Effects.” <i>American Naturalist</i>, vol. 178, no. 3, University of Chicago Press, 2011, pp. E48–75, doi:<a href=\"https://doi.org/10.1086/661246\">10.1086/661246</a>.","ama":"Barton NH, Turelli M. Spatial waves of advance with bistable dynamics: Cytoplasmic and genetic analogues of Allee effects. <i>American Naturalist</i>. 2011;178(3):E48-E75. doi:<a href=\"https://doi.org/10.1086/661246\">10.1086/661246</a>","ista":"Barton NH, Turelli M. 2011. Spatial waves of advance with bistable dynamics: Cytoplasmic and genetic analogues of Allee effects. American Naturalist. 178(3), E48–E75.","short":"N.H. Barton, M. Turelli, American Naturalist 178 (2011) E48–E75.","apa":"Barton, N. H., &#38; Turelli, M. (2011). Spatial waves of advance with bistable dynamics: Cytoplasmic and genetic analogues of Allee effects. <i>American Naturalist</i>. University of Chicago Press. <a href=\"https://doi.org/10.1086/661246\">https://doi.org/10.1086/661246</a>"},"volume":178,"oa":1,"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:11Z","external_id":{"isi":["000294256800001"]},"date_updated":"2026-08-04T09:17:38Z","publist_id":"3214","publication_identifier":{"eissn":["1537-5323"],"issn":["0003-0147"]},"issue":"3","publication_status":"published","pubrep_id":"554","status":"public","day":"01","page":"E48 - E75","author":[{"first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240"},{"last_name":"Turelli","full_name":"Turelli, Michael","first_name":"Michael"}],"type":"journal_article","intvolume":"       178","date_created":"2018-12-11T12:03:05Z","isi":1,"oa_version":"Submitted Version","ddc":["570"],"doi":"10.1086/661246","article_type":"original","quality_controlled":"1","abstract":[{"text":"Unlike unconditionally advantageous “Fisherian” variants that tend to spread throughout a species range once introduced anywhere, “bistable” variants, such as chromosome translocations, have two alternative stable frequencies, absence and (near) fixation. Analogous to populations with Allee effects, bistable variants tend to increase locally only once they become sufficiently common, and their spread depends on their rate of increase averaged over all frequencies. Several proposed manipulations of insect populations, such as using Wolbachia or “engineered underdominance” to suppress vector-borne diseases, produce bistable rather than Fisherian dynamics. We synthesize and extend theoretical analyses concerning three features of their spatial behavior: rate of spread, conditions to initiate spread from a localized introduction, and wave stopping caused by variation in population densities or dispersal rates. Unlike Fisherian variants, bistable variants tend to spread spatially only for particular parameter combinations and initial conditions. Wave initiation requires introduction over an extended region, while subsequent spatial spread is slower than for Fisherian waves and can easily be halted by local spatial inhomogeneities. We present several new results, including robust sufficient conditions to initiate (and stop) spread, using a one-parameter cubic approximation applicable to several models. The results have both basic and applied implications.","lang":"eng"}],"department":[{"_id":"NiBa"}],"title":"Spatial waves of advance with bistable dynamics: Cytoplasmic and genetic analogues of Allee effects"},{"publication_status":"published","status":"public","publication_identifier":{"issn":["0309-1708"]},"issue":"4","keyword":["Weather generator","Stochastic downscaling","Climate change","Hydro-meteorology","Rainfall model"],"date_updated":"2026-08-06T10:13:12Z","article_processing_charge":"No","volume":34,"citation":{"mla":"Fatichi, Simone, et al. “Simulation of Future Climate Scenarios with a Weather Generator.” <i>Advances in Water Resources</i>, vol. 34, no. 4, Elsevier, 2011, pp. 448–67, doi:<a href=\"https://doi.org/10.1016/j.advwatres.2010.12.013\">10.1016/j.advwatres.2010.12.013</a>.","chicago":"Fatichi, Simone, Valeriy Y. Ivanov, and Enrica Caporali. “Simulation of Future Climate Scenarios with a Weather Generator.” <i>Advances in Water Resources</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.advwatres.2010.12.013\">https://doi.org/10.1016/j.advwatres.2010.12.013</a>.","ieee":"S. Fatichi, V. Y. Ivanov, and E. Caporali, “Simulation of future climate scenarios with a weather generator,” <i>Advances in Water Resources</i>, vol. 34, no. 4. Elsevier, pp. 448–467, 2011.","apa":"Fatichi, S., Ivanov, V. Y., &#38; Caporali, E. (2011). Simulation of future climate scenarios with a weather generator. <i>Advances in Water Resources</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.advwatres.2010.12.013\">https://doi.org/10.1016/j.advwatres.2010.12.013</a>","short":"S. Fatichi, V.Y. Ivanov, E. Caporali, Advances in Water Resources 34 (2011) 448–467.","ista":"Fatichi S, Ivanov VY, Caporali E. 2011. Simulation of future climate scenarios with a weather generator. Advances in Water Resources. 34(4), 448–467.","ama":"Fatichi S, Ivanov VY, Caporali E. Simulation of future climate scenarios with a weather generator. <i>Advances in Water Resources</i>. 2011;34(4):448-467. doi:<a href=\"https://doi.org/10.1016/j.advwatres.2010.12.013\">10.1016/j.advwatres.2010.12.013</a>"},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","fulldoi":"https://doi.org/10.1016/j.advwatres.2010.12.013","date_published":"2011-04-01T00:00:00Z","scopus_import":"1","language":[{"iso":"eng"}],"month":"04","publisher":"Elsevier","extern":"1","year":"2011","publication":"Advances in Water Resources","_id":"22556","abstract":[{"lang":"eng","text":"Numerous studies across multiple disciplines search for insights on the effects of climate change at local spatial scales and at fine time resolutions. This study presents an overall methodology of using a weather generator for downscaling an ensemble of climate model outputs. The downscaled predictions can explicitly include climate model uncertainty, which offers valuable information for making probabilistic inferences about climate impacts. The hourly weather generator that serves as the downscaling tool is briefly presented. The generator is designed to reproduce a set of meteorological variables that can serve as input to hydrological, ecological, geomorphological, and agricultural models. The generator is capable of reproducing a wide set of climate statistics over a range of temporal scales, from extremes, to low-frequency interannual variability; its performance for many climate variables and their statistics over different aggregation periods is highly satisfactory. The use of the weather generator in simulations of future climate scenarios, as inferred from climate models, is described in detail. Using a previously developed methodology based on a Bayesian approach, the stochastic downscaling procedure derives the frequency distribution functions of factors of change for several climate statistics from a multi-model ensemble of outputs of General Circulation Models. The factors of change are subsequently applied to the statistics derived from observations to re-evaluate the parameters of the weather generator. Using embedded causal and statistical relationships, the generator simulates future realizations of climate for a specific point location at the hourly scale. Uncertainties present in the climate model realizations and the multi-model ensemble predictions are discussed. An application of the weather generator in reproducing present (1961–2000) and forecasting future (2081–2100) climate conditions is illustrated for the location of Tucson (AZ). The stochastic downscaling is carried out using simulations of eight General Circulation Models adopted in the IPCC 4AR, A1B emission scenario."}],"title":"Simulation of future climate scenarios with a weather generator","das_tickbox":"1","OA_type":"closed access","quality_controlled":"1","doi":"10.1016/j.advwatres.2010.12.013","article_type":"original","oa_version":"None","date_created":"2026-07-27T12:30:24Z","author":[{"id":"cf8e546b-a9b0-11f0-a43b-aa89ed1b56d6","full_name":"Fatichi, Simone","first_name":"Simone","last_name":"Fatichi"},{"last_name":"Ivanov","first_name":"Valeriy Y.","full_name":"Ivanov, Valeriy Y."},{"last_name":"Caporali","first_name":"Enrica","full_name":"Caporali, Enrica"}],"intvolume":"        34","type":"journal_article","page":"448-467","day":"01"},{"publication_status":"published","status":"public","issue":"58","ec_funded":1,"publist_id":"3232","pmid":1,"date_updated":"2026-08-12T14:07:44Z","article_processing_charge":"No","volume":8,"citation":{"ieee":"H. de Vladar and N. H. Barton, “The statistical mechanics of a polygenic character under stabilizing selection mutation and drift,” <i>Journal of the Royal Society Interface</i>, vol. 8, no. 58. Royal Society, pp. 720–739, 2011.","chicago":"Vladar, Harold de, and Nicholas H Barton. “The Statistical Mechanics of a Polygenic Character under Stabilizing Selection Mutation and Drift.” <i>Journal of the Royal Society Interface</i>. Royal Society, 2011. <a href=\"https://doi.org/10.1098/rsif.2010.0438\">https://doi.org/10.1098/rsif.2010.0438</a>.","mla":"de Vladar, Harold, and Nicholas H. Barton. “The Statistical Mechanics of a Polygenic Character under Stabilizing Selection Mutation and Drift.” <i>Journal of the Royal Society Interface</i>, vol. 8, no. 58, Royal Society, 2011, pp. 720–39, doi:<a href=\"https://doi.org/10.1098/rsif.2010.0438\">10.1098/rsif.2010.0438</a>.","ama":"de Vladar H, Barton NH. The statistical mechanics of a polygenic character under stabilizing selection mutation and drift. <i>Journal of the Royal Society Interface</i>. 2011;8(58):720-739. doi:<a href=\"https://doi.org/10.1098/rsif.2010.0438\">10.1098/rsif.2010.0438</a>","ista":"de Vladar H, Barton NH. 2011. The statistical mechanics of a polygenic character under stabilizing selection mutation and drift. Journal of the Royal Society Interface. 8(58), 720–739.","short":"H. de Vladar, N.H. Barton, Journal of the Royal Society Interface 8 (2011) 720–739.","apa":"de Vladar, H., &#38; Barton, N. H. (2011). The statistical mechanics of a polygenic character under stabilizing selection mutation and drift. <i>Journal of the Royal Society Interface</i>. Royal Society. <a href=\"https://doi.org/10.1098/rsif.2010.0438\">https://doi.org/10.1098/rsif.2010.0438</a>"},"external_id":{"pmid":["21084341"],"isi":["000289671700011"]},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1098/rsif.2010.0438","date_published":"2011-05-01T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Royal Society","month":"05","year":"2011","publication":"Journal of the Royal Society Interface","_id":"3375","abstract":[{"text":"By exploiting an analogy between population genetics and statistical mechanics, we study the evolution of a polygenic trait under stabilizing selection, mutation and genetic drift. This requires us to track only four macroscopic variables, instead of the distribution of all the allele frequencies that influence the trait. These macroscopic variables are the expectations of: the trait mean and its square, the genetic variance, and of a measure of heterozygosity, and are derived from a generating function that is in turn derived by maximizing an entropy measure. These four macroscopics are enough to accurately describe the dynamics of the trait mean and of its genetic variance (and in principle of any other quantity). Unlike previous approaches that were based on an infinite series of moments or cumulants, which had to be truncated arbitrarily, our calculations provide a well-defined approximation procedure. We apply the framework to abrupt and gradual changes in the optimum, as well as to changes in the strength of stabilizing selection. Our approximations are surprisingly accurate, even for systems with as few as five loci. We find that when the effects of drift are included, the expected genetic variance is hardly altered by directional selection, even though it fluctuates in any particular instance. We also find hysteresis, showing that even after averaging over the microscopic variables, the macroscopic trajectories retain a memory of the underlying genetic states.","lang":"eng"}],"title":"The statistical mechanics of a polygenic character under stabilizing selection mutation and drift","department":[{"_id":"NiBa"}],"quality_controlled":"1","article_type":"original","doi":"10.1098/rsif.2010.0438","oa_version":"Submitted Version","isi":1,"date_created":"2018-12-11T12:02:58Z","author":[{"first_name":"Harold","id":"2A181218-F248-11E8-B48F-1D18A9856A87","full_name":"de Vladar, Harold","orcid":"0000-0002-5985-7653","last_name":"de Vladar"},{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton"}],"project":[{"call_identifier":"FP7","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation"}],"intvolume":"         8","type":"journal_article","page":"720 - 739","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3061091/"}],"corr_author":"1","day":"01"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-642-17511-4_7","date_published":"2010-05-01T00:00:00Z","scopus_import":"1","acknowledgement":"This work was supported in part by the Swiss NSF. The fourth author is supported by an FWF Hertha Firnberg Research grant (T425-N23).","article_processing_charge":"No","volume":6355,"citation":{"chicago":"Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.” In <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">https://doi.org/10.1007/978-3-642-17511-4_7</a>.","mla":"Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">10.1007/978-3-642-17511-4_7</a>.","ieee":"R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound Computation for loops,” in <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.","short":"R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.","apa":"Blanc, R., Henzinger, T. A., Hottelier, T., &#38; Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke &#38; A. Voronkov (Eds.), <i>Logic for Programming, Artificial Intelligence, and Reasoning</i> (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">https://doi.org/10.1007/978-3-642-17511-4_7</a>","ista":"Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning. LPAR: Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355, 103–118.","ama":"Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation for loops. In: Clarke EM, Voronkov A, eds. <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>. Vol 6355. LNCS. Berlin, Heidelberg: Springer Nature; 2010:103-118. doi:<a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">10.1007/978-3-642-17511-4_7</a>"},"oa":1,"conference":{"location":"Dakar, Senegal","end_date":"2010-05-01","name":"LPAR: Logic for Programming, Artificial Intelligence and Reasoning","start_date":"2010-04-25"},"external_id":{"isi":["000309668000007"]},"editor":[{"last_name":"Clarke","first_name":"Edmund M","full_name":"Clarke, Edmund M"},{"last_name":"Voronkov","full_name":"Voronkov, Andrei","first_name":"Andrei"}],"publication":"Logic for Programming, Artificial Intelligence, and Reasoning","_id":"10908","month":"05","publisher":"Springer Nature","year":"2010","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642175114"],"isbn":["9783642175107"],"issn":["0302-9743"]},"publication_status":"published","status":"public","date_updated":"2025-09-30T09:51:13Z","series_title":"LNCS","author":[{"full_name":"Blanc, Régis","first_name":"Régis","last_name":"Blanc"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724"},{"last_name":"Hottelier","full_name":"Hottelier, Thibaud","first_name":"Thibaud"},{"last_name":"Kovács","first_name":"Laura","full_name":"Kovács, Laura"}],"type":"conference","intvolume":"      6355","date_created":"2022-03-21T08:14:35Z","isi":1,"place":"Berlin, Heidelberg","corr_author":"1","day":"01","page":"103-118","main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/186096"}],"quality_controlled":"1","abstract":[{"text":"We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations between program variables. Iteration bounds are obtained from the inferred invariants, by replacing variables with bounds on their greatest values. We have successfully applied ABC to a large number of examples. The derived symbolic bounds express non-trivial polynomial relations over loop variables. We also report on results to automatically infer symbolic expressions over harmonic numbers as upper bounds on loop iteration counts.","lang":"eng"}],"department":[{"_id":"ToHe"}],"title":"ABC: Algebraic Bound Computation for loops","oa_version":"Submitted Version","doi":"10.1007/978-3-642-17511-4_7"}]