[{"month":"10","department":[{"_id":"JiFr"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Boutté Y, Jonsson K, Mcfarlane H, et al. ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. <i>PNAS</i>. 2013;110(40):16259-16264. doi:<a href=\"https://doi.org/10.1073/pnas.1309057110\">10.1073/pnas.1309057110</a>","ieee":"Y. Boutté <i>et al.</i>, “ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation,” <i>PNAS</i>, vol. 110, no. 40. National Academy of Sciences, pp. 16259–16264, 2013.","short":"Y. Boutté, K. Jonsson, H. Mcfarlane, E. Johnson, D. Gendre, R. Swarup, J. Friml, L. Samuels, S. Robert, R. Bhalerao, PNAS 110 (2013) 16259–16264.","chicago":"Boutté, Yohann, Kristoffer Jonsson, Heather Mcfarlane, Errin Johnson, Delphine Gendre, Ranjan Swarup, Jiří Friml, Lacey Samuels, Stéphanie Robert, and Rishikesh Bhalerao. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential Cell Elongation.” <i>PNAS</i>. National Academy of Sciences, 2013. <a href=\"https://doi.org/10.1073/pnas.1309057110\">https://doi.org/10.1073/pnas.1309057110</a>.","ista":"Boutté Y, Jonsson K, Mcfarlane H, Johnson E, Gendre D, Swarup R, Friml J, Samuels L, Robert S, Bhalerao R. 2013. ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. 110(40), 16259–16264.","apa":"Boutté, Y., Jonsson, K., Mcfarlane, H., Johnson, E., Gendre, D., Swarup, R., … Bhalerao, R. (2013). ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1309057110\">https://doi.org/10.1073/pnas.1309057110</a>","mla":"Boutté, Yohann, et al. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential Cell Elongation.” <i>PNAS</i>, vol. 110, no. 40, National Academy of Sciences, 2013, pp. 16259–64, doi:<a href=\"https://doi.org/10.1073/pnas.1309057110\">10.1073/pnas.1309057110</a>."},"issue":"40","oa_version":"Submitted Version","title":"ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation","scopus_import":1,"day":"01","author":[{"last_name":"Boutté","full_name":"Boutté, Yohann","first_name":"Yohann"},{"last_name":"Jonsson","full_name":"Jonsson, Kristoffer","first_name":"Kristoffer"},{"last_name":"Mcfarlane","full_name":"Mcfarlane, Heather","first_name":"Heather"},{"first_name":"Errin","full_name":"Johnson, Errin","last_name":"Johnson"},{"full_name":"Gendre, Delphine","last_name":"Gendre","first_name":"Delphine"},{"first_name":"Ranjan","full_name":"Swarup, Ranjan","last_name":"Swarup"},{"first_name":"Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"},{"first_name":"Lacey","full_name":"Samuels, Lacey","last_name":"Samuels"},{"last_name":"Robert","full_name":"Robert, Stéphanie","first_name":"Stéphanie"},{"first_name":"Rishikesh","last_name":"Bhalerao","full_name":"Bhalerao, Rishikesh"}],"date_created":"2018-12-11T11:56:48Z","volume":110,"abstract":[{"text":"The plant hormone indole-acetic acid (auxin) is essential for many aspects of plant development. Auxin-mediated growth regulation typically involves the establishment of an auxin concentration gradient mediated by polarly localized auxin transporters. The localization of auxin carriers and their amount at the plasma membrane are controlled by membrane trafficking processes such as secretion, endocytosis, and recycling. In contrast to endocytosis or recycling, how the secretory pathway mediates the localization of auxin carriers is not well understood. In this study we have used the differential cell elongation process during apical hook development to elucidate the mechanisms underlying the post-Golgi trafficking of auxin carriers in Arabidopsis. We show that differential cell elongation during apical hook development is defective in Arabidopsis mutant echidna (ech). ECH protein is required for the trans-Golgi network (TGN)-mediated trafficking of the auxin influx carrier AUX1 to the plasma membrane. In contrast, ech mutation only marginally perturbs the trafficking of the highly related auxin influx carrier LIKE-AUX1-3 or the auxin efflux carrier PIN-FORMED-3, both also involved in hook development. Electron tomography reveals that the trafficking defects in ech mutant are associated with the perturbation of secretory vesicle genesis from the TGN. Our results identify differential mechanisms for the post-Golgi trafficking of de novo-synthesized auxin carriers to plasma membrane from the TGN and reveal how trafficking of auxin influx carriers mediates the control of differential cell elongation in apical hook development.","lang":"eng"}],"intvolume":"       110","publication_status":"published","external_id":{"pmid":["24043780"]},"year":"2013","publist_id":"4639","publication":"PNAS","status":"public","date_published":"2013-10-01T00:00:00Z","pmid":1,"publisher":"National Academy of Sciences","doi":"10.1073/pnas.1309057110","type":"journal_article","_id":"2290","date_updated":"2021-01-12T06:56:33Z","page":"16259 - 16264","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3791722/"}]},{"month":"09","year":"2013","publist_id":"4637","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"status":"public","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2013-09-01T00:00:00Z","conference":{"location":"New Orleans, LA, United States","name":"CSF: Computer Security Foundations","start_date":"2013-09-26","end_date":"2013-09-28"},"citation":{"ista":"Ferrara A, Fuchsbauer G, Warinschi B. 2013. Cryptographically enforced RBAC. CSF: Computer Security Foundations, 115–129.","chicago":"Ferrara, Anna, Georg Fuchsbauer, and Bogdan Warinschi. “Cryptographically Enforced RBAC,” 115–29. IEEE, 2013. <a href=\"https://doi.org/10.1109/CSF.2013.15\">https://doi.org/10.1109/CSF.2013.15</a>.","mla":"Ferrara, Anna, et al. <i>Cryptographically Enforced RBAC</i>. IEEE, 2013, pp. 115–29, doi:<a href=\"https://doi.org/10.1109/CSF.2013.15\">10.1109/CSF.2013.15</a>.","apa":"Ferrara, A., Fuchsbauer, G., &#38; Warinschi, B. (2013). Cryptographically enforced RBAC (pp. 115–129). Presented at the CSF: Computer Security Foundations, New Orleans, LA, United States: IEEE. <a href=\"https://doi.org/10.1109/CSF.2013.15\">https://doi.org/10.1109/CSF.2013.15</a>","ama":"Ferrara A, Fuchsbauer G, Warinschi B. Cryptographically enforced RBAC. In: IEEE; 2013:115-129. doi:<a href=\"https://doi.org/10.1109/CSF.2013.15\">10.1109/CSF.2013.15</a>","short":"A. Ferrara, G. Fuchsbauer, B. Warinschi, in:, IEEE, 2013, pp. 115–129.","ieee":"A. Ferrara, G. Fuchsbauer, and B. Warinschi, “Cryptographically enforced RBAC,” presented at the CSF: Computer Security Foundations, New Orleans, LA, United States, 2013, pp. 115–129."},"publisher":"IEEE","title":"Cryptographically enforced RBAC","oa_version":"Submitted Version","scopus_import":1,"day":"01","author":[{"first_name":"Anna","last_name":"Ferrara","full_name":"Ferrara, Anna"},{"first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg","last_name":"Fuchsbauer"},{"full_name":"Warinschi, Bogdan","last_name":"Warinschi","first_name":"Bogdan"}],"doi":"10.1109/CSF.2013.15","date_created":"2018-12-11T11:56:48Z","type":"conference","_id":"2291","date_updated":"2021-01-12T06:56:34Z","abstract":[{"lang":"eng","text":"Cryptographic access control promises to offer easily distributed trust and broader applicability, while reducing reliance on low-level online monitors. Traditional implementations of cryptographic access control rely on simple cryptographic primitives whereas recent endeavors employ primitives with richer functionality and security guarantees. Worryingly, few of the existing cryptographic access-control schemes come with precise guarantees, the gap between the policy specification and the implementation being analyzed only informally, if at all. In this paper we begin addressing this shortcoming. Unlike prior work that targeted ad-hoc policy specification, we look at the well-established Role-Based Access Control (RBAC) model, as used in a typical file system. In short, we provide a precise syntax for a computational version of RBAC, offer rigorous definitions for cryptographic policy enforcement of a large class of RBAC security policies, and demonstrate that an implementation based on attribute-based encryption meets our security notions. We view our main contribution as being at the conceptual level. Although we work with RBAC for concreteness, our general methodology could guide future research for uses of cryptography in other access-control models. \r\n"}],"page":"115 - 129","publication_status":"published","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2013/492"}]},{"conference":{"location":"Klosterneuburg, Austria","end_date":"2013-08-30","start_date":"2013-08-26","name":"MFCS: Mathematical Foundations of Computer Science"},"date_published":"2013-08-08T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Chatterjee, K., &#38; Sgall, J. (Eds.). (2013). <i>Mathematical Foundations of Computer Science 2013</i> (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical Foundations of Computer Science, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40313-2\">https://doi.org/10.1007/978-3-642-40313-2</a>","mla":"Chatterjee, Krishnendu, and Jiri Sgall, editors. <i>Mathematical Foundations of Computer Science 2013</i>. Vol. 8087, Springer, 2013, p. VI-854, doi:<a href=\"https://doi.org/10.1007/978-3-642-40313-2\">10.1007/978-3-642-40313-2</a>.","ista":"Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.","chicago":"Chatterjee, Krishnendu, and Jiri Sgall, eds. <i>Mathematical Foundations of Computer Science 2013</i>. Vol. 8087. Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40313-2\">https://doi.org/10.1007/978-3-642-40313-2</a>.","ieee":"K. Chatterjee and J. Sgall, Eds., <i>Mathematical Foundations of Computer Science 2013</i>, vol. 8087. Springer, 2013, p. VI-854.","short":"K. Chatterjee, J. Sgall, eds., Mathematical Foundations of Computer Science 2013, Springer, 2013.","ama":"Chatterjee K, Sgall J, eds. <i>Mathematical Foundations of Computer Science 2013</i>. Vol 8087. Springer; 2013:VI-854. doi:<a href=\"https://doi.org/10.1007/978-3-642-40313-2\">10.1007/978-3-642-40313-2</a>"},"status":"public","language":[{"iso":"eng"}],"publist_id":"4636","department":[{"_id":"KrCh"}],"month":"08","year":"2013","publication_identifier":{"isbn":["978-3-642-40312-5"]},"publication_status":"published","quality_controlled":"1","intvolume":"      8087","abstract":[{"text":"This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.","lang":"eng"}],"page":"VI - 854","type":"conference_editor","date_created":"2018-12-11T11:56:48Z","series_title":"Lecture Notes in Computer Science","date_updated":"2020-08-11T10:09:45Z","_id":"2292","volume":8087,"editor":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sgall","full_name":"Sgall, Jiri","first_name":"Jiri"}],"publisher":"Springer","oa_version":"None","title":"Mathematical Foundations of Computer Science 2013","doi":"10.1007/978-3-642-40313-2","scopus_import":1,"day":"08","alternative_title":["LNCS"]},{"abstract":[{"lang":"eng","text":"Many computer vision problems have an asymmetric distribution of information between training and test time. In this work, we study the case where we are given additional information about the training data, which however will not be available at test time. This situation is called learning using privileged information (LUPI). We introduce two maximum-margin techniques that are able to make use of this additional source of information, and we show that the framework is applicable to several scenarios that have been studied in computer vision before. Experiments with attributes, bounding boxes, image tags and rationales as additional information in object classification show promising results."}],"page":"825 - 832","publication_status":"published","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"www.cv-foundation.org/openaccess/content_iccv_2013/papers/Sharmanska_Learning_to_Rank_2013_ICCV_paper.pdf"}],"title":"Learning to rank using privileged information","oa_version":"Submitted Version","publisher":"IEEE","day":"01","scopus_import":1,"doi":"10.1109/ICCV.2013.107","author":[{"last_name":"Sharmanska","full_name":"Sharmanska, Viktoriia","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0192-9308","first_name":"Viktoriia"},{"first_name":"Novi","full_name":"Quadrianto, Novi","last_name":"Quadrianto"},{"first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert"}],"date_created":"2018-12-11T11:56:49Z","type":"conference","_id":"2293","date_updated":"2023-02-23T10:36:41Z","language":[{"iso":"eng"}],"status":"public","project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Sydney, Australia","name":"ICCV: International Conference on Computer Vision","start_date":"2013-12-01","end_date":"2013-12-08"},"date_published":"2013-12-01T00:00:00Z","ec_funded":1,"citation":{"ama":"Sharmanska V, Quadrianto N, Lampert C. Learning to rank using privileged information. In: IEEE; 2013:825-832. doi:<a href=\"https://doi.org/10.1109/ICCV.2013.107\">10.1109/ICCV.2013.107</a>","short":"V. Sharmanska, N. Quadrianto, C. Lampert, in:, IEEE, 2013, pp. 825–832.","ieee":"V. Sharmanska, N. Quadrianto, and C. Lampert, “Learning to rank using privileged information,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 825–832.","chicago":"Sharmanska, Viktoriia, Novi Quadrianto, and Christoph Lampert. “Learning to Rank Using Privileged Information,” 825–32. IEEE, 2013. <a href=\"https://doi.org/10.1109/ICCV.2013.107\">https://doi.org/10.1109/ICCV.2013.107</a>.","ista":"Sharmanska V, Quadrianto N, Lampert C. 2013. Learning to rank using privileged information. ICCV: International Conference on Computer Vision, 825–832.","mla":"Sharmanska, Viktoriia, et al. <i>Learning to Rank Using Privileged Information</i>. IEEE, 2013, pp. 825–32, doi:<a href=\"https://doi.org/10.1109/ICCV.2013.107\">10.1109/ICCV.2013.107</a>.","apa":"Sharmanska, V., Quadrianto, N., &#38; Lampert, C. (2013). Learning to rank using privileged information (pp. 825–832). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2013.107\">https://doi.org/10.1109/ICCV.2013.107</a>"},"month":"12","year":"2013","publist_id":"4635","department":[{"_id":"ChLa"}]},{"abstract":[{"lang":"eng","text":"In this work we propose a system for automatic classification of Drosophila embryos into developmental stages.\r\nWhile the system is designed to solve an actual problem in biological research, we believe that the principle underly-\r\ning it is interesting not only for biologists, but also for researchers in computer vision. The main idea is to combine two orthogonal sources of information:  one is a classifier trained on strongly invariant features,  which makes it applicable to images of very different conditions, but also leads to rather noisy predictions. The other is a label propagation step based on a more powerful similarity measure that however is only consistent within specific subsets of the data at a time.\r\nIn our biological setup, the information sources are the shape and the staining patterns of embryo images. We show\r\nexperimentally  that  while  neither  of  the  methods  can  be used by itself to achieve satisfactory results, their combina-\r\ntion achieves prediction quality comparable to human performance."}],"main_file_link":[{"url":"http://www.cv-foundation.org/openaccess/ICCV2013.py","open_access":"1"}],"publication_status":"published","quality_controlled":"1","doi":"10.1109/ICCV.2013.139","author":[{"first_name":"Tomas","last_name":"Kazmar","full_name":"Kazmar, Tomas"},{"first_name":"Evgeny","last_name":"Kvon","full_name":"Kvon, Evgeny"},{"first_name":"Alexander","last_name":"Stark","full_name":"Stark, Alexander"},{"last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0001-8622-7887"}],"day":"01","scopus_import":1,"title":"Drosophila Embryo Stage Annotation using Label Propagation","oa_version":"Submitted Version","publisher":"IEEE","date_updated":"2021-01-12T06:56:35Z","_id":"2294","type":"conference","date_created":"2018-12-11T11:56:49Z","oa":1,"project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"status":"public","citation":{"mla":"Kazmar, Tomas, et al. <i>Drosophila Embryo Stage Annotation Using Label Propagation</i>. IEEE, 2013, doi:<a href=\"https://doi.org/10.1109/ICCV.2013.139\">10.1109/ICCV.2013.139</a>.","apa":"Kazmar, T., Kvon, E., Stark, A., &#38; Lampert, C. (2013). Drosophila Embryo Stage Annotation using Label Propagation. Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2013.139\">https://doi.org/10.1109/ICCV.2013.139</a>","ista":"Kazmar T, Kvon E, Stark A, Lampert C. 2013. Drosophila Embryo Stage Annotation using Label Propagation. ICCV: International Conference on Computer Vision.","chicago":"Kazmar, Tomas, Evgeny Kvon, Alexander Stark, and Christoph Lampert. “Drosophila Embryo Stage Annotation Using Label Propagation.” IEEE, 2013. <a href=\"https://doi.org/10.1109/ICCV.2013.139\">https://doi.org/10.1109/ICCV.2013.139</a>.","short":"T. Kazmar, E. Kvon, A. Stark, C. Lampert, in:, IEEE, 2013.","ieee":"T. Kazmar, E. Kvon, A. Stark, and C. Lampert, “Drosophila Embryo Stage Annotation using Label Propagation,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013.","ama":"Kazmar T, Kvon E, Stark A, Lampert C. Drosophila Embryo Stage Annotation using Label Propagation. In: IEEE; 2013. doi:<a href=\"https://doi.org/10.1109/ICCV.2013.139\">10.1109/ICCV.2013.139</a>"},"ec_funded":1,"date_published":"2013-12-01T00:00:00Z","conference":{"location":"Sydney, Australia","end_date":"2013-12-08","start_date":"2013-12-01","name":"ICCV: International Conference on Computer Vision"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","month":"12","department":[{"_id":"ChLa"}],"publist_id":"4634"},{"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives</i>. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 165–80, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.165\">10.4230/LIPIcs.CSL.2013.165</a>.","apa":"Chatterjee, K., Chmelik, M., &#38; Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.165\">https://doi.org/10.4230/LIPIcs.CSL.2013.165</a>","ista":"Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with omega-regular objectives. 23, 165–180.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.165\">https://doi.org/10.4230/LIPIcs.CSL.2013.165</a>.","short":"K. Chatterjee, M. Chmelik, M. Tracol, 23 (2013) 165–180.","ieee":"K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with omega-regular objectives,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013.","ama":"Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable Markov decision processes with omega-regular objectives. 2013;23:165-180. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.165\">10.4230/LIPIcs.CSL.2013.165</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"pubrep_id":"756","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"file":[{"creator":"system","date_updated":"2020-07-14T12:45:37Z","date_created":"2018-12-12T10:09:42Z","file_size":345171,"file_id":"4766","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2017-756-v1+1_2.pdf","checksum":"ba2828322955574d9283bea0e17a37a6","relation":"main_file"}],"month":"08","publication_status":"published","file_date_updated":"2020-07-14T12:45:37Z","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"intvolume":"        23","abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs) with ω-regular conditions specified as parity objectives. The qualitative analysis problem given a POMDP and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). While the qualitative analysis problems are known to be undecidable even for very special cases of parity objectives, we establish decidability (with optimal EXPTIME-complete complexity) of the qualitative analysis problems for POMDPs with all parity objectives under finite-memory strategies. We also establish asymptotically optimal (exponential) memory bounds.","lang":"eng"}],"volume":23,"date_created":"2018-12-11T11:56:50Z","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin"},{"full_name":"Tracol, Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","last_name":"Tracol","first_name":"Mathieu"}],"day":"27","scopus_import":1,"oa_version":"Published Version","title":"What is decidable about partially observable Markov decision processes with omega-regular objectives","ec_funded":1,"date_published":"2013-08-27T00:00:00Z","conference":{"start_date":"2013-09-02","end_date":"2013-09-05","name":"CSL: Computer Science Logic","location":"Torino, Italy"},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"status":"public","publist_id":"4633","year":"2013","related_material":{"record":[{"status":"public","relation":"later_version","id":"1477"},{"relation":"earlier_version","status":"public","id":"5400"}]},"quality_controlled":"1","page":"165 - 180","ddc":["000"],"date_updated":"2023-02-23T12:24:38Z","_id":"2295","type":"conference","series_title":"Leibniz International Proceedings in Informatics","doi":"10.4230/LIPIcs.CSL.2013.165","alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"external_id":{"arxiv":["0908.3686"]},"year":"2013","publist_id":"4631","publication":"Japanese Journal of Mathematics","status":"public","date_published":"2013-09-24T00:00:00Z","publisher":"Springer","doi":"10.1007/s11537-013-1264-5","type":"journal_article","_id":"2297","date_updated":"2021-01-12T06:56:36Z","page":"185 - 232","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/0908.3686"}],"month":"09","arxiv":1,"department":[{"_id":"RoSe"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"R. Seiringer, Japanese Journal of Mathematics 8 (2013) 185–232.","ieee":"R. Seiringer, “Hot topics in cold gases: A mathematical physics perspective,” <i>Japanese Journal of Mathematics</i>, vol. 8, no. 2. Springer, pp. 185–232, 2013.","ama":"Seiringer R. Hot topics in cold gases: A mathematical physics perspective. <i>Japanese Journal of Mathematics</i>. 2013;8(2):185-232. doi:<a href=\"https://doi.org/10.1007/s11537-013-1264-5\">10.1007/s11537-013-1264-5</a>","mla":"Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.” <i>Japanese Journal of Mathematics</i>, vol. 8, no. 2, Springer, 2013, pp. 185–232, doi:<a href=\"https://doi.org/10.1007/s11537-013-1264-5\">10.1007/s11537-013-1264-5</a>.","apa":"Seiringer, R. (2013). Hot topics in cold gases: A mathematical physics perspective. <i>Japanese Journal of Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s11537-013-1264-5\">https://doi.org/10.1007/s11537-013-1264-5</a>","ista":"Seiringer R. 2013. Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. 8(2), 185–232.","chicago":"Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.” <i>Japanese Journal of Mathematics</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s11537-013-1264-5\">https://doi.org/10.1007/s11537-013-1264-5</a>."},"issue":"2","oa_version":"Preprint","title":"Hot topics in cold gases: A mathematical physics perspective","day":"24","scopus_import":1,"author":[{"last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","first_name":"Robert","orcid":"0000-0002-6781-0521"}],"date_created":"2018-12-11T11:56:50Z","volume":8,"abstract":[{"text":"We present an overview of mathematical results on the low temperature properties of dilute quantum gases, which have been obtained in the past few years. The presentation includes a discussion of Bose-Einstein condensation, the excitation spectrum for trapped gases and its relation to superfluidity, as well as the appearance of quantized vortices in rotating systems. All these properties are intensely being studied in current experiments on cold atomic gases. We will give a description of the mathematics involved in understanding these phenomena, starting from the underlying many-body Schrödinger equation.","lang":"eng"}],"intvolume":"         8","publication_status":"published"},{"quality_controlled":"1","ddc":["000","004"],"page":"150 - 171","type":"conference","date_updated":"2021-01-12T06:56:36Z","_id":"2298","publisher":"Springer","doi":"10.1007/978-3-642-38856-9_10","alternative_title":["LNCS"],"conference":{"location":"Seattle, WA, United States","start_date":"2013-06-20","end_date":"2013-06-22","name":"SAS: Static Analysis Symposium"},"date_published":"2013-01-01T00:00:00Z","ec_funded":1,"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"status":"public","publist_id":"4630","year":"2013","publication_status":"published","file_date_updated":"2020-07-14T12:45:37Z","abstract":[{"lang":"eng","text":"We present a shape analysis for programs that manipulate overlaid data structures which share sets of objects. The abstract domain contains Separation Logic formulas that (1) combine a per-object separating conjunction with a per-field separating conjunction and (2) constrain a set of variables interpreted as sets of objects. The definition of the abstract domain operators is based on a notion of homomorphism between formulas, viewed as graphs, used recently to define optimal decision procedures for fragments of the Separation Logic. Based on a Frame Rule that supports the two versions of the separating conjunction, the analysis is able to reason in a modular manner about non-overlaid data structures and then, compose information only at a few program points, e.g., procedure returns. We have implemented this analysis in a prototype tool and applied it on several interesting case studies that manipulate overlaid and nested linked lists.\r\n"}],"intvolume":"      7935","has_accepted_license":"1","date_created":"2018-12-11T11:56:50Z","volume":7935,"title":"Local shape analysis for overlaid data structures","oa_version":"Submitted Version","author":[{"first_name":"Cezara","last_name":"Dragoi","full_name":"Dragoi, Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Constantin","last_name":"Enea","full_name":"Enea, Constantin"},{"first_name":"Mihaela","full_name":"Sighireanu, Mihaela","last_name":"Sighireanu"}],"scopus_import":1,"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Dragoi C, Enea C, Sighireanu M. Local shape analysis for overlaid data structures. In: Vol 7935. Springer; 2013:150-171. doi:<a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">10.1007/978-3-642-38856-9_10</a>","ieee":"C. Dragoi, C. Enea, and M. Sighireanu, “Local shape analysis for overlaid data structures,” presented at the SAS: Static Analysis Symposium, Seattle, WA, United States, 2013, vol. 7935, pp. 150–171.","short":"C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2013, pp. 150–171.","chicago":"Dragoi, Cezara, Constantin Enea, and Mihaela Sighireanu. “Local Shape Analysis for Overlaid Data Structures,” 7935:150–71. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">https://doi.org/10.1007/978-3-642-38856-9_10</a>.","ista":"Dragoi C, Enea C, Sighireanu M. 2013. Local shape analysis for overlaid data structures. SAS: Static Analysis Symposium, LNCS, vol. 7935, 150–171.","apa":"Dragoi, C., Enea, C., &#38; Sighireanu, M. (2013). Local shape analysis for overlaid data structures (Vol. 7935, pp. 150–171). Presented at the SAS: Static Analysis Symposium, Seattle, WA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">https://doi.org/10.1007/978-3-642-38856-9_10</a>","mla":"Dragoi, Cezara, et al. <i>Local Shape Analysis for Overlaid Data Structures</i>. Vol. 7935, Springer, 2013, pp. 150–71, doi:<a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">10.1007/978-3-642-38856-9_10</a>."},"language":[{"iso":"eng"}],"pubrep_id":"196","oa":1,"file":[{"file_id":"4824","date_created":"2018-12-12T10:10:36Z","file_size":299004,"date_updated":"2020-07-14T12:45:37Z","creator":"system","relation":"main_file","checksum":"907edd33a5892e3af093365f1fd57ed7","file_name":"IST-2014-196-v1+1_sas13.pdf","access_level":"open_access","content_type":"application/pdf"}],"department":[{"_id":"ToHe"}],"month":"01"},{"page":"585 - 601","ddc":["000"],"quality_controlled":"1","doi":"10.1007/s10009-011-0207-9","publisher":"Springer","date_updated":"2021-01-12T06:56:37Z","_id":"2299","type":"journal_article","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publication":"International Journal on Software Tools for Technology Transfer","status":"public","date_published":"2013-10-01T00:00:00Z","year":"2013","publist_id":"4629","has_accepted_license":"1","abstract":[{"lang":"eng","text":"The standard hardware design flow involves: (a) design of an integrated circuit using a hardware description language, (b) extensive functional and formal verification, and (c) logical synthesis. However, the above-mentioned processes consume significant effort and time. An alternative approach is to use a formal specification language as a high-level hardware description language and synthesize hardware from formal specifications. Our work is a case study of the synthesis of the widely and industrially used AMBA AHB protocol from formal specifications. Bloem et al. presented the first formal specifications for the AMBA AHB Arbiter and synthesized the AHB Arbiter circuit. However, in the first formal specification some important assumptions were missing. Our contributions are as follows: (a) We present detailed formal specifications for the AHB Arbiter incorporating the missing details, and obtain significant improvements in the synthesis results (both with respect to the number of gates in the synthesized circuit and with respect to the time taken to synthesize the circuit), and (b) we present formal specifications to generate compact circuits for the remaining two main components of AMBA AHB, namely, AHB Master and AHB Slave. Thus with systematic description we are able to automatically and completely synthesize an important and widely used industrial protocol."}],"intvolume":"        15","publication_status":"published","file_date_updated":"2020-07-14T12:45:37Z","author":[{"last_name":"Godhal","id":"5B547124-EB61-11E9-8887-89D9C04DBDF5","full_name":"Godhal, Yashdeep","first_name":"Yashdeep"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"day":"01","scopus_import":1,"oa_version":"Submitted Version","title":"Synthesis of AMBA AHB from formal specification: A case study","volume":15,"date_created":"2018-12-11T11:56:51Z","oa":1,"language":[{"iso":"eng"}],"pubrep_id":"87","issue":"5-6","citation":{"ama":"Godhal Y, Chatterjee K, Henzinger TA. Synthesis of AMBA AHB from formal specification: A case study. <i>International Journal on Software Tools for Technology Transfer</i>. 2013;15(5-6):585-601. doi:<a href=\"https://doi.org/10.1007/s10009-011-0207-9\">10.1007/s10009-011-0207-9</a>","short":"Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601.","ieee":"Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 15, no. 5–6. Springer, pp. 585–601, 2013.","chicago":"Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” <i>International Journal on Software Tools for Technology Transfer</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s10009-011-0207-9\">https://doi.org/10.1007/s10009-011-0207-9</a>.","ista":"Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.","mla":"Godhal, Yashdeep, et al. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 15, no. 5–6, Springer, 2013, pp. 585–601, doi:<a href=\"https://doi.org/10.1007/s10009-011-0207-9\">10.1007/s10009-011-0207-9</a>.","apa":"Godhal, Y., Chatterjee, K., &#38; Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. <i>International Journal on Software Tools for Technology Transfer</i>. Springer. <a href=\"https://doi.org/10.1007/s10009-011-0207-9\">https://doi.org/10.1007/s10009-011-0207-9</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file":[{"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2012-87-v1+1_Synthesis_of_AMBA_AHB_from_formal_specifications-_A_case_study.pdf","checksum":"57b06a732dd8d6349190dba6b5b0d33b","relation":"main_file","date_updated":"2020-07-14T12:45:37Z","creator":"system","date_created":"2018-12-12T10:11:53Z","file_size":277372,"file_id":"4910"}]},{"publication":"Physical Review B","status":"public","date_published":"2013-08-01T00:00:00Z","year":"2013","external_id":{"arxiv":["1305.5323"]},"publist_id":"4627","main_file_link":[{"url":"http://arxiv.org/abs/1305.5323","open_access":"1"}],"quality_controlled":"1","doi":"10.1103/PhysRevB.88.064401","publisher":"American Physical Society","date_updated":"2021-01-12T06:56:38Z","_id":"2300","type":"journal_article","oa":1,"language":[{"iso":"eng"}],"issue":"6","citation":{"ieee":"A. Giuliani, É. Lieb, and R. Seiringer, “Realization of stripes and slabs in two and three dimensions,” <i>Physical Review B</i>, vol. 88, no. 6. American Physical Society, 2013.","short":"A. Giuliani, É. Lieb, R. Seiringer, Physical Review B 88 (2013).","ama":"Giuliani A, Lieb É, Seiringer R. Realization of stripes and slabs in two and three dimensions. <i>Physical Review B</i>. 2013;88(6). doi:<a href=\"https://doi.org/10.1103/PhysRevB.88.064401\">10.1103/PhysRevB.88.064401</a>","apa":"Giuliani, A., Lieb, É., &#38; Seiringer, R. (2013). Realization of stripes and slabs in two and three dimensions. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.88.064401\">https://doi.org/10.1103/PhysRevB.88.064401</a>","mla":"Giuliani, Alessandro, et al. “Realization of Stripes and Slabs in Two and Three Dimensions.” <i>Physical Review B</i>, vol. 88, no. 6, 064401, American Physical Society, 2013, doi:<a href=\"https://doi.org/10.1103/PhysRevB.88.064401\">10.1103/PhysRevB.88.064401</a>.","ista":"Giuliani A, Lieb É, Seiringer R. 2013. Realization of stripes and slabs in two and three dimensions. Physical Review B. 88(6), 064401.","chicago":"Giuliani, Alessandro, Élliott Lieb, and Robert Seiringer. “Realization of Stripes and Slabs in Two and Three Dimensions.” <i>Physical Review B</i>. American Physical Society, 2013. <a href=\"https://doi.org/10.1103/PhysRevB.88.064401\">https://doi.org/10.1103/PhysRevB.88.064401</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"month":"08","department":[{"_id":"RoSe"}],"article_number":"064401","intvolume":"        88","abstract":[{"text":"We consider Ising models in two and three dimensions with nearest neighbor ferromagnetic interactions and long-range, power law decaying, antiferromagnetic interactions. If the strength of the ferromagnetic coupling J is larger than a critical value Jc, then the ground state is homogeneous and ferromagnetic. As the critical value is approached from smaller values of J, it is believed that the ground state consists of a periodic array of stripes (d=2) or slabs (d=3), all of the same size and alternating magnetization. Here we prove rigorously that the ground state energy per site converges to that of the optimal periodic striped or slabbed state, in the limit that J tends to the ferromagnetic transition point. While this theorem does not prove rigorously that the ground state is precisely striped or slabbed, it does prove that in any suitably large box the ground state is striped or slabbed with high probability.","lang":"eng"}],"publication_status":"published","author":[{"first_name":"Alessandro","last_name":"Giuliani","full_name":"Giuliani, Alessandro"},{"last_name":"Lieb","full_name":"Lieb, Élliott","first_name":"Élliott"},{"orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert"}],"day":"01","scopus_import":1,"oa_version":"Preprint","title":"Realization of stripes and slabs in two and three dimensions","volume":88,"date_created":"2018-12-11T11:56:51Z"},{"page":"321 - 331","abstract":[{"text":"We describe the design and implementation of P, a domain-specific language to write asynchronous event driven code. P allows the programmer to specify the system as a collection of interacting state machines, which communicate with each other using events. P unifies modeling and programming into one activity for the programmer. Not only can a P program be compiled into executable code, but it can also be tested using model checking techniques. P allows the programmer to specify the environment, used to &quot;close&quot; the system during testing, as nondeterministic ghost machines. Ghost machines are erased during compilation to executable code; a type system ensures that the erasure is semantics preserving. The P language is designed so that a P program can be checked for responsiveness-the ability to handle every event in a timely manner. By default, a machine needs to handle every event that arrives in every state. But handling every event in every state is impractical. The language provides a notion of deferred events where the programmer can annotate when she wants to delay processing an event. The default safety checker looks for presence of unhan-dled events. The language also provides default liveness checks that an event cannot be potentially deferred forever. P was used to implement and verify the core of the USB device driver stack that ships with Microsoft Windows 8. The resulting driver is more reliable and performs better than its prior incarnation (which did not use P); we have more confidence in the robustness of its design due to the language abstractions and verification provided by P.","lang":"eng"}],"main_file_link":[{"url":"http://research.microsoft.com/pubs/191069/pldi212_desai.pdf"}],"quality_controlled":"1","publication_status":"published","doi":"10.1145/2491956.2462184","author":[{"full_name":"Desai, Ankush","last_name":"Desai","first_name":"Ankush"},{"full_name":"Gupta, Vivek","last_name":"Gupta","first_name":"Vivek"},{"last_name":"Jackson","full_name":"Jackson, Ethan","first_name":"Ethan"},{"first_name":"Shaz","full_name":"Qadeer, Shaz","last_name":"Qadeer"},{"last_name":"Rajamani","full_name":"Rajamani, Sriram","first_name":"Sriram"},{"last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","first_name":"Damien"}],"scopus_import":1,"day":"01","oa_version":"None","title":"P: Safe asynchronous event-driven programming","publisher":"ACM","date_updated":"2021-01-12T06:56:38Z","_id":"2301","type":"conference","date_created":"2018-12-11T11:56:52Z","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","status":"public","ec_funded":1,"citation":{"apa":"Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S., &#38; Zufferey, D. (2013). P: Safe asynchronous event-driven programming. In <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i> (pp. 321–331). Seattle, WA, United States: ACM. <a href=\"https://doi.org/10.1145/2491956.2462184\">https://doi.org/10.1145/2491956.2462184</a>","mla":"Desai, Ankush, et al. “P: Safe Asynchronous Event-Driven Programming.” <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, ACM, 2013, pp. 321–31, doi:<a href=\"https://doi.org/10.1145/2491956.2462184\">10.1145/2491956.2462184</a>.","ista":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. 2013. P: Safe asynchronous event-driven programming. Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Languages Design and Implementation, 321–331.","chicago":"Desai, Ankush, Vivek Gupta, Ethan Jackson, Shaz Qadeer, Sriram Rajamani, and Damien Zufferey. “P: Safe Asynchronous Event-Driven Programming.” In <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, 321–31. ACM, 2013. <a href=\"https://doi.org/10.1145/2491956.2462184\">https://doi.org/10.1145/2491956.2462184</a>.","ieee":"A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, and D. Zufferey, “P: Safe asynchronous event-driven programming,” in <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Seattle, WA, United States, 2013, pp. 321–331.","short":"A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, D. Zufferey, in:, Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–331.","ama":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. P: Safe asynchronous event-driven programming. In: <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>. ACM; 2013:321-331. doi:<a href=\"https://doi.org/10.1145/2491956.2462184\">10.1145/2491956.2462184</a>"},"conference":{"location":"Seattle, WA, United States","start_date":"2013-06-16","end_date":"2013-06-19","name":"PLDI: Programming Languages Design and Implementation"},"date_published":"2013-06-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","month":"06","department":[{"_id":"ToHe"}],"publist_id":"4626"},{"doi":"10.1007/s11515-013-1279-6","author":[{"first_name":"Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer"}],"scopus_import":1,"day":"03","title":"Dissection of gene function at clonal level using mosaic analysis with double markers","oa_version":"None","publisher":"Springer","date_updated":"2021-01-12T06:56:39Z","volume":8,"_id":"2303","article_type":"review","type":"journal_article","date_created":"2018-12-11T11:56:52Z","page":"557 - 568","abstract":[{"text":"MADM (Mosaic Analysis with Double Markers) technology offers a genetic approach in mice to visualize and concomitantly manipulate genetically defined cells at clonal level and single cell resolution. MADM employs Cre recombinase/loxP-dependent interchromosomal mitotic recombination to reconstitute two split marker genes—green GFP and red tdTomato—and can label sparse clones of homozygous mutant cells in one color and wild-type cells in the other color in an otherwise unlabeled background. At present, major MADM applications include lineage tracing, single cell labeling, conditional knockouts in small populations of cells and induction of uniparental chromosome disomy to assess effects of genomic imprinting. MADM can be applied universally in the mouse with the sole limitation being the specificity of the promoter controlling Cre recombinase expression. Here I review recent developments and extensions of the MADM technique and give an overview of the major discoveries and progresses enabled by the implementation of the novel genetic MADM tools.","lang":"eng"}],"intvolume":"         8","publication_status":"published","quality_controlled":"1","year":"2013","month":"09","department":[{"_id":"SiHi"}],"publist_id":"4624","status":"public","publication":"Frontiers in Biology","language":[{"iso":"eng"}],"issue":"6","citation":{"chicago":"Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic Analysis with Double Markers.” <i>Frontiers in Biology</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s11515-013-1279-6\">https://doi.org/10.1007/s11515-013-1279-6</a>.","ista":"Hippenmeyer S. 2013. Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. 8(6), 557–568.","apa":"Hippenmeyer, S. (2013). Dissection of gene function at clonal level using mosaic analysis with double markers. <i>Frontiers in Biology</i>. Springer. <a href=\"https://doi.org/10.1007/s11515-013-1279-6\">https://doi.org/10.1007/s11515-013-1279-6</a>","mla":"Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic Analysis with Double Markers.” <i>Frontiers in Biology</i>, vol. 8, no. 6, Springer, 2013, pp. 557–68, doi:<a href=\"https://doi.org/10.1007/s11515-013-1279-6\">10.1007/s11515-013-1279-6</a>.","ama":"Hippenmeyer S. Dissection of gene function at clonal level using mosaic analysis with double markers. <i>Frontiers in Biology</i>. 2013;8(6):557-568. doi:<a href=\"https://doi.org/10.1007/s11515-013-1279-6\">10.1007/s11515-013-1279-6</a>","ieee":"S. Hippenmeyer, “Dissection of gene function at clonal level using mosaic analysis with double markers,” <i>Frontiers in Biology</i>, vol. 8, no. 6. Springer, pp. 557–568, 2013.","short":"S. Hippenmeyer, Frontiers in Biology 8 (2013) 557–568."},"date_published":"2013-09-03T00:00:00Z","acknowledgement":"This work was supported by IST Austria institutional funds.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"publication_status":"published","quality_controlled":"1","abstract":[{"text":"This extended abstract is concerned with the irregularities of distribution of one-dimensional permuted van der Corput sequences that are generated from linear permutations. We show how to obtain upper bounds for the discrepancy and diaphony of these sequences, by relating them to Kronecker sequences and applying earlier results of Faure and Niederreiter.","lang":"eng"}],"intvolume":"        43","page":"43 - 50","type":"journal_article","date_created":"2018-12-11T11:56:53Z","date_updated":"2021-01-12T06:56:39Z","_id":"2304","volume":43,"oa_version":"None","title":"Van der Corput sequences and linear permutations","publisher":"Elsevier","doi":"10.1016/j.endm.2013.07.008","author":[{"first_name":"Florian","orcid":"0000-0002-8379-3768","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","full_name":"Pausinger, Florian","last_name":"Pausinger"}],"scopus_import":1,"day":"05","date_published":"2013-09-05T00:00:00Z","acknowledgement":"This research is supported by the Graduate school of IST Austria (Institute of Science and Technology Austria).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"F. Pausinger, Electronic Notes in Discrete Mathematics 43 (2013) 43–50.","ieee":"F. Pausinger, “Van der Corput sequences and linear permutations,” <i>Electronic Notes in Discrete Mathematics</i>, vol. 43. Elsevier, pp. 43–50, 2013.","ama":"Pausinger F. Van der Corput sequences and linear permutations. <i>Electronic Notes in Discrete Mathematics</i>. 2013;43:43-50. doi:<a href=\"https://doi.org/10.1016/j.endm.2013.07.008\">10.1016/j.endm.2013.07.008</a>","mla":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” <i>Electronic Notes in Discrete Mathematics</i>, vol. 43, Elsevier, 2013, pp. 43–50, doi:<a href=\"https://doi.org/10.1016/j.endm.2013.07.008\">10.1016/j.endm.2013.07.008</a>.","apa":"Pausinger, F. (2013). Van der Corput sequences and linear permutations. <i>Electronic Notes in Discrete Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.endm.2013.07.008\">https://doi.org/10.1016/j.endm.2013.07.008</a>","ista":"Pausinger F. 2013. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 43, 43–50.","chicago":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” <i>Electronic Notes in Discrete Mathematics</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.endm.2013.07.008\">https://doi.org/10.1016/j.endm.2013.07.008</a>."},"publication":"Electronic Notes in Discrete Mathematics","language":[{"iso":"eng"}],"status":"public","publist_id":"4623","department":[{"_id":"HeEd"}],"month":"09","year":"2013"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” in <i>28th Annual ACM/IEEE Symposium</i>, New Orleans, LA, United States, 2013, pp. 331–340.","short":"T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, in:, 28th Annual ACM/IEEE Symposium, IEEE, 2013, pp. 331–340.","ama":"Brázdil T, Chatterjee K, Forejt V, Kučera A. Trading performance for stability in Markov decision processes. In: <i>28th Annual ACM/IEEE Symposium</i>. IEEE; 2013:331-340. doi:<a href=\"https://doi.org/10.1109/LICS.2013.39\">10.1109/LICS.2013.39</a>","apa":"Brázdil, T., Chatterjee, K., Forejt, V., &#38; Kučera, A. (2013). Trading performance for stability in Markov decision processes. In <i>28th Annual ACM/IEEE Symposium</i> (pp. 331–340). New Orleans, LA, United States: IEEE. <a href=\"https://doi.org/10.1109/LICS.2013.39\">https://doi.org/10.1109/LICS.2013.39</a>","mla":"Brázdil, Tomáš, et al. “Trading Performance for Stability in Markov Decision Processes.” <i>28th Annual ACM/IEEE Symposium</i>, IEEE, 2013, pp. 331–40, doi:<a href=\"https://doi.org/10.1109/LICS.2013.39\">10.1109/LICS.2013.39</a>.","ista":"Brázdil T, Chatterjee K, Forejt V, Kučera A. 2013. Trading performance for stability in Markov decision processes. 28th Annual ACM/IEEE Symposium. LICS: Logic in Computer Science, 331–340.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Trading Performance for Stability in Markov Decision Processes.” In <i>28th Annual ACM/IEEE Symposium</i>, 331–40. IEEE, 2013. <a href=\"https://doi.org/10.1109/LICS.2013.39\">https://doi.org/10.1109/LICS.2013.39</a>."},"language":[{"iso":"eng"}],"oa":1,"department":[{"_id":"KrCh"}],"month":"08","arxiv":1,"publication_status":"published","abstract":[{"lang":"eng","text":"We study the complexity of central controller synthesis problems for finite-state Markov decision processes, where the objective is to optimize both the expected mean-payoff performance of the system and its stability. e argue that the basic theoretical notion of expressing the stability in terms of the variance of the mean-payoff (called global variance in our paper) is not always sufficient, since it ignores possible instabilities on respective runs. For this reason we propose alernative definitions of stability, which we call local and hybrid variance, and which express how rewards on each run deviate from the run's own mean-payoff and from the expected mean-payoff, respectively. We show that a strategy ensuring both the expected mean-payoff and the variance below given bounds requires randomization and memory, under all the above semantics of variance. We then look at the problem of determining whether there is a such a strategy. For the global variance, we show that the problem is in PSPACE, and that the answer can be approximated in pseudo-polynomial time. For the hybrid variance, the analogous decision problem is in NP, and a polynomial-time approximating algorithm also exists. For local variance, we show that the decision problem is in NP. Since the overall performance can be traded for stability (and vice versa), we also present algorithms for approximating the associated Pareto curve in all the three cases. Finally, we study a special case of the decision problems, where we require a given expected mean-payoff together with zero variance. Here we show that the problems can be all solved in polynomial time."}],"date_created":"2018-12-11T11:56:53Z","title":"Trading performance for stability in Markov decision processes","oa_version":"Preprint","author":[{"first_name":"Tomáš","last_name":"Brázdil","full_name":"Brázdil, Tomáš"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Forejt, Vojtěch","last_name":"Forejt","first_name":"Vojtěch"},{"first_name":"Antonín","full_name":"Kučera, Antonín","last_name":"Kučera"}],"day":"01","scopus_import":1,"date_published":"2013-08-01T00:00:00Z","conference":{"location":"New Orleans, LA, United States","name":"LICS: Logic in Computer Science","end_date":"2013-06-28","start_date":"2013-06-25"},"ec_funded":1,"project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publication":"28th Annual ACM/IEEE Symposium","status":"public","publist_id":"4622","external_id":{"arxiv":["1305.4103"]},"related_material":{"record":[{"relation":"later_version","status":"public","id":"1294"}]},"year":"2013","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1305.4103"}],"page":"331 - 340","type":"conference","date_updated":"2023-09-20T11:15:30Z","_id":"2305","publisher":"IEEE","doi":"10.1109/LICS.2013.39"},{"oa":1,"pubrep_id":"725","language":[{"iso":"ger"}],"citation":{"apa":"Danowski, P., &#38; Pohl, A. (2013). <i>(Open) Linked Data in Bibliotheken</i> (Vol. 50). De Gruyter. <a href=\"https://doi.org/10.1515/9783110278736\">https://doi.org/10.1515/9783110278736</a>","mla":"Danowski, Patrick, and Adrian Pohl. <i>(Open) Linked Data in Bibliotheken</i>. Vol. 50, De Gruyter, 2013, doi:<a href=\"https://doi.org/10.1515/9783110278736\">10.1515/9783110278736</a>.","chicago":"Danowski, Patrick, and Adrian Pohl. <i>(Open) Linked Data in Bibliotheken</i>. Vol. 50. De Gruyter, 2013. <a href=\"https://doi.org/10.1515/9783110278736\">https://doi.org/10.1515/9783110278736</a>.","ista":"Danowski P, Pohl A. 2013. (Open) Linked Data in Bibliotheken, De Gruyter,p.","ieee":"P. Danowski and A. Pohl, <i>(Open) Linked Data in Bibliotheken</i>, vol. 50. De Gruyter, 2013.","short":"P. Danowski, A. Pohl, (Open) Linked Data in Bibliotheken, De Gruyter, 2013.","ama":"Danowski P, Pohl A. <i>(Open) Linked Data in Bibliotheken</i>. Vol 50. De Gruyter; 2013. doi:<a href=\"https://doi.org/10.1515/9783110278736\">10.1515/9783110278736</a>"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"09","department":[{"_id":"E-Lib"}],"file":[{"file_id":"4774","file_size":67731,"date_created":"2018-12-12T10:09:49Z","date_updated":"2020-07-14T12:45:38Z","creator":"system","relation":"main_file","checksum":"807a408bbee519d792702828a32c6e85","file_name":"IST-2017-725-v1+1_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Frontmatter.pdf","content_type":"application/pdf","access_level":"open_access"},{"relation":"main_file","checksum":"587e95c2ba24307a5a5d5bd1579429d9","file_name":"IST-2017-725-v1+2_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Inhalt.pdf","content_type":"application/pdf","access_level":"open_access","file_id":"4775","file_size":43563,"date_created":"2018-12-12T10:09:50Z","date_updated":"2020-07-14T12:45:38Z","creator":"system"},{"checksum":"dbcada36bb32d725d9838615706e700f","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"IST-2017-725-v1+3_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_in_der_Bibliothekswelt__Grundlagen_und_Überblick.pdf","file_id":"4776","date_updated":"2020-07-14T12:45:38Z","creator":"system","date_created":"2018-12-12T10:09:51Z","file_size":11318599},{"relation":"main_file","checksum":"5235712bf0a49ccc8c2cb4f6c2560d43","file_name":"IST-2017-725-v1+4_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Vokabulare_für_bibliographische_Daten.pdf","content_type":"application/pdf","access_level":"open_access","file_id":"4777","date_created":"2018-12-12T10:09:52Z","file_size":330210,"creator":"system","date_updated":"2020-07-14T12:45:38Z"},{"relation":"main_file","checksum":"d851cc91f705da80617ac7df33c1c0e1","file_name":"IST-2017-725-v1+5_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_FRBR,_Serials_und_CIDOC_CRM_-_Modellierung_von_fortlaufenden_Sammelwerken_unter_Verwendung_von_FRBRoo.pdf","content_type":"application/pdf","access_level":"open_access","file_id":"4778","date_created":"2018-12-12T10:09:53Z","file_size":10652088,"creator":"system","date_updated":"2020-07-14T12:45:38Z"},{"relation":"main_file","checksum":"4e77b182692c58e50fc5251bf23cc584","file_name":"IST-2017-725-v1+6_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Die_Provenienz_von_Linked_Data.pdf","content_type":"application/pdf","access_level":"open_access","file_id":"4779","date_created":"2018-12-12T10:09:54Z","file_size":6125273,"creator":"system","date_updated":"2020-07-14T12:45:38Z"},{"access_level":"open_access","content_type":"application/pdf","file_name":"IST-2017-725-v1+7_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Forschungsdaten.pdf","checksum":"3debae38064d5099d22f855c353a57ec","relation":"main_file","date_updated":"2020-07-14T12:45:38Z","creator":"system","file_size":1893872,"date_created":"2018-12-12T10:09:55Z","file_id":"4780"},{"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2017-725-v1+8_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Datenanreicherung_auf_LOD-Basis.pdf","checksum":"e630b330dc0b7522d2cf204587030252","relation":"main_file","date_updated":"2020-07-14T12:45:38Z","creator":"system","file_size":1095929,"date_created":"2018-12-12T10:09:56Z","file_id":"4781"},{"file_name":"IST-2017-725-v1+9_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Herausforderung_Wissensvernetzung.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"17edda91271bfcce8e1b6e77ca1c9d11","date_created":"2018-12-12T10:09:57Z","file_size":149699,"creator":"system","date_updated":"2020-07-14T12:45:38Z","file_id":"4782"},{"relation":"main_file","checksum":"aacef6734b1de58aeb58024fc47c2373","file_name":"IST-2017-725-v1+10_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_geht_in_die_Fläche__Der_B3Kat_stellt_seine_Daten_frei.pdf","content_type":"application/pdf","access_level":"open_access","file_id":"4783","date_created":"2018-12-12T10:09:58Z","file_size":8828405,"date_updated":"2020-07-14T12:45:38Z","creator":"system"},{"relation":"main_file","checksum":"0619451f7ff3ea641ce0b10c97831f47","file_name":"IST-2017-725-v1+11_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Open_Data_und_Linked_Data_in_einem_Informationssystem_für_die_Archäologie.pdf","access_level":"open_access","content_type":"application/pdf","file_id":"4784","date_created":"2018-12-12T10:09:59Z","file_size":3191208,"date_updated":"2020-07-14T12:45:38Z","creator":"system"},{"access_level":"open_access","content_type":"application/pdf","file_name":"IST-2017-725-v1+12_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Definition__Offenes_Wissen.pdf","checksum":"44dc8a9fc003f0edd912968958715a23","relation":"main_file","creator":"system","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:10:00Z","file_size":78315,"file_id":"4785"},{"checksum":"48133cecebfd839b77f84f557d530c00","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2017-725-v1+13_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Prinzipien_zu_offenen_bibliographischen_Daten.pdf","file_id":"4786","creator":"system","date_updated":"2020-07-14T12:45:38Z","file_size":90532,"date_created":"2018-12-12T10:10:01Z"},{"file_name":"IST-2017-725-v1+14_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Empfehlungen_zur_Öffnung_bibliothekarischer_Daten.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"a359224ddfdb178fed72b228dcfb699a","date_created":"2018-12-12T10:10:02Z","file_size":90771,"creator":"system","date_updated":"2020-07-14T12:45:38Z","file_id":"4787"},{"date_created":"2018-12-12T10:10:03Z","file_size":1830232,"date_updated":"2020-07-14T12:45:38Z","creator":"system","file_id":"4788","file_name":"IST-2017-725-v1+15_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Glossar.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"0d2dd31d537c7a495999149d00eaffbf"}],"has_accepted_license":"1","abstract":[{"lang":"ger","text":"Das Buch ist sowohl eine Einführung in die Themen Linked Data, Open Data und Open Linked Data als es auch den konkreten Bezug auf Bibliotheken behandelt. Hierzu werden konkrete Anwendungsprojekte beschrieben. Der Band wendet sich dabei sowohl an Personen aus der Bibliothekspraxis als auch an Personen aus dem Bibliotheksmanagement, die noch nicht mit dem Thema vertraut sind."}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"intvolume":"        50","file_date_updated":"2020-07-14T12:45:38Z","publication_status":"published","publication_identifier":{"issn":["2191-3587"],"isbn":[" 978-3-11-027634-3"],"eisbn":["9-783-1102-7873-6"]},"day":"13","author":[{"first_name":"Patrick","orcid":"0000-0002-6026-4409","full_name":"Danowski, Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","last_name":"Danowski"},{"first_name":"Adrian","full_name":"Pohl, Adrian","last_name":"Pohl"}],"title":"(Open) Linked Data in Bibliotheken","oa_version":"Published Version","volume":50,"date_created":"2018-12-11T11:56:53Z","status":"public","date_published":"2013-09-13T00:00:00Z","year":"2013","publist_id":"4621","ddc":["020"],"quality_controlled":"1","article_processing_charge":"No","alternative_title":["Bibliotheks- und Informationspraxis"],"doi":"10.1515/9783110278736","publisher":"De Gruyter","_id":"2306","date_updated":"2021-12-21T12:17:19Z","type":"book"},{"publication_status":"published","file_date_updated":"2020-07-14T12:45:38Z","has_accepted_license":"1","intvolume":"      8052","abstract":[{"text":"We define the model-measuring problem: given a model M and specification φ, what is the maximal distance ρ such that all models M′ within distance ρ from M satisfy (or violate) φ. The model measuring problem presupposes a distance function on models. We concentrate on automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification, and robustness problems that measure how much a model can be perturbed without violating the specification. We show that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved. We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for standard word and tree automata by the optimal-weight question for the weighted versions of these automata. We consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications.","lang":"eng"}],"volume":8052,"date_created":"2018-12-11T11:57:00Z","author":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","first_name":"Jan"}],"day":"01","title":"From model checking to model measuring","oa_version":"Submitted Version","citation":{"apa":"Henzinger, T. A., &#38; Otop, J. (2013). From model checking to model measuring. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">https://doi.org/10.1007/978-3-642-40184-8_20</a>","mla":"Henzinger, Thomas A., and Jan Otop. <i>From Model Checking to Model Measuring</i>. Vol. 8052, Springer, 2013, pp. 273–87, doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">10.1007/978-3-642-40184-8_20</a>.","ista":"Henzinger TA, Otop J. 2013. From model checking to model measuring. 8052, 273–287.","chicago":"Henzinger, Thomas A, and Jan Otop. “From Model Checking to Model Measuring.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">https://doi.org/10.1007/978-3-642-40184-8_20</a>.","ieee":"T. A. Henzinger and J. Otop, “From model checking to model measuring,” vol. 8052. Springer, pp. 273–287, 2013.","short":"T.A. Henzinger, J. Otop, 8052 (2013) 273–287.","ama":"Henzinger TA, Otop J. From model checking to model measuring. 2013;8052:273-287. doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">10.1007/978-3-642-40184-8_20</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"pubrep_id":"129","department":[{"_id":"ToHe"}],"file":[{"relation":"main_file","checksum":"4c04695c4bfdf2119cd4f5d1babc3e8a","file_name":"IST-2013-129-v1+1_concur.pdf","access_level":"open_access","content_type":"application/pdf","file_id":"5301","file_size":378587,"date_created":"2018-12-12T10:17:45Z","creator":"system","date_updated":"2020-07-14T12:45:38Z"}],"month":"08","quality_controlled":"1","page":"273 - 287","ddc":["005","000"],"date_updated":"2023-02-23T12:25:26Z","_id":"2327","type":"conference","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-40184-8_20","alternative_title":["LNCS"],"publisher":"Springer","conference":{"location":"Buenos Aires, Argentina","name":"CONCUR: Concurrency Theory","start_date":"2013-08-27","end_date":"2013-08-30"},"date_published":"2013-08-01T00:00:00Z","status":"public","publist_id":"4599","year":"2013","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5417"}]}},{"title":"Aspect-oriented linearizability proofs","oa_version":"Submitted Version","author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Ali","last_name":"Sezgin","full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Viktor","last_name":"Vafeiadis","full_name":"Vafeiadis, Viktor"}],"day":"01","scopus_import":1,"date_created":"2018-12-11T11:57:01Z","volume":8052,"intvolume":"      8052","abstract":[{"text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on identifying the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates.\r\nIn response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof.","lang":"eng"}],"has_accepted_license":"1","publication_status":"published","file_date_updated":"2020-07-14T12:45:39Z","month":"08","file":[{"file_name":"IST-2014-197-v1+1_main-queue-verification.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"bdbb520de91751fe0136309ad4ef67e4","date_created":"2018-12-12T10:08:58Z","file_size":337059,"date_updated":"2020-07-14T12:45:39Z","creator":"system","file_id":"4721"}],"department":[{"_id":"ToHe"}],"pubrep_id":"197","language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Henzinger, Thomas A., et al. <i>Aspect-Oriented Linearizability Proofs</i>. Vol. 8052, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 242–56, doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">10.1007/978-3-642-40184-8_18</a>.","apa":"Henzinger, T. A., Sezgin, A., &#38; Vafeiadis, V. (2013). Aspect-oriented linearizability proofs. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">https://doi.org/10.1007/978-3-642-40184-8_18</a>","chicago":"Henzinger, Thomas A, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” Lecture Notes in Computer Science. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">https://doi.org/10.1007/978-3-642-40184-8_18</a>.","ista":"Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability proofs. 8052, 242–256.","short":"T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.","ieee":"T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” vol. 8052. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 242–256, 2013.","ama":"Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. 2013;8052:242-256. doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">10.1007/978-3-642-40184-8_18</a>"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.1007/978-3-642-40184-8_18","alternative_title":["LNCS"],"type":"conference","series_title":"Lecture Notes in Computer Science","date_updated":"2023-02-23T10:16:27Z","_id":"2328","ddc":["000","004"],"page":"242 - 256","quality_controlled":"1","related_material":{"record":[{"id":"1832","status":"public","relation":"later_version"}]},"year":"2013","publist_id":"4598","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"status":"public","date_published":"2013-08-01T00:00:00Z","conference":{"end_date":"2013-08-30","start_date":"2013-08-27","name":"CONCUR: Concurrency Theory","location":"Buenos Aires, Argentina"},"ec_funded":1},{"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1210.3141"}],"page":"500 - 515","type":"conference","series_title":"Lecture Notes in Computer Science","date_updated":"2023-02-23T13:00:42Z","_id":"2329","publisher":"Springer","doi":"10.1007/978-3-642-40184-8_35","alternative_title":["LNCS"],"conference":{"start_date":"2013-08-27","end_date":"2013-08-30","name":"CONCUR: Concurrency Theory","location":"Buenos Aires, Argentinia"},"date_published":"2013-08-01T00:00:00Z","ec_funded":1,"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"status":"public","publist_id":"4597","external_id":{"arxiv":["1210.3141"]},"related_material":{"record":[{"status":"public","relation":"later_version","id":"717"}]},"year":"2013","publication_status":"published","intvolume":"      8052","abstract":[{"lang":"eng","text":"Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work, we consider both finite-state game graphs, and recursive game graphs (or pushdown game graphs) that model the control flow of sequential programs with recursion. The objectives we study are multidimensional mean-payoff objectives, where the goal of player 1 is to ensure that the mean-payoff is non-negative in all dimensions. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation. Our main contributions are as follows: (1) We show that finite-state multidimensional mean-payoff games can be solved in polynomial time if the number of dimensions and the maximal absolute value of the weights are fixed; whereas if the number of dimensions is arbitrary, then the problem is known to be coNP-complete. (2) We show that pushdown graphs with multidimensional mean-payoff objectives can be solved in polynomial time. For both (1) and (2) our algorithms are based on hyperplane separation technique. (3) For pushdown games under global strategies both one and multidimensional mean-payoff objectives problems are known to be undecidable, and we show that under modular strategies the multidimensional problem is also undecidable; under modular strategies the one-dimensional problem is NP-complete. We show that if the number of modules, the number of exits, and the maximal absolute value of the weights are fixed, then pushdown games under modular strategies with one-dimensional mean-payoff objectives can be solved in polynomial time, and if either the number of exits or the number of modules is unbounded, then the problem is NP-hard. (4) Finally we show that a fixed parameter tractable algorithm for finite-state multidimensional mean-payoff games or pushdown games under modular strategies with one-dimensional mean-payoff objectives would imply the fixed parameter tractability of parity games."}],"date_created":"2018-12-11T11:57:01Z","volume":8052,"title":"Hyperplane separation technique for multidimensional mean-payoff games","oa_version":"Preprint","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Velner","full_name":"Velner, Yaron","first_name":"Yaron"}],"scopus_import":1,"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, and Yaron Velner. <i>Hyperplane Separation Technique for Multidimensional Mean-Payoff Games</i>. Vol. 8052, Springer, 2013, pp. 500–15, doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_35\">10.1007/978-3-642-40184-8_35</a>.","apa":"Chatterjee, K., &#38; Velner, Y. (2013). Hyperplane separation technique for multidimensional mean-payoff games. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentinia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_35\">https://doi.org/10.1007/978-3-642-40184-8_35</a>","ista":"Chatterjee K, Velner Y. 2013. Hyperplane separation technique for multidimensional mean-payoff games. 8052, 500–515.","chicago":"Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_35\">https://doi.org/10.1007/978-3-642-40184-8_35</a>.","short":"K. Chatterjee, Y. Velner, 8052 (2013) 500–515.","ieee":"K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” vol. 8052. Springer, pp. 500–515, 2013.","ama":"Chatterjee K, Velner Y. Hyperplane separation technique for multidimensional mean-payoff games. 2013;8052:500-515. doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_35\">10.1007/978-3-642-40184-8_35</a>"},"language":[{"iso":"eng"}],"oa":1,"department":[{"_id":"KrCh"}],"month":"08","arxiv":1},{"publication_status":"published","file_date_updated":"2020-07-14T12:45:40Z","intvolume":"         1","abstract":[{"lang":"eng","text":"Here, we describe a novel virulent bacteriophage that infects Bacillus weihenstephanensis, isolated from soil in Austria. It is the first phage to be discovered that infects this species. Here, we present the complete genome sequence of this podovirus. "}],"has_accepted_license":"1","date_created":"2018-12-11T11:57:30Z","volume":1,"oa_version":"Published Version","title":"Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis","author":[{"orcid":"0000-0002-5837-2793","first_name":"Rodrigo A","full_name":"Fernandes Redondo, Rodrigo A","id":"409D5C96-F248-11E8-B48F-1D18A9856A87","last_name":"Fernandes Redondo"},{"first_name":"Anne","last_name":"Kupczok","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Kupczok, Anne"},{"first_name":"Gertraud","id":"2DB195CA-F248-11E8-B48F-1D18A9856A87","full_name":"Stift, Gertraud","last_name":"Stift"},{"first_name":"Jonathan P","orcid":"0000-0002-4624-4612","last_name":"Bollback","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","full_name":"Bollback, Jonathan P"}],"scopus_import":1,"day":"13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3","citation":{"ista":"Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. 2013. Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. 1(3).","chicago":"Fernandes Redondo, Rodrigo A, Anne Kupczok, Gertraud Stift, and Jonathan P Bollback. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus Weihenstephanensis.” <i>Genome Announcements</i>. American Society for Microbiology, 2013. <a href=\"https://doi.org/10.1128/genomeA.00216-13\">https://doi.org/10.1128/genomeA.00216-13</a>.","mla":"Fernandes Redondo, Rodrigo A., et al. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus Weihenstephanensis.” <i>Genome Announcements</i>, vol. 1, no. 3, American Society for Microbiology, 2013, doi:<a href=\"https://doi.org/10.1128/genomeA.00216-13\">10.1128/genomeA.00216-13</a>.","apa":"Fernandes Redondo, R. A., Kupczok, A., Stift, G., &#38; Bollback, J. P. (2013). Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. <i>Genome Announcements</i>. American Society for Microbiology. <a href=\"https://doi.org/10.1128/genomeA.00216-13\">https://doi.org/10.1128/genomeA.00216-13</a>","ama":"Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. <i>Genome Announcements</i>. 2013;1(3). doi:<a href=\"https://doi.org/10.1128/genomeA.00216-13\">10.1128/genomeA.00216-13</a>","short":"R.A. Fernandes Redondo, A. Kupczok, G. Stift, J.P. Bollback, Genome Announcements 1 (2013).","ieee":"R. A. Fernandes Redondo, A. Kupczok, G. Stift, and J. P. Bollback, “Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis,” <i>Genome Announcements</i>, vol. 1, no. 3. American Society for Microbiology, 2013."},"language":[{"iso":"eng"}],"pubrep_id":"398","oa":1,"file":[{"checksum":"0751ec74b695567e0cdf02aaf9c26829","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2015-398-v1+1_Genome_Announc.-2013-Redondo-.pdf","file_id":"5291","date_updated":"2020-07-14T12:45:40Z","creator":"system","date_created":"2018-12-12T10:17:36Z","file_size":130026}],"department":[{"_id":"JoBo"},{"_id":"LifeSc"}],"month":"06","quality_controlled":"1","ddc":["576"],"type":"journal_article","date_updated":"2021-01-12T06:57:19Z","_id":"2410","publisher":"American Society for Microbiology","doi":"10.1128/genomeA.00216-13","date_published":"2013-06-13T00:00:00Z","status":"public","publication":"Genome Announcements","publist_id":"4516","year":"2013"},{"has_accepted_license":"1","abstract":[{"lang":"eng","text":"Background: The CRISPR/Cas system is known to act as an adaptive and heritable immune system in Eubacteria and Archaea. Immunity is encoded in an array of spacer sequences. Each spacer can provide specific immunity to invasive elements that carry the same or a similar sequence. Even in closely related strains, spacer content is very dynamic and evolves quickly. Standard models of nucleotide evolutioncannot be applied to quantify its rate of change since processes other than single nucleotide changes determine its evolution.Methods We present probabilistic models that are specific for spacer content evolution. They account for the different processes of insertion and deletion. Insertions can be constrained to occur on one end only or are allowed to occur throughout the array. One deletion event can affect one spacer or a whole fragment of adjacent spacers. Parameters of the underlying models are estimated for a pair of arrays by maximum likelihood using explicit ancestor enumeration.Results Simulations show that parameters are well estimated on average under the models presented here. There is a bias in the rate estimation when including fragment deletions. The models also estimate times between pairs of strains. But with increasing time, spacer overlap goes to zero, and thus there is an upper bound on the distance that can be estimated. Spacer content similarities are displayed in a distance based phylogeny using the estimated times.We use the presented models to analyze different Yersinia pestis data sets and find that the results among them are largely congruent. The models also capture the variation in diversity of spacers among the data sets. A comparison of spacer-based phylogenies and Cas gene phylogenies shows that they resolve very different time scales for this data set.Conclusions The simulations and data analyses show that the presented models are useful for quantifying spacer content evolution and for displaying spacer content similarities of closely related strains in a phylogeny. This allows for comparisons of different CRISPR arrays or for comparisons between CRISPR arrays and nucleotide substitution rates."}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"intvolume":"        13","publication_status":"published","file_date_updated":"2020-07-14T12:45:40Z","author":[{"last_name":"Kupczok","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Kupczok, Anne","first_name":"Anne"},{"id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","full_name":"Bollback, Jonathan P","last_name":"Bollback","first_name":"Jonathan P","orcid":"0000-0002-4624-4612"}],"day":"26","scopus_import":1,"title":"Probabilistic models for CRISPR spacer content evolution ","oa_version":"Published Version","volume":13,"date_created":"2018-12-11T11:57:31Z","oa":1,"language":[{"iso":"eng"}],"pubrep_id":"397","issue":"1","citation":{"ieee":"A. Kupczok and J. P. Bollback, “Probabilistic models for CRISPR spacer content evolution ,” <i>BMC Evolutionary Biology</i>, vol. 13, no. 1. BioMed Central, pp. 54–54, 2013.","short":"A. Kupczok, J.P. Bollback, BMC Evolutionary Biology 13 (2013) 54–54.","ama":"Kupczok A, Bollback JP. Probabilistic models for CRISPR spacer content evolution . <i>BMC Evolutionary Biology</i>. 2013;13(1):54-54. doi:<a href=\"https://doi.org/10.1186/1471-2148-13-54\">10.1186/1471-2148-13-54</a>","apa":"Kupczok, A., &#38; Bollback, J. P. (2013). Probabilistic models for CRISPR spacer content evolution . <i>BMC Evolutionary Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2148-13-54\">https://doi.org/10.1186/1471-2148-13-54</a>","mla":"Kupczok, Anne, and Jonathan P. Bollback. “Probabilistic Models for CRISPR Spacer Content Evolution .” <i>BMC Evolutionary Biology</i>, vol. 13, no. 1, BioMed Central, 2013, pp. 54–54, doi:<a href=\"https://doi.org/10.1186/1471-2148-13-54\">10.1186/1471-2148-13-54</a>.","chicago":"Kupczok, Anne, and Jonathan P Bollback. “Probabilistic Models for CRISPR Spacer Content Evolution .” <i>BMC Evolutionary Biology</i>. BioMed Central, 2013. <a href=\"https://doi.org/10.1186/1471-2148-13-54\">https://doi.org/10.1186/1471-2148-13-54</a>.","ista":"Kupczok A, Bollback JP. 2013. Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. 13(1), 54–54."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"02","department":[{"_id":"JoBo"}],"file":[{"creator":"system","date_updated":"2020-07-14T12:45:40Z","file_size":518729,"date_created":"2018-12-12T10:17:15Z","file_id":"5268","content_type":"application/pdf","access_level":"open_access","file_name":"IST-2015-397-v1+1_1471-2148-13-54.pdf","checksum":"029c7e0b198c19312b66ecce3cabb22f","relation":"main_file"}],"page":"54 - 54","ddc":["576"],"quality_controlled":"1","doi":"10.1186/1471-2148-13-54","publisher":"BioMed Central","date_updated":"2021-01-12T06:57:20Z","_id":"2412","type":"journal_article","status":"public","publication":"BMC Evolutionary Biology","date_published":"2013-02-26T00:00:00Z","year":"2013","publist_id":"4514"}]