[{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"full_name":"Trinh, Minh","last_name":"Trinh","first_name":"Minh"},{"full_name":"Chu, Duc Hiep","id":"3598E630-F248-11E8-B48F-1D18A9856A87","first_name":"Duc Hiep","last_name":"Chu"},{"first_name":"Joxan","last_name":"Jaffar","full_name":"Jaffar, Joxan"}],"editor":[{"last_name":"Majumdar","first_name":"Rupak","full_name":"Majumdar, Rupak"},{"last_name":"Kunčak","first_name":"Viktor","full_name":"Kunčak, Viktor"}],"volume":10427,"page":"399 - 418","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We present a new algorithm for model counting of a class of string constraints. In addition to the classic operation of concatenation, our class includes some recursively defined operations such as Kleene closure, and replacement of substrings. Additionally, our class also includes length constraints on the string expressions, which means, by requiring reasoning about numbers, that we face a multi-sorted logic. In the end, our string constraints are motivated by their use in programming for web applications. Our algorithm comprises two novel features: the ability to use a technique of (1) partial derivatives for constraints that are already in a solved form, i.e. a form where its (string) satisfiability is clearly displayed, and (2) non-progression, where cyclic reasoning in the reduction process may be terminated (thus allowing for the algorithm to look elsewhere). Finally, we experimentally compare our model counter with two recent works on model counting of similar constraints, SMC [18] and ABC [5], to demonstrate its superior performance."}],"external_id":{"isi":["000431900900021"]},"publication_status":"published","title":"Model counting for recursively-defined strings","year":"2017","date_created":"2018-12-11T11:49:26Z","doi":"10.1007/978-3-319-63390-9_21","publication_identifier":{"issn":["0302-9743"]},"quality_controlled":"1","conference":{"start_date":"2017-07-24","name":"CAV: Computer Aided Verification","location":"Heidelberg, Germany","end_date":"2017-07-28"},"intvolume":" 10427","oa_version":"None","type":"conference","publist_id":"6443","_id":"962","scopus_import":"1","isi":1,"month":"01","language":[{"iso":"eng"}],"date_published":"2017-01-01T00:00:00Z","publisher":"Springer","department":[{"_id":"ToHe"}],"date_updated":"2026-04-16T09:58:05Z","alternative_title":["LNCS"],"status":"public","day":"01","citation":{"chicago":"Trinh, Minh, Duc Hiep Chu, and Joxan Jaffar. “Model Counting for Recursively-Defined Strings.” edited by Rupak Majumdar and Viktor Kunčak, 10427:399–418. Springer, 2017. https://doi.org/10.1007/978-3-319-63390-9_21.","apa":"Trinh, M., Chu, D. H., & Jaffar, J. (2017). Model counting for recursively-defined strings. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10427, pp. 399–418). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63390-9_21","mla":"Trinh, Minh, et al. Model Counting for Recursively-Defined Strings. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10427, Springer, 2017, pp. 399–418, doi:10.1007/978-3-319-63390-9_21.","ieee":"M. Trinh, D. H. Chu, and J. Jaffar, “Model counting for recursively-defined strings,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10427, pp. 399–418.","short":"M. Trinh, D.H. Chu, J. Jaffar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 399–418.","ista":"Trinh M, Chu DH, Jaffar J. 2017. Model counting for recursively-defined strings. CAV: Computer Aided Verification, LNCS, vol. 10427, 399–418.","ama":"Trinh M, Chu DH, Jaffar J. Model counting for recursively-defined strings. In: Majumdar R, Kunčak V, eds. Vol 10427. Springer; 2017:399-418. doi:10.1007/978-3-319-63390-9_21"},"project":[{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}]},{"day":"01","pubrep_id":"829","status":"public","alternative_title":["LIPIcs"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"project":[{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"}],"citation":{"chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with Clocks,” Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.37.","apa":"Avni, G., Guha, S., & Kupferman, O. (2017). Timed network games with clocks (Vol. 83). Presented at the MFCS: Mathematical Foundations of Computer Science, Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.37","mla":"Avni, Guy, et al. Timed Network Games with Clocks. Vol. 83, 37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.37.","short":"G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ieee":"G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science, Aalborg, Denmark, 2017, vol. 83.","ista":"Avni G, Guha S, Kupferman O. 2017. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 83, 37.","ama":"Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.37"},"_id":"963","scopus_import":"1","publist_id":"6438","type":"conference","oa_version":"Published Version","intvolume":" 83","department":[{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2025-07-10T12:01:59Z","month":"06","language":[{"iso":"eng"}],"date_published":"2017-06-01T00:00:00Z","oa":1,"file_date_updated":"2020-07-14T12:48:18Z","doi":"10.4230/LIPIcs.MFCS.2017.37","publication_identifier":{"issn":["1868-8969"]},"article_number":"37","year":"2017","date_created":"2018-12-11T11:49:26Z","conference":{"location":"Aalborg, Denmark","end_date":"2017-08-25","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2017-08-21"},"ddc":["004"],"has_accepted_license":"1","file":[{"creator":"system","date_created":"2018-12-12T10:14:10Z","content_type":"application/pdf","file_name":"IST-2017-829-v1+1_mfcs-cr.pdf","checksum":"f55eaf7f3c36ea07801112acfedd17d5","relation":"main_file","access_level":"open_access","file_size":369730,"date_updated":"2020-07-14T12:48:18Z","file_id":"5059"}],"quality_controlled":"1","related_material":{"record":[{"status":"public","relation":"later_version","id":"6005"}]},"volume":83,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287"},{"last_name":"Guha","first_name":"Shibashis","full_name":"Guha, Shibashis"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"title":"Timed network games with clocks","abstract":[{"lang":"eng","text":"Network games are widely used as a model for selfish resource-allocation problems. In the classical model, each player selects a path connecting her source and target vertex. The cost of traversing an edge depends on the number of players that traverse it. Thus, it abstracts the fact that different users may use a resource at different times and for different durations, which plays an important role in defining the costs of the users in reality. For example, when transmitting packets in a communication network, routing traffic in a road network, or processing a task in a production system, the traversal of the network involves an inherent delay, and so sharing and congestion of resources crucially depends on time. We study timed network games , which add a time component to network games. Each vertex v in the network is associated with a cost function, mapping the load on v to the price that a player pays for staying in v for one time unit with this load. In addition, each edge has a guard, describing time intervals in which the edge can be traversed, forcing the players to spend time on vertices. Unlike earlier work that add a time component to network games, the time in our model is continuous and cannot be discretized. In particular, players have uncountably many strategies, and a game may have uncountably many pure Nash equilibria. We study properties of timed network games with cost-sharing or congestion cost functions: their stability, equilibrium inefficiency, and complexity. In particular, we show that the answer to the question whether we can restrict attention to boundary strategies, namely ones in which edges are traversed only at the boundaries of guards, is mixed. "}],"publication_status":"published","article_processing_charge":"No"},{"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Published Version","author":[{"first_name":"Paul","last_name":"Riccio","full_name":"Riccio, Paul"},{"last_name":"Cebrián","first_name":"Christina","full_name":"Cebrián, Christina"},{"full_name":"Zong, Hui","last_name":"Zong","first_name":"Hui"},{"last_name":"Hippenmeyer","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon"},{"full_name":"Costantini, Frank","first_name":"Frank","last_name":"Costantini"}],"type":"research_data_reference","related_material":{"record":[{"id":"9702","relation":"used_in_publication","status":"deleted"}]},"_id":"9707","article_processing_charge":"No","oa":1,"abstract":[{"lang":"eng","text":"Branching morphogenesis of the epithelial ureteric bud forms the renal collecting duct system and is critical for normal nephron number, while low nephron number is implicated in hypertension and renal disease. Ureteric bud growth and branching requires GDNF signaling from the surrounding mesenchyme to cells at the ureteric bud tips, via the Ret receptor tyrosine kinase and coreceptor Gfrα1; Ret signaling up-regulates transcription factors Etv4 and Etv5, which are also critical for branching. Despite extensive knowledge of the genetic control of these events, it is not understood, at the cellular level, how renal branching morphogenesis is achieved or how Ret signaling influences epithelial cell behaviors to promote this process. Analysis of chimeric embryos previously suggested a role for Ret signaling in promoting cell rearrangements in the nephric duct, but this method was unsuited to study individual cell behaviors during ureteric bud branching. Here, we use Mosaic Analysis with Double Markers (MADM), combined with organ culture and time-lapse imaging, to trace the movements and divisions of individual ureteric bud tip cells. We first examine wild-type clones and then Ret or Etv4 mutant/wild-type clones in which the mutant and wild-type sister cells are differentially and heritably marked by green and red fluorescent proteins. We find that, in normal kidneys, most individual tip cells behave as self-renewing progenitors, some of whose progeny remain at the tips while others populate the growing UB trunks. In Ret or Etv4 MADM clones, the wild-type cells generated at a UB tip are much more likely to remain at, or move to, the new tips during branching and elongation, while their Ret−/− or Etv4−/− sister cells tend to lag behind and contribute only to the trunks. By tracking successive mitoses in a cell lineage, we find that Ret signaling has little effect on proliferation, in contrast to its effects on cell movement. Our results show that Ret/Etv4 signaling promotes directed cell movements in the ureteric bud tips, and suggest a model in which these cell movements mediate branching morphogenesis."}],"date_published":"2017-01-14T00:00:00Z","month":"01","title":"Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis","date_updated":"2022-08-25T13:34:55Z","publisher":"Dryad","department":[{"_id":"SiHi"}],"date_created":"2021-07-23T09:39:34Z","year":"2017","doi":"10.5061/dryad.pk16b","status":"public","day":"14","citation":{"mla":"Riccio, Paul, et al. Data from: Ret and Etv4 Promote Directed Movements of Progenitor Cells during Renal Branching Morphogenesis. Dryad, 2017, doi:10.5061/dryad.pk16b.","chicago":"Riccio, Paul, Christina Cebrián, Hui Zong, Simon Hippenmeyer, and Frank Costantini. “Data from: Ret and Etv4 Promote Directed Movements of Progenitor Cells during Renal Branching Morphogenesis.” Dryad, 2017. https://doi.org/10.5061/dryad.pk16b.","apa":"Riccio, P., Cebrián, C., Zong, H., Hippenmeyer, S., & Costantini, F. (2017). Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis. Dryad. https://doi.org/10.5061/dryad.pk16b","ama":"Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis. 2017. doi:10.5061/dryad.pk16b","ista":"Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. 2017. Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis, Dryad, 10.5061/dryad.pk16b.","short":"P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, F. Costantini, (2017).","ieee":"P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, and F. Costantini, “Data from: Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis.” Dryad, 2017."},"main_file_link":[{"url":"https://doi.org/10.5061/dryad.pk16b","open_access":"1"}]},{"doi":"10.5061/dryad.1f1rc","status":"public","day":"18","date_created":"2021-07-23T11:34:34Z","year":"2017","main_file_link":[{"url":"https://doi.org/10.5061/dryad.1f1rc","open_access":"1"}],"citation":{"chicago":"Prentice, Jason, Olivier Marre, Mark Ioffe, Adrianna Loback, Gašper Tkačik, and Michael Berry. “Data from: Error-Robust Modes of the Retinal Population Code.” Dryad, 2017. https://doi.org/10.5061/dryad.1f1rc.","apa":"Prentice, J., Marre, O., Ioffe, M., Loback, A., Tkačik, G., & Berry, M. (2017). Data from: Error-robust modes of the retinal population code. Dryad. https://doi.org/10.5061/dryad.1f1rc","mla":"Prentice, Jason, et al. Data from: Error-Robust Modes of the Retinal Population Code. Dryad, 2017, doi:10.5061/dryad.1f1rc.","short":"J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, M. Berry, (2017).","ieee":"J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, and M. Berry, “Data from: Error-robust modes of the retinal population code.” Dryad, 2017.","ama":"Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. Data from: Error-robust modes of the retinal population code. 2017. doi:10.5061/dryad.1f1rc","ista":"Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. 2017. Data from: Error-robust modes of the retinal population code, Dryad, 10.5061/dryad.1f1rc."},"_id":"9709","related_material":{"record":[{"id":"1197","relation":"used_in_publication","status":"public"}]},"oa_version":"Published Version","author":[{"full_name":"Prentice, Jason","last_name":"Prentice","first_name":"Jason"},{"last_name":"Marre","first_name":"Olivier","full_name":"Marre, Olivier"},{"full_name":"Ioffe, Mark","first_name":"Mark","last_name":"Ioffe"},{"first_name":"Adrianna","last_name":"Loback","full_name":"Loback, Adrianna"},{"last_name":"Tkačik","first_name":"Gašper","full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michael","last_name":"Berry","full_name":"Berry, Michael"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","type":"research_data_reference","date_published":"2017-10-18T00:00:00Z","title":"Data from: Error-robust modes of the retinal population code","month":"10","date_updated":"2025-09-22T09:43:12Z","department":[{"_id":"GaTk"}],"publisher":"Dryad","article_processing_charge":"No","oa":1,"abstract":[{"text":"Across the nervous system, certain population spiking patterns are observed far more frequently than others. A hypothesis about this structure is that these collective activity patterns function as population codewords–collective modes–carrying information distinct from that of any single cell. We investigate this phenomenon in recordings of ∼150 retinal ganglion cells, the retina’s output. We develop a novel statistical model that decomposes the population response into modes; it predicts the distribution of spiking activity in the ganglion cell population with high accuracy. We found that the modes represent localized features of the visual stimulus that are distinct from the features represented by single neurons. Modes form clusters of activity states that are readily discriminated from one another. When we repeated the same visual stimulus, we found that the same mode was robustly elicited. These results suggest that retinal ganglion cells’ collective signaling is endowed with a form of error-correcting code–a principle that may hold in brain areas beyond retina.","lang":"eng"}]},{"citation":{"ista":"Etheridge A, Barton NH. 2017. Data for: Establishment in a new habitat by polygenic adaptation, Mendeley Data, 10.17632/nw68fxzjpm.1.","ama":"Etheridge A, Barton NH. Data for: Establishment in a new habitat by polygenic adaptation. 2017. doi:10.17632/nw68fxzjpm.1","short":"A. Etheridge, N.H. Barton, (2017).","ieee":"A. Etheridge and N. H. Barton, “Data for: Establishment in a new habitat by polygenic adaptation.” Mendeley Data, 2017.","mla":"Etheridge, Alison, and Nicholas H. Barton. Data for: Establishment in a New Habitat by Polygenic Adaptation. Mendeley Data, 2017, doi:10.17632/nw68fxzjpm.1.","chicago":"Etheridge, Alison, and Nicholas H Barton. “Data for: Establishment in a New Habitat by Polygenic Adaptation.” Mendeley Data, 2017. https://doi.org/10.17632/nw68fxzjpm.1.","apa":"Etheridge, A., & Barton, N. H. (2017). Data for: Establishment in a new habitat by polygenic adaptation. Mendeley Data. https://doi.org/10.17632/nw68fxzjpm.1"},"main_file_link":[{"url":"https://doi.org/10.17632/nw68fxzjpm.1","open_access":"1"}],"year":"2017","date_created":"2021-08-09T13:18:55Z","status":"public","day":"29","doi":"10.17632/nw68fxzjpm.1","oa":1,"abstract":[{"lang":"eng","text":"Mathematica notebooks used to generate figures."}],"article_processing_charge":"No","publisher":"Mendeley Data","department":[{"_id":"NiBa"}],"date_updated":"2025-04-15T07:11:04Z","title":"Data for: Establishment in a new habitat by polygenic adaptation","month":"12","date_published":"2017-12-29T00:00:00Z","type":"research_data_reference","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","author":[{"full_name":"Etheridge, Alison","first_name":"Alison","last_name":"Etheridge"},{"last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"}],"oa_version":"Published Version","related_material":{"record":[{"id":"564","relation":"used_in_publication","status":"public"}]},"_id":"9842"},{"volume":86,"author":[{"id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","full_name":"Gerencser, Mate","first_name":"Mate","last_name":"Gerencser"},{"first_name":"István","last_name":"Gyöngy","full_name":"Gyöngy, István"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000400929100013"],"arxiv":["1508.05535"]},"publication_status":"published","abstract":[{"lang":"eng","text":"Cauchy problems with SPDEs on the whole space are localized to Cauchy problems on a ball of radius R. This localization reduces various kinds of spatial approximation schemes to finite dimensional problems. The error is shown to be exponentially small. As an application, a numerical scheme is presented which combines the localization and the space and time discretization, and thus is fully implementable."}],"article_processing_charge":"No","page":"2373 - 2397","title":"Localization errors in solving stochastic partial differential equations in the whole space","date_created":"2018-12-11T11:47:40Z","year":"2017","publication":"Mathematics of Computation","publication_identifier":{"issn":["0025-5718"]},"doi":"10.1090/mcom/3201","issue":"307","quality_controlled":"1","corr_author":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.05535"}],"type":"journal_article","oa_version":"Submitted Version","intvolume":" 86","scopus_import":"1","_id":"642","publist_id":"7144","oa":1,"isi":1,"date_updated":"2025-09-11T07:20:20Z","arxiv":1,"publisher":"American Mathematical Society","department":[{"_id":"JaMa"}],"date_published":"2017-01-01T00:00:00Z","language":[{"iso":"eng"}],"month":"01","status":"public","day":"01","citation":{"ama":"Gerencser M, Gyöngy I. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 2017;86(307):2373-2397. doi:10.1090/mcom/3201","ista":"Gerencser M, Gyöngy I. 2017. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 86(307), 2373–2397.","ieee":"M. Gerencser and I. Gyöngy, “Localization errors in solving stochastic partial differential equations in the whole space,” Mathematics of Computation, vol. 86, no. 307. American Mathematical Society, pp. 2373–2397, 2017.","short":"M. Gerencser, I. Gyöngy, Mathematics of Computation 86 (2017) 2373–2397.","mla":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” Mathematics of Computation, vol. 86, no. 307, American Mathematical Society, 2017, pp. 2373–97, doi:10.1090/mcom/3201.","chicago":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” Mathematics of Computation. American Mathematical Society, 2017. https://doi.org/10.1090/mcom/3201.","apa":"Gerencser, M., & Gyöngy, I. (2017). Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. American Mathematical Society. https://doi.org/10.1090/mcom/3201"}},{"ddc":["000"],"has_accepted_license":"1","file":[{"relation":"main_file","checksum":"b48d42725182d7ca10107a118815f4cf","access_level":"open_access","file_size":971347,"date_updated":"2020-07-14T12:47:30Z","file_id":"6431","creator":"dernst","date_created":"2019-05-13T08:14:44Z","content_type":"application/pdf","file_name":"main(1).pdf"}],"citation":{"ama":"Henzinger TA, Kragl B, Qadeer S. Synchronizing the Asynchronous. IST Austria; 2017. doi:10.15479/AT:IST-2018-853-v2-2","ista":"Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST Austria, 28p.","short":"T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST Austria, 2017.","ieee":"T. A. Henzinger, B. Kragl, and S. Qadeer, Synchronizing the asynchronous. IST Austria, 2017.","mla":"Henzinger, Thomas A., et al. Synchronizing the Asynchronous. IST Austria, 2017, doi:10.15479/AT:IST-2018-853-v2-2.","chicago":"Henzinger, Thomas A, Bernhard Kragl, and Shaz Qadeer. Synchronizing the Asynchronous. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2018-853-v2-2.","apa":"Henzinger, T. A., Kragl, B., & Qadeer, S. (2017). Synchronizing the asynchronous. IST Austria. https://doi.org/10.15479/AT:IST-2018-853-v2-2"},"status":"public","day":"04","alternative_title":["IST Austria Technical Report"],"publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2018-853-v2-2","year":"2017","date_created":"2019-05-13T08:15:55Z","publisher":"IST Austria","department":[{"_id":"ToHe"}],"date_updated":"2025-04-15T08:11:53Z","language":[{"iso":"eng"}],"title":"Synchronizing the asynchronous","month":"08","date_published":"2017-08-04T00:00:00Z","abstract":[{"text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent asynchronous computation threads. We show that specifications and correctness proofs for asynchronous programs can be structured by introducing the fiction, for proof purposes, that intermediate, non-quiescent states of asynchronous operations can be ignored. Then, the task of specification becomes relatively simple and the task of verification can be naturally decomposed into smaller sub-tasks. The sub-tasks iteratively summarize, guided by the structure of an asynchronous program, the atomic effect of non-atomic operations and the synchronous effect of asynchronous operations. This structuring of specifications and proofs corresponds to the introduction of multiple layers of stepwise refinement for asynchronous programs. We present the first proof rule, called synchronization, to reduce asynchronous invocations on a lower layer to synchronous invocations on a higher layer. We implemented our proof method in CIVL and evaluated it on a collection of benchmark programs.","lang":"eng"}],"oa":1,"publication_status":"published","file_date_updated":"2020-07-14T12:47:30Z","page":"28","_id":"6426","related_material":{"record":[{"status":"public","relation":"later_version","id":"133"}]},"type":"technical_report","oa_version":"Published Version","author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Kragl","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"day":"31","status":"public","OA_type":"closed access","citation":{"ista":"Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. 2017. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. 60(4), 207–214.","ama":"Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. 2017;60(4):207-214. doi:10.4077/CJP.2017.BAF469","short":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, C. Jiang, Chinese Journal of Physiology 60 (2017) 207–214.","ieee":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, and C. Jiang, “Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats,” Chinese Journal of Physiology, vol. 60, no. 4. Chinese Physiological Society, pp. 207–214, 2017.","mla":"Sun, Wuping, et al. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” Chinese Journal of Physiology, vol. 60, no. 4, Chinese Physiological Society, 2017, pp. 207–14, doi:10.4077/CJP.2017.BAF469.","apa":"Sun, W., Zhai, M.-Z., Zhou, Q., Qian, C., & Jiang, C. (2017). Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. Chinese Physiological Society. https://doi.org/10.4077/CJP.2017.BAF469","chicago":"Sun, Wuping, Ming-Zhu Zhai, Qian Zhou, Chengrui Qian, and Changyu Jiang. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” Chinese Journal of Physiology. Chinese Physiological Society, 2017. https://doi.org/10.4077/CJP.2017.BAF469."},"_id":"643","scopus_import":"1","publist_id":"7142","type":"journal_article","article_type":"original","oa_version":"None","intvolume":" 60","publisher":"Chinese Physiological Society","department":[{"_id":"RySh"}],"date_updated":"2025-09-11T07:19:13Z","month":"08","language":[{"iso":"eng"}],"date_published":"2017-08-31T00:00:00Z","isi":1,"publication":"Chinese Journal of Physiology","issue":"4","publication_identifier":{"issn":["0304-4920"]},"doi":"10.4077/CJP.2017.BAF469","year":"2017","date_created":"2018-12-11T11:47:40Z","ddc":["570"],"quality_controlled":"1","pmid":1,"volume":60,"author":[{"last_name":"Sun","first_name":"Wuping","full_name":"Sun, Wuping"},{"first_name":"Ming-Zhu","last_name":"Zhai","id":"34009CFA-F248-11E8-B48F-1D18A9856A87","full_name":"Zhai, Ming-Zhu"},{"first_name":"Qian","last_name":"Zhou","full_name":"Zhou, Qian"},{"last_name":"Qian","first_name":"Chengrui","full_name":"Qian, Chengrui"},{"first_name":"Changyu","last_name":"Jiang","full_name":"Jiang, Changyu"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats","abstract":[{"text":"It has been reported that nicotinamide-overload induces oxidative stress associated with insulin resistance, the key feature of type 2 diabetes mellitus (T2DM). This study aimed to investigate the effects of B vitamins in T2DM. Glucose tolerance tests (GTT) were carried out in adult Sprague-Dawley rats treated with or without cumulative doses of B vitamins. More specifically, insulin tolerance tests (ITT) were also carried out in adult Sprague-Dawley rats treated with or without cumulative doses of Vitamin B3. We found that cumulative Vitamin B1 and Vitamin B3 administration significantly increased the plasma H2O2 levels associated with high insulin levels. Only Vitamin B3 reduced muscular and hepatic glycogen contents. Cumulative administration of nicotinic acid, another form of Vitamin B3, also significantly increased plasma insulin level and H2O2 generation. Moreover, cumulative administration of nicotinic acid or nicotinamide impaired glucose metabolism. This study suggested that excess Vitamin B1 and Vitamin B3 caused oxidative stress and insulin resistance.","lang":"eng"}],"publication_status":"published","external_id":{"pmid":["28847140"],"isi":["000409566300002"]},"page":"207 - 214","article_processing_charge":"No"},{"oa":1,"isi":1,"department":[{"_id":"VlKo"}],"arxiv":1,"publisher":"SIAM","date_updated":"2025-09-23T13:45:56Z","month":"06","language":[{"iso":"eng"}],"date_published":"2017-06-29T00:00:00Z","type":"journal_article","oa_version":"Preprint","intvolume":" 46","_id":"644","scopus_import":"1","publist_id":"7138","project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"citation":{"mla":"Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.","apa":"Kolmogorov, V., Krokhin, A., & Rolinek, M. (2017). The complexity of general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/16M1091836","chicago":"Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2017. https://doi.org/10.1137/16M1091836.","ista":"Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110.","ama":"Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. SIAM Journal on Computing. 2017;46(3):1087-1110. doi:10.1137/16M1091836","short":"V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.","ieee":"V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” SIAM Journal on Computing, vol. 46, no. 3. SIAM, pp. 1087–1110, 2017."},"ec_funded":1,"day":"29","status":"public","abstract":[{"lang":"eng","text":"An instance of the valued constraint satisfaction problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values specifying costs of assignments of labels to its variables or the infinite value, which indicates an infeasible assignment. The goal is to find an assignment of labels to the variables that minimizes the sum. We study, assuming that P 6= NP, how the complexity of this very general problem depends on the set of functions allowed in the instances, the so-called constraint language. The case when all allowed functions take values in f0;1g corresponds to ordinary CSPs, where one deals only with the feasibility issue, and there is no optimization. This case is the subject of the algebraic CSP dichotomy conjecture predicting for which constraint languages CSPs are tractable (i.e., solvable in polynomial time) and for which they are NP-hard. The case when all allowed functions take only finite values corresponds to a finitevalued CSP, where the feasibility aspect is trivial and one deals only with the optimization issue. The complexity of finite-valued CSPs was fully classified by Thapper and Živný. An algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language was recently given by Kozik and Ochremiak. As our main result, we prove that if a constraint language satisfies this algebraic necessary condition, and the feasibility CSP (i.e., the problem of deciding whether a given instance has a feasible solution) corresponding to the VCSP with this language is tractable, then the VCSP is tractable. The algorithm is a simple combination of the assumed algorithm for the feasibility CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy for ordinary CSPs would imply a dichotomy for general-valued CSPs."}],"publication_status":"published","external_id":{"arxiv":["1502.07327"],"isi":["000404774300010"]},"page":"1087 - 1110","article_processing_charge":"No","title":"The complexity of general-valued CSPs","volume":46,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"},{"last_name":"Krokhin","first_name":"Andrei","full_name":"Krokhin, Andrei"},{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek","first_name":"Michal"}],"related_material":{"record":[{"relation":"other","id":"1637","status":"public"}]},"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1502.07327","open_access":"1"}],"year":"2017","date_created":"2018-12-11T11:47:40Z","publication":"SIAM Journal on Computing","issue":"3","doi":"10.1137/16M1091836"},{"oa":1,"isi":1,"date_updated":"2025-09-11T07:18:04Z","arxiv":1,"publisher":"Springer","department":[{"_id":"KrCh"}],"date_published":"2017-07-13T00:00:00Z","language":[{"iso":"eng"}],"month":"07","type":"conference","intvolume":" 10426","oa_version":"Submitted Version","scopus_import":"1","_id":"645","publist_id":"7135","project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"citation":{"chicago":"Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_10.","apa":"Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., & Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_10","mla":"Ashok, Pranav, et al. Value Iteration for Long Run Average Reward in Markov Decision Processes. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 201–21, doi:10.1007/978-3-319-63387-9_10.","ieee":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.","short":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221.","ama":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. Value iteration for long run average reward in markov decision processes. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:201-221. doi:10.1007/978-3-319-63387-9_10","ista":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221."},"ec_funded":1,"day":"13","status":"public","alternative_title":["LNCS"],"external_id":{"isi":["000432196400010"],"arxiv":["1705.02326"]},"publication_status":"published","abstract":[{"text":"Markov decision processes (MDPs) are standard models for probabilistic systems with non-deterministic behaviours. Long-run average rewards provide a mathematically elegant formalism for expressing long term performance. Value iteration (VI) is one of the simplest and most efficient algorithmic approaches to MDPs with other properties, such as reachability objectives. Unfortunately, a naive extension of VI does not work for MDPs with long-run average rewards, as there is no known stopping criterion. In this work our contributions are threefold. (1) We refute a conjecture related to stopping criteria for MDPs with long-run average rewards. (2) We present two practical algorithms for MDPs with long-run average rewards based on VI. First, we show that a combination of applying VI locally for each maximal end-component (MEC) and VI for reachability objectives can provide approximation guarantees. Second, extending the above approach with a simulation-guided on-demand variant of VI, we present an anytime algorithm that is able to deal with very large models. (3) Finally, we present experimental results showing that our methods significantly outperform the standard approaches on several benchmarks.","lang":"eng"}],"article_processing_charge":"No","page":"201 - 221","title":"Value iteration for long run average reward in markov decision processes","editor":[{"full_name":"Majumdar, Rupak","last_name":"Majumdar","first_name":"Rupak"},{"first_name":"Viktor","last_name":"Kunčak","full_name":"Kunčak, Viktor"}],"volume":10426,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"first_name":"Pranav","last_name":"Ashok","full_name":"Ashok, Pranav"},{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw","last_name":"Daca"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky","first_name":"Jan"},{"full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","first_name":"Tobias"}],"quality_controlled":"1","conference":{"end_date":"2017-07-28","location":"Heidelberg, Germany","name":"CAV: Computer Aided Verification","start_date":"2017-07-24"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.02326"}],"date_created":"2018-12-11T11:47:41Z","year":"2017","publication_identifier":{"isbn":["978-331963386-2"]},"doi":"10.1007/978-3-319-63387-9_10"},{"project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"citation":{"ama":"Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi:10.1007/978-3-319-58771-4_19","ista":"Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 235–246.","ieee":"J. Kuske, P. Swoboda, and S. Petra, “A novel convex relaxation for non binary discrete tomography,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 235–246.","short":"J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246.","mla":"Kuske, Jan, et al. A Novel Convex Relaxation for Non Binary Discrete Tomography. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:10.1007/978-3-319-58771-4_19.","apa":"Kuske, J., Swoboda, P., & Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_19","chicago":"Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation for Non Binary Discrete Tomography.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:235–46. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_19."},"ec_funded":1,"day":"01","status":"public","alternative_title":["LNCS"],"oa":1,"isi":1,"publisher":"Springer","arxiv":1,"department":[{"_id":"VlKo"}],"date_updated":"2025-09-11T07:16:00Z","month":"06","language":[{"iso":"eng"}],"date_published":"2017-06-01T00:00:00Z","type":"conference","intvolume":" 10302","oa_version":"Submitted Version","_id":"646","scopus_import":"1","publist_id":"7132","quality_controlled":"1","conference":{"name":"SSVM: Scale Space and Variational Methods in Computer Vision","start_date":"2017-06-04","end_date":"2017-06-08","location":"Kolding, Denmark"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.03769"}],"year":"2017","date_created":"2018-12-11T11:47:41Z","doi":"10.1007/978-3-319-58771-4_19","publication_identifier":{"isbn":["978-331958770-7"]},"abstract":[{"lang":"eng","text":"We present a novel convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem, that is, reconstructing discrete-valued images from few linear measurements. In contrast to state of the art approaches that split the problem into a continuous reconstruction problem for the linear measurement constraints and a discrete labeling problem to enforce discrete-valued reconstructions, we propose a joint formulation that addresses both problems simultaneously, resulting in a tighter convex relaxation. For this purpose a constrained graphical model is set up and evaluated using a novel relaxation optimized by dual decomposition. We evaluate our approach experimentally and show superior solutions both mathematically (tighter relaxation) and experimentally in comparison to previously proposed relaxations."}],"external_id":{"arxiv":["1703.03769"],"isi":["000432210900019"]},"publication_status":"published","page":"235 - 246","article_processing_charge":"No","title":"A novel convex relaxation for non binary discrete tomography","editor":[{"full_name":"Lauze, François","first_name":"François","last_name":"Lauze"},{"last_name":"Dong","first_name":"Yiqiu","full_name":"Dong, Yiqiu"},{"last_name":"Bjorholm Dahl","first_name":"Anders","full_name":"Bjorholm Dahl, Anders"}],"volume":10302,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"full_name":"Kuske, Jan","first_name":"Jan","last_name":"Kuske"},{"full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","first_name":"Paul"},{"first_name":"Stefanie","last_name":"Petra","full_name":"Petra, Stefanie"}]},{"year":"2017","date_created":"2018-12-11T11:47:41Z","doi":"10.1007/978-3-319-65765-3_7","publication_identifier":{"isbn":["978-331965764-6"]},"file":[{"content_type":"application/pdf","file_name":"IST-2017-831-v1+1_main.pdf","date_created":"2018-12-12T10:12:38Z","creator":"system","file_id":"4956","file_size":3806864,"date_updated":"2020-07-14T12:47:31Z","checksum":"faf546914ba29bcf9974ee36b6b16750","relation":"main_file","access_level":"open_access"}],"quality_controlled":"1","corr_author":"1","conference":{"name":"FORMATS: Formal Modelling and Analysis of Timed Systems","start_date":"2017-09-05","location":"Berlin, Germany","end_date":"2017-09-07"},"ddc":["005"],"has_accepted_license":"1","volume":"10419 ","author":[{"first_name":"Sergiy","last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy"},{"last_name":"Giacobbe","first_name":"Mirco","full_name":"Giacobbe, Mirco","orcid":"0000-0001-8180-0904","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Kong","first_name":"Hui","orcid":"0000-0002-3066-6941","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","full_name":"Kong, Hui"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6894"}]},"abstract":[{"text":"Despite researchers’ efforts in the last couple of decades, reachability analysis is still a challenging problem even for linear hybrid systems. Among the existing approaches, the most practical ones are mainly based on bounded-time reachable set over-approximations. For the purpose of unbounded-time analysis, one important strategy is to abstract the original system and find an invariant for the abstraction. In this paper, we propose an approach to constructing a new kind of abstraction called conic abstraction for affine hybrid systems, and to computing reachable sets based on this abstraction. The essential feature of a conic abstraction is that it partitions the state space of a system into a set of convex polyhedral cones which is derived from a uniform conic partition of the derivative space. Such a set of polyhedral cones is able to cut all trajectories of the system into almost straight segments so that every segment of a reach pipe in a polyhedral cone tends to be straight as well, and hence can be over-approximated tightly by polyhedra using similar techniques as HyTech or PHAVer. In particular, for diagonalizable affine systems, our approach can guarantee to find an invariant for unbounded reachable sets, which is beyond the capability of bounded-time reachability analysis tools. We implemented the approach in a tool and experiments on benchmarks show that our approach is more powerful than SpaceEx and PHAVer in dealing with diagonalizable systems.","lang":"eng"}],"external_id":{"isi":["000611678300007"]},"publication_status":"published","page":"116 - 132","article_processing_charge":"No","title":"Conic abstractions for hybrid systems","pubrep_id":"831","status":"public","day":"01","alternative_title":["LNCS"],"project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"citation":{"ama":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. Conic abstractions for hybrid systems. In: Vol 10419. Springer; 2017:116-132. doi:10.1007/978-3-319-65765-3_7","ista":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. 2017. Conic abstractions for hybrid systems. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 116–132.","ieee":"S. Bogomolov, M. Giacobbe, T. A. Henzinger, and H. Kong, “Conic abstractions for hybrid systems,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 116–132.","short":"S. Bogomolov, M. Giacobbe, T.A. Henzinger, H. Kong, in:, Springer, 2017, pp. 116–132.","mla":"Bogomolov, Sergiy, et al. Conic Abstractions for Hybrid Systems. Vol. 10419, Springer, 2017, pp. 116–32, doi:10.1007/978-3-319-65765-3_7.","apa":"Bogomolov, S., Giacobbe, M., Henzinger, T. A., & Kong, H. (2017). Conic abstractions for hybrid systems (Vol. 10419, pp. 116–132). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. https://doi.org/10.1007/978-3-319-65765-3_7","chicago":"Bogomolov, Sergiy, Mirco Giacobbe, Thomas A Henzinger, and Hui Kong. “Conic Abstractions for Hybrid Systems,” 10419:116–32. Springer, 2017. https://doi.org/10.1007/978-3-319-65765-3_7."},"type":"conference","oa_version":"Submitted Version","_id":"647","scopus_import":"1","publist_id":"7129","oa":1,"file_date_updated":"2020-07-14T12:47:31Z","isi":1,"publisher":"Springer","department":[{"_id":"ToHe"}],"date_updated":"2026-04-08T07:47:13Z","month":"09","language":[{"iso":"eng"}],"date_published":"2017-09-01T00:00:00Z"},{"author":[{"full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski","first_name":"Maciej"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":10185,"editor":[{"first_name":"Gerhard","last_name":"Jäger","full_name":"Jäger, Gerhard"},{"full_name":"Steila, Silvia","last_name":"Steila","first_name":"Silvia"}],"page":"600 - 613","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Pseudoentropy has found a lot of important applications to cryptography and complexity theory. In this paper we focus on the foundational problem that has not been investigated so far, namely by how much pseudoentropy (the amount seen by computationally bounded attackers) differs from its information-theoretic counterpart (seen by unbounded observers), given certain limits on attacker’s computational power? We provide the following answer for HILL pseudoentropy, which exhibits a threshold behavior around the size exponential in the entropy amount:– If the attacker size (s) and advantage () satisfy s (formula presented) where k is the claimed amount of pseudoentropy, then the pseudoentropy boils down to the information-theoretic smooth entropy. – If s (formula presented) then pseudoentropy could be arbitrarily bigger than the information-theoretic smooth entropy. Besides answering the posted question, we show an elegant application of our result to the complexity theory, namely that it implies the clas-sical result on the existence of functions hard to approximate (due to Pippenger). In our approach we utilize non-constructive techniques: the duality of linear programming and the probabilistic method."}],"publication_status":"published","external_id":{"isi":["000425175500043"]},"title":"On the complexity of breaking pseudoentropy","year":"2017","date_created":"2018-12-11T11:47:42Z","doi":"10.1007/978-3-319-55911-7_43","publication_identifier":{"isbn":["978-331955910-0"]},"corr_author":"1","quality_controlled":"1","main_file_link":[{"url":"https://eprint.iacr.org/2016/1186.pdf","open_access":"1"}],"conference":{"name":"TAMC: Theory and Applications of Models of Computation","start_date":"2017-04-20","end_date":"2017-04-22","location":"Bern, Switzerland"},"intvolume":" 10185","oa_version":"Submitted Version","type":"conference","publist_id":"7125","_id":"648","scopus_import":"1","isi":1,"oa":1,"month":"04","language":[{"iso":"eng"}],"date_published":"2017-04-01T00:00:00Z","department":[{"_id":"KrPi"}],"publisher":"Springer","date_updated":"2025-09-11T07:14:42Z","alternative_title":["LNCS"],"status":"public","day":"01","citation":{"ieee":"M. Skórski, “On the complexity of breaking pseudoentropy,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 600–613.","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 600–613.","ama":"Skórski M. On the complexity of breaking pseudoentropy. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:600-613. doi:10.1007/978-3-319-55911-7_43","ista":"Skórski M. 2017. On the complexity of breaking pseudoentropy. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 600–613.","apa":"Skórski, M. (2017). On the complexity of breaking pseudoentropy. In G. Jäger & S. Steila (Eds.) (Vol. 10185, pp. 600–613). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_43","chicago":"Skórski, Maciej. “On the Complexity of Breaking Pseudoentropy.” edited by Gerhard Jäger and Silvia Steila, 10185:600–613. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_43.","mla":"Skórski, Maciej. On the Complexity of Breaking Pseudoentropy. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 600–13, doi:10.1007/978-3-319-55911-7_43."}},{"language":[{"iso":"eng"}],"month":"10","date_published":"2017-10-05T00:00:00Z","publisher":"Springer","department":[{"_id":"JaMa"}],"date_updated":"2026-04-16T08:59:01Z","publist_id":"7123","_id":"649","scopus_import":"1","oa_version":"None","intvolume":" 2184","type":"book_chapter","citation":{"apa":"Maas, J. (2017). Entropic Ricci curvature for discrete spaces. In L. Najman & P. Romon (Eds.), Modern Approaches to Discrete Curvature (Vol. 2184, pp. 159–174). Springer. https://doi.org/10.1007/978-3-319-58002-9_5","chicago":"Maas, Jan. “Entropic Ricci Curvature for Discrete Spaces.” In Modern Approaches to Discrete Curvature, edited by Laurent Najman and Pascal Romon, 2184:159–74. Lecture Notes in Mathematics. Springer, 2017. https://doi.org/10.1007/978-3-319-58002-9_5.","mla":"Maas, Jan. “Entropic Ricci Curvature for Discrete Spaces.” Modern Approaches to Discrete Curvature, edited by Laurent Najman and Pascal Romon, vol. 2184, Springer, 2017, pp. 159–74, doi:10.1007/978-3-319-58002-9_5.","ieee":"J. Maas, “Entropic Ricci curvature for discrete spaces,” in Modern Approaches to Discrete Curvature, vol. 2184, L. Najman and P. Romon, Eds. Springer, 2017, pp. 159–174.","short":"J. Maas, in:, L. Najman, P. Romon (Eds.), Modern Approaches to Discrete Curvature, Springer, 2017, pp. 159–174.","ama":"Maas J. Entropic Ricci curvature for discrete spaces. In: Najman L, Romon P, eds. Modern Approaches to Discrete Curvature. Vol 2184. Lecture Notes in Mathematics. Springer; 2017:159-174. doi:10.1007/978-3-319-58002-9_5","ista":"Maas J. 2017.Entropic Ricci curvature for discrete spaces. In: Modern Approaches to Discrete Curvature. vol. 2184, 159–174."},"status":"public","day":"05","series_title":"Lecture Notes in Mathematics","title":"Entropic Ricci curvature for discrete spaces","page":"159 - 174","article_processing_charge":"No","abstract":[{"text":"We give a short overview on a recently developed notion of Ricci curvature for discrete spaces. This notion relies on geodesic convexity properties of the relative entropy along geodesics in the space of probability densities, for a metric which is similar to (but different from) the 2-Wasserstein metric. The theory can be considered as a discrete counterpart to the theory of Ricci curvature for geodesic measure spaces developed by Lott–Sturm–Villani.","lang":"eng"}],"publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"full_name":"Maas, Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan","last_name":"Maas"}],"editor":[{"full_name":"Najman, Laurent","last_name":"Najman","first_name":"Laurent"},{"last_name":"Romon","first_name":"Pascal","full_name":"Romon, Pascal"}],"volume":2184,"corr_author":"1","quality_controlled":"1","doi":"10.1007/978-3-319-58002-9_5","publication_identifier":{"isbn":["9783319580012"],"eisbn":["9783319580029"]},"publication":"Modern Approaches to Discrete Curvature","year":"2017","date_created":"2018-12-11T11:47:42Z"},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"last_name":"Skórski","first_name":"Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej"}],"editor":[{"first_name":"Gerhard","last_name":"Jäger","full_name":"Jäger, Gerhard"},{"full_name":"Steila, Silvia","first_name":"Silvia","last_name":"Steila"}],"volume":10185,"title":"A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds","article_processing_charge":"No","page":"586 - 599","publication_status":"published","external_id":{"isi":["000425175500042"]},"abstract":[{"lang":"eng","text":"In this work we present a short and unified proof for the Strong and Weak Regularity Lemma, based on the cryptographic tech-nique called low-complexity approximations. In short, both problems reduce to a task of finding constructively an approximation for a certain target function under a class of distinguishers (test functions), where dis-tinguishers are combinations of simple rectangle-indicators. In our case these approximations can be learned by a simple iterative procedure, which yields a unified and simple proof, achieving for any graph with density d and any approximation parameter the partition size. The novelty in our proof is: (a) a simple approach which yields both strong and weaker variant, and (b) improvements when d = o(1). At an abstract level, our proof can be seen a refinement and simplification of the “analytic” proof given by Lovasz and Szegedy."}],"publication_identifier":{"issn":["0302-9743"]},"doi":"10.1007/978-3-319-55911-7_42","date_created":"2018-12-11T11:47:42Z","year":"2017","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/965.pdf"}],"conference":{"end_date":"2017-04-22","location":"Bern, Switzerland","name":"TAMC: Theory and Applications of Models of Computation","start_date":"2017-04-20"},"corr_author":"1","quality_controlled":"1","publist_id":"7119","scopus_import":"1","_id":"650","oa_version":"Submitted Version","intvolume":" 10185","type":"conference","date_published":"2017-01-01T00:00:00Z","month":"01","language":[{"iso":"eng"}],"date_updated":"2026-04-16T09:59:38Z","publisher":"Springer","department":[{"_id":"KrPi"}],"isi":1,"oa":1,"alternative_title":["LNCS"],"day":"01","status":"public","citation":{"chicago":"Skórski, Maciej. “A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds.” edited by Gerhard Jäger and Silvia Steila, 10185:586–99. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_42.","apa":"Skórski, M. (2017). A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In G. Jäger & S. Steila (Eds.) (Vol. 10185, pp. 586–599). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_42","mla":"Skórski, Maciej. A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 586–99, doi:10.1007/978-3-319-55911-7_42.","ieee":"M. Skórski, “A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 586–599.","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 586–599.","ista":"Skórski M. 2017. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 586–599.","ama":"Skórski M. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:586-599. doi:10.1007/978-3-319-55911-7_42"}},{"citation":{"ama":"Hof B. Fluid dynamics: Water flows out of touch. Nature. 2017;541(7636):161-162. doi:10.1038/541161a","ista":"Hof B. 2017. Fluid dynamics: Water flows out of touch. Nature. 541(7636), 161–162.","short":"B. Hof, Nature 541 (2017) 161–162.","ieee":"B. Hof, “Fluid dynamics: Water flows out of touch,” Nature, vol. 541, no. 7636. Nature Publishing Group, pp. 161–162, 2017.","mla":"Hof, Björn. “Fluid Dynamics: Water Flows out of Touch.” Nature, vol. 541, no. 7636, Nature Publishing Group, 2017, pp. 161–62, doi:10.1038/541161a.","chicago":"Hof, Björn. “Fluid Dynamics: Water Flows out of Touch.” Nature. Nature Publishing Group, 2017. https://doi.org/10.1038/541161a.","apa":"Hof, B. (2017). Fluid dynamics: Water flows out of touch. Nature. Nature Publishing Group. https://doi.org/10.1038/541161a"},"day":"11","status":"public","date_published":"2017-01-11T00:00:00Z","month":"01","language":[{"iso":"eng"}],"date_updated":"2025-09-11T07:13:33Z","department":[{"_id":"BjHo"}],"publisher":"Nature Publishing Group","isi":1,"publist_id":"7116","scopus_import":"1","_id":"651","oa_version":"None","intvolume":" 541","type":"journal_article","corr_author":"1","quality_controlled":"1","publication_identifier":{"issn":["0028-0836"]},"doi":"10.1038/541161a","issue":"7636","publication":"Nature","date_created":"2018-12-11T11:47:43Z","year":"2017","title":"Fluid dynamics: Water flows out of touch","article_processing_charge":"No","page":"161 - 162","publication_status":"published","external_id":{"isi":["000396125500023"]},"abstract":[{"lang":"eng","text":"Superhydrophobic surfaces reduce the frictional drag between water and solid materials, but this effect is often temporary. The realization of sustained drag reduction has applications for water vehicles and pipeline flows.\r\n\r\n"}],"author":[{"first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":541},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"status":"public","day":"01","citation":{"chicago":"Fulek, Radoslav. “Embedding Graphs into Embedded Graphs,” Vol. 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ISAAC.2017.34.","apa":"Fulek, R. (2017). Embedding graphs into embedded graphs (Vol. 92). Presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ISAAC.2017.34","mla":"Fulek, Radoslav. Embedding Graphs into Embedded Graphs. Vol. 92, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ISAAC.2017.34.","ieee":"R. Fulek, “Embedding graphs into embedded graphs,” presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand, 2017, vol. 92.","short":"R. Fulek, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ama":"Fulek R. Embedding graphs into embedded graphs. In: Vol 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ISAAC.2017.34","ista":"Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International Symposium on Algorithms and Computation vol. 92, 34."},"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"call_identifier":"FWF","name":"Eliminating intersections in drawings of graphs","_id":"261FA626-B435-11E9-9278-68D0E5697425","grant_number":"M02281"}],"intvolume":" 92","oa_version":"Published Version","type":"conference","scopus_import":1,"_id":"6517","file_date_updated":"2020-07-14T12:47:33Z","oa":1,"date_published":"2017-12-01T00:00:00Z","language":[{"iso":"eng"}],"month":"12","date_updated":"2024-10-09T20:58:52Z","department":[{"_id":"UlWa"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2019-06-04T12:11:52Z","year":"2017","article_number":"34","doi":"10.4230/LIPICS.ISAAC.2017.34","corr_author":"1","quality_controlled":"1","file":[{"file_id":"6518","access_level":"open_access","relation":"main_file","checksum":"fc7a643e29621c8bbe49d36b39081f31","date_updated":"2020-07-14T12:47:33Z","file_size":588982,"date_created":"2019-06-04T12:20:35Z","content_type":"application/pdf","file_name":"2017_LIPIcs-Fulek.pdf","creator":"kschuh"}],"has_accepted_license":"1","ddc":["510"],"conference":{"start_date":"2017-12-09","name":"ISAAC: International Symposium on Algorithms and Computation","end_date":"2017-12-22","location":"Phuket, Thailand"},"author":[{"first_name":"Radoslav","last_name":"Fulek","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":92,"publication_status":"published","abstract":[{"lang":"eng","text":"A (possibly degenerate) drawing of a graph G in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a drawing of a planar graph G in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of G belongs to a fixed isotopy class, i.e., the rotation system (or equivalently the faces) of the embedding of G and the choice of outer face are fixed. In other words, we show that c-planarity with embedded pipes is tractable for graphs with fixed embeddings. To the best of our knowledge an analogous result was previously known essentially only when G is a cycle."}],"title":"Embedding graphs into embedded graphs"},{"article_processing_charge":"No","publication_status":"published","abstract":[{"text":"Graph games with omega-regular winning conditions provide a mathematical framework to analyze a wide range of problems in the analysis of reactive systems and programs (such as the synthesis of reactive systems, program repair, and the verification of branching time properties). Parity conditions are canonical forms to specify omega-regular winning conditions. Graph games with parity conditions are equivalent to mu-calculus model checking, and thus a very important algorithmic problem. Symbolic algorithms are of great significance because they provide scalable algorithms for the analysis of large finite-state systems, as well as algorithms for the analysis of infinite-state systems with finite quotient. A set-based symbolic algorithm uses the basic set operations and the one-step predecessor operators. We consider graph games with n vertices and parity conditions with c priorities (equivalently, a mu-calculus formula with c alternations of least and greatest fixed points). While many explicit algorithms exist for graph games with parity conditions, for set-based symbolic algorithms there are only two algorithms (notice that we use space to refer to the number of sets stored by a symbolic algorithm): (a) the basic algorithm that requires O(n^c) symbolic operations and linear space; and (b) an improved algorithm that requires O(n^{c/2+1}) symbolic operations but also O(n^{c/2+1}) space (i.e., exponential space). In this work we present two set-based symbolic algorithms for parity games: (a) our first algorithm requires O(n^{c/2+1}) symbolic operations and only requires linear space; and (b) developing on our first algorithm, we present an algorithm that requires O(n^{c/3+1}) symbolic operations and only linear space. We also present the first linear space set-based symbolic algorithm for parity games that requires at most a sub-exponential number of symbolic operations. ","lang":"eng"}],"title":"Improved set-based symbolic algorithms for parity games","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Dvorák, Wolfgang","last_name":"Dvorák","first_name":"Wolfgang"},{"last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"}],"volume":82,"quality_controlled":"1","file":[{"file_id":"6520","checksum":"7c2c9d09970af79026d7e37d9b632ef8","relation":"main_file","access_level":"open_access","file_size":710185,"date_updated":"2020-07-14T12:47:33Z","date_created":"2019-06-04T12:56:52Z","file_name":"2017_LIPIcs-Chatterjee.pdf","content_type":"application/pdf","creator":"kschuh"}],"has_accepted_license":"1","conference":{"start_date":"2017-08-20","name":"CSL: Conference on Computer Science Logic","location":"Stockholm, Sweden","end_date":"2017-08-24"},"ddc":["004"],"date_created":"2019-06-04T12:42:43Z","year":"2017","article_number":"18","doi":"10.4230/LIPICS.CSL.2017.18","file_date_updated":"2020-07-14T12:47:33Z","oa":1,"date_published":"2017-08-01T00:00:00Z","language":[{"iso":"eng"}],"month":"08","date_updated":"2025-05-14T10:53:47Z","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa_version":"Published Version","intvolume":" 82","type":"conference","scopus_import":"1","_id":"6519","citation":{"mla":"Chatterjee, Krishnendu, et al. Improved Set-Based Symbolic Algorithms for Parity Games. Vol. 82, 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.CSL.2017.18.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol. 82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.CSL.2017.18.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M., & Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CSL.2017.18","ista":"Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82, 18.","ama":"Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. Improved set-based symbolic algorithms for parity games. In: Vol 82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.CSL.2017.18","ieee":"K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.","short":"K. Chatterjee, W. Dvorák, M. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017."},"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"ec_funded":1,"status":"public","day":"01"},{"citation":{"ieee":"R. Der and G. S. Martius, “Dynamical self consistency leads to behavioral development and emergent social interactions in robots,” presented at the ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , Cergy-Pontoise, France, 2017.","short":"R. Der, G.S. Martius, in:, IEEE, 2017.","ista":"Der R, Martius GS. 2017. Dynamical self consistency leads to behavioral development and emergent social interactions in robots. ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , 7846789.","ama":"Der R, Martius GS. Dynamical self consistency leads to behavioral development and emergent social interactions in robots. In: IEEE; 2017. doi:10.1109/DEVLRN.2016.7846789","chicago":"Der, Ralf, and Georg S Martius. “Dynamical Self Consistency Leads to Behavioral Development and Emergent Social Interactions in Robots.” IEEE, 2017. https://doi.org/10.1109/DEVLRN.2016.7846789.","apa":"Der, R., & Martius, G. S. (2017). Dynamical self consistency leads to behavioral development and emergent social interactions in robots. Presented at the ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , Cergy-Pontoise, France: IEEE. https://doi.org/10.1109/DEVLRN.2016.7846789","mla":"Der, Ralf, and Georg S. Martius. Dynamical Self Consistency Leads to Behavioral Development and Emergent Social Interactions in Robots. 7846789, IEEE, 2017, doi:10.1109/DEVLRN.2016.7846789."},"quality_controlled":"1","conference":{"end_date":"2016-09-22","location":"Cergy-Pontoise, France","start_date":"2016-09-19","name":"ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics "},"date_created":"2018-12-11T11:47:43Z","year":"2017","article_number":"7846789","doi":"10.1109/DEVLRN.2016.7846789","publication_identifier":{"isbn":["978-150905069-7"]},"status":"public","day":"07","publication_status":"published","abstract":[{"text":"We present an approach that enables robots to self-organize their sensorimotor behavior from scratch without providing specific information about neither the robot nor its environment. This is achieved by a simple neural control law that increases the consistency between external sensor dynamics and internal neural dynamics of the utterly simple controller. In this way, the embodiment and the agent-environment coupling are the only source of individual development. We show how an anthropomorphic tendon driven arm-shoulder system develops different behaviors depending on that coupling. For instance: Given a bottle half-filled with water, the arm starts to shake it, driven by the physical response of the water. When attaching a brush, the arm can be manipulated into wiping a table, and when connected to a revolvable wheel it finds out how to rotate it. Thus, the robot may be said to discover the affordances of the world. When allowing two (simulated) humanoid robots to interact physically, they engage into a joint behavior development leading to, for instance, spontaneous cooperation. More social effects are observed if the robots can visually perceive each other. Although, as an observer, it is tempting to attribute an apparent intentionality, there is nothing of the kind put in. As a conclusion, we argue that emergent behavior may be much less rooted in explicit intentions, internal motivations, or specific reward systems than is commonly believed.","lang":"eng"}],"date_published":"2017-02-07T00:00:00Z","title":"Dynamical self consistency leads to behavioral development and emergent social interactions in robots","month":"02","language":[{"iso":"eng"}],"date_updated":"2021-01-12T08:07:51Z","publisher":"IEEE","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Der, Ralf","last_name":"Der","first_name":"Ralf"},{"id":"3A276B68-F248-11E8-B48F-1D18A9856A87","full_name":"Martius, Georg S","last_name":"Martius","first_name":"Georg S"}],"oa_version":"None","type":"conference","publist_id":"7100","scopus_import":1,"_id":"652"},{"title":"Practical graphs for optimal side-channel resistant memory-hard functions","article_processing_charge":"No","page":"1001-1017","publication_status":"published","external_id":{"isi":["000440307700063"]},"abstract":[{"lang":"eng","text":"A memory-hard function (MHF) ƒn with parameter n can be computed in sequential time and space n. Simultaneously, a high amortized parallel area-time complexity (aAT) is incurred per evaluation. In practice, MHFs are used to limit the rate at which an adversary (using a custom computational device) can evaluate a security sensitive function that still occasionally needs to be evaluated by honest users (using an off-the-shelf general purpose device). The most prevalent examples of such sensitive functions are Key Derivation Functions (KDFs) and password hashing algorithms where rate limits help mitigate off-line dictionary attacks. As the honest users' inputs to these functions are often (low-entropy) passwords special attention is given to a class of side-channel resistant MHFs called iMHFs.\r\n\r\nEssentially all iMHFs can be viewed as some mode of operation (making n calls to some round function) given by a directed acyclic graph (DAG) with very low indegree. Recently, a combinatorial property of a DAG has been identified (called \"depth-robustness\") which results in good provable security for an iMHF based on that DAG. Depth-robust DAGs have also proven useful in other cryptographic applications. Unfortunately, up till now, all known very depth-robust DAGs are impractically complicated and little is known about their exact (i.e. non-asymptotic) depth-robustness both in theory and in practice.\r\n\r\nIn this work we build and analyze (both formally and empirically) several exceedingly simple and efficient to navigate practical DAGs for use in iMHFs and other applications. For each DAG we:\r\n*Prove that their depth-robustness is asymptotically maximal.\r\n*Prove bounds of at least 3 orders of magnitude better on their exact depth-robustness compared to known bounds for other practical iMHF.\r\n*Implement and empirically evaluate their depth-robustness and aAT against a variety of state-of-the art (and several new) depth-reduction and low aAT attacks. \r\nWe find that, against all attacks, the new DAGs perform significantly better in practice than Argon2i, the most widely deployed iMHF in practice.\r\n\r\nAlong the way we also improve the best known empirical attacks on the aAT of Argon2i by implementing and testing several heuristic versions of a (hitherto purely theoretical) depth-reduction attack. Finally, we demonstrate practicality of our constructions by modifying the Argon2i code base to use one of the new high aAT DAGs. Experimental benchmarks on a standard off-the-shelf CPU show that the new modifications do not adversely affect the impressive throughput of Argon2i (despite seemingly enjoying significantly higher aAT).\r\n"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F","first_name":"Joel F","last_name":"Alwen"},{"first_name":"Jeremiah","last_name":"Blocki","full_name":"Blocki, Jeremiah"},{"full_name":"Harsha, Ben","first_name":"Ben","last_name":"Harsha"}],"main_file_link":[{"url":"https://eprint.iacr.org/2017/443","open_access":"1"}],"conference":{"name":"CCS: Conference on Computer and Communications Security","start_date":"2017-10-30","location":"Dallas, TX, USA","end_date":"2017-11-03"},"quality_controlled":"1","doi":"10.1145/3133956.3134031","publication_identifier":{"isbn":["9781450349468"]},"publication":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security","date_created":"2019-06-06T13:21:29Z","year":"2017","date_published":"2017-10-30T00:00:00Z","language":[{"iso":"eng"}],"month":"10","date_updated":"2025-09-18T10:40:38Z","publisher":"ACM","department":[{"_id":"KrPi"}],"isi":1,"oa":1,"scopus_import":"1","_id":"6527","oa_version":"Submitted Version","type":"conference","citation":{"ama":"Alwen JF, Blocki J, Harsha B. Practical graphs for optimal side-channel resistant memory-hard functions. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM; 2017:1001-1017. doi:10.1145/3133956.3134031","ista":"Alwen JF, Blocki J, Harsha B. 2017. Practical graphs for optimal side-channel resistant memory-hard functions. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 1001–1017.","ieee":"J. F. Alwen, J. Blocki, and B. Harsha, “Practical graphs for optimal side-channel resistant memory-hard functions,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA, 2017, pp. 1001–1017.","short":"J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM, 2017, pp. 1001–1017.","mla":"Alwen, Joel F., et al. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM, 2017, pp. 1001–17, doi:10.1145/3133956.3134031.","chicago":"Alwen, Joel F, Jeremiah Blocki, and Ben Harsha. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 1001–17. ACM, 2017. https://doi.org/10.1145/3133956.3134031.","apa":"Alwen, J. F., Blocki, J., & Harsha, B. (2017). Practical graphs for optimal side-channel resistant memory-hard functions. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 1001–1017). Dallas, TX, USA: ACM. https://doi.org/10.1145/3133956.3134031"},"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"status":"public","day":"30","ec_funded":1}]