[{"date_updated":"2019-08-02T12:37:44Z","date_created":"2018-12-11T11:56:47Z","oa_version":"None","volume":8130,"_id":"2288","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","publication_status":"published","title":"Computational Methods in Systems Biology","status":"public","publisher":"Springer","editor":[{"first_name":"Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"intvolume":" 8130","department":[{"_id":"ToHe"}],"abstract":[{"text":"This book constitutes the proceedings of the 11th International Conference on Computational Methods in Systems Biology, CMSB 2013, held in Klosterneuburg, Austria, in September 2013. The 15 regular papers included in this volume were carefully reviewed and selected from 27 submissions. They deal with computational models for all levels, from molecular and cellular, to organs and entire organisms.","lang":"eng"}],"publist_id":"4643","type":"conference_editor","alternative_title":["LNCS"],"conference":{"location":"Klosterneuburg, Austria","start_date":"2013-09-22","end_date":"2013-09-24","name":"CMSB: Computational Methods in Systems Biology"},"doi":"10.1007/978-3-642-40708-6","date_published":"2013-07-01T00:00:00Z","language":[{"iso":"eng"}],"citation":{"ama":"Gupta A, Henzinger TA, eds. Computational Methods in Systems Biology. Vol 8130. Springer; 2013. doi:10.1007/978-3-642-40708-6","ista":"Gupta A, Henzinger TA eds. 2013. Computational Methods in Systems Biology, Springer,p.","apa":"Gupta, A., & Henzinger, T. A. (Eds.). (2013). Computational Methods in Systems Biology (Vol. 8130). Presented at the CMSB: Computational Methods in Systems Biology, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40708-6","ieee":"A. Gupta and T. A. Henzinger, Eds., Computational Methods in Systems Biology, vol. 8130. Springer, 2013.","mla":"Gupta, Ashutosh, and Thomas A. Henzinger, editors. Computational Methods in Systems Biology. Vol. 8130, Springer, 2013, doi:10.1007/978-3-642-40708-6.","short":"A. Gupta, T.A. Henzinger, eds., Computational Methods in Systems Biology, Springer, 2013.","chicago":"Gupta, Ashutosh, and Thomas A Henzinger, eds. Computational Methods in Systems Biology. Vol. 8130. Springer, 2013. https://doi.org/10.1007/978-3-642-40708-6."},"quality_controlled":"1","month":"07","day":"01","publication_identifier":{"isbn":["978-3-642-40707-9"]}},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2298","ddc":["000","004"],"title":"Local shape analysis for overlaid data structures","status":"public","intvolume":" 7935","pubrep_id":"196","file":[{"relation":"main_file","file_id":"4824","date_created":"2018-12-12T10:10:36Z","date_updated":"2020-07-14T12:45:37Z","checksum":"907edd33a5892e3af093365f1fd57ed7","file_name":"IST-2014-196-v1+1_sas13.pdf","access_level":"open_access","content_type":"application/pdf","file_size":299004,"creator":"system"}],"oa_version":"Submitted Version","type":"conference","alternative_title":["LNCS"],"abstract":[{"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","lang":"eng"}],"citation":{"short":"C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2013, pp. 150–171.","mla":"Dragoi, Cezara, et al. Local Shape Analysis for Overlaid Data Structures. Vol. 7935, Springer, 2013, pp. 150–71, doi:10.1007/978-3-642-38856-9_10.","chicago":"Dragoi, Cezara, Constantin Enea, and Mihaela Sighireanu. “Local Shape Analysis for Overlaid Data Structures,” 7935:150–71. Springer, 2013. https://doi.org/10.1007/978-3-642-38856-9_10.","ama":"Dragoi C, Enea C, Sighireanu M. Local shape analysis for overlaid data structures. In: Vol 7935. Springer; 2013:150-171. doi:10.1007/978-3-642-38856-9_10","apa":"Dragoi, C., Enea, C., & 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. https://doi.org/10.1007/978-3-642-38856-9_10","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.","ista":"Dragoi C, Enea C, Sighireanu M. 2013. Local shape analysis for overlaid data structures. SAS: Static Analysis Symposium, LNCS, vol. 7935, 150–171."},"page":"150 - 171","date_published":"2013-01-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1","year":"2013","publication_status":"published","publisher":"Springer","department":[{"_id":"ToHe"}],"author":[{"full_name":"Dragoi, Cezara","last_name":"Dragoi","first_name":"Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Enea","first_name":"Constantin","full_name":"Enea, Constantin"},{"full_name":"Sighireanu, Mihaela","last_name":"Sighireanu","first_name":"Mihaela"}],"date_created":"2018-12-11T11:56:50Z","date_updated":"2021-01-12T06:56:36Z","volume":7935,"file_date_updated":"2020-07-14T12:45:37Z","ec_funded":1,"publist_id":"4630","oa":1,"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"conference":{"name":"SAS: Static Analysis Symposium","end_date":"2013-06-22","location":"Seattle, WA, United States","start_date":"2013-06-20"},"doi":"10.1007/978-3-642-38856-9_10","language":[{"iso":"eng"}],"month":"01"},{"publist_id":"4629","file_date_updated":"2020-07-14T12:45:37Z","volume":15,"date_updated":"2021-01-12T06:56:37Z","date_created":"2018-12-11T11:56:51Z","author":[{"full_name":"Godhal, Yashdeep","id":"5B547124-EB61-11E9-8887-89D9C04DBDF5","last_name":"Godhal","first_name":"Yashdeep"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","year":"2013","month":"10","language":[{"iso":"eng"}],"doi":"10.1007/s10009-011-0207-9","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"issue":"5-6","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."}],"type":"journal_article","oa_version":"Submitted Version","file":[{"content_type":"application/pdf","file_size":277372,"creator":"system","file_name":"IST-2012-87-v1+1_Synthesis_of_AMBA_AHB_from_formal_specifications-_A_case_study.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:37Z","date_created":"2018-12-12T10:11:53Z","checksum":"57b06a732dd8d6349190dba6b5b0d33b","relation":"main_file","file_id":"4910"}],"pubrep_id":"87","intvolume":" 15","ddc":["000"],"title":"Synthesis of AMBA AHB from formal specification: A case study","status":"public","_id":"2299","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2013-10-01T00:00:00Z","page":"585 - 601","citation":{"mla":"Godhal, Yashdeep, et al. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6, Springer, 2013, pp. 585–601, doi:10.1007/s10009-011-0207-9.","short":"Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601.","chicago":"Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer. Springer, 2013. https://doi.org/10.1007/s10009-011-0207-9.","ama":"Godhal Y, Chatterjee K, Henzinger TA. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 2013;15(5-6):585-601. doi:10.1007/s10009-011-0207-9","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.","apa":"Godhal, Y., Chatterjee, K., & Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. Springer. https://doi.org/10.1007/s10009-011-0207-9","ieee":"Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6. Springer, pp. 585–601, 2013."},"publication":"International Journal on Software Tools for Technology Transfer"},{"oa_version":"Preprint","status":"public","title":"Hot topics in cold gases: A mathematical physics perspective","intvolume":" 8","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2297","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"}],"issue":"2","type":"journal_article","date_published":"2013-09-24T00:00:00Z","page":"185 - 232","publication":"Japanese Journal of Mathematics","citation":{"ista":"Seiringer R. 2013. Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. 8(2), 185–232.","ieee":"R. Seiringer, “Hot topics in cold gases: A mathematical physics perspective,” Japanese Journal of Mathematics, vol. 8, no. 2. Springer, pp. 185–232, 2013.","apa":"Seiringer, R. (2013). Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. Springer. https://doi.org/10.1007/s11537-013-1264-5","ama":"Seiringer R. Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. 2013;8(2):185-232. doi:10.1007/s11537-013-1264-5","chicago":"Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.” Japanese Journal of Mathematics. Springer, 2013. https://doi.org/10.1007/s11537-013-1264-5.","mla":"Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.” Japanese Journal of Mathematics, vol. 8, no. 2, Springer, 2013, pp. 185–232, doi:10.1007/s11537-013-1264-5.","short":"R. Seiringer, Japanese Journal of Mathematics 8 (2013) 185–232."},"day":"24","scopus_import":1,"date_updated":"2021-01-12T06:56:36Z","date_created":"2018-12-11T11:56:50Z","volume":8,"author":[{"orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert","full_name":"Seiringer, Robert"}],"publication_status":"published","publisher":"Springer","department":[{"_id":"RoSe"}],"year":"2013","publist_id":"4631","language":[{"iso":"eng"}],"doi":"10.1007/s11537-013-1264-5","quality_controlled":"1","oa":1,"external_id":{"arxiv":["0908.3686"]},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/0908.3686"}],"month":"09"},{"date_published":"2013-09-13T00:00:00Z","citation":{"short":"P. Danowski, A. Pohl, (Open) Linked Data in Bibliotheken, De Gruyter, 2013.","mla":"Danowski, Patrick, and Adrian Pohl. (Open) Linked Data in Bibliotheken. Vol. 50, De Gruyter, 2013, doi:10.1515/9783110278736.","chicago":"Danowski, Patrick, and Adrian Pohl. (Open) Linked Data in Bibliotheken. Vol. 50. De Gruyter, 2013. https://doi.org/10.1515/9783110278736.","ama":"Danowski P, Pohl A. (Open) Linked Data in Bibliotheken. Vol 50. De Gruyter; 2013. doi:10.1515/9783110278736","apa":"Danowski, P., & Pohl, A. (2013). (Open) Linked Data in Bibliotheken (Vol. 50). De Gruyter. https://doi.org/10.1515/9783110278736","ieee":"P. Danowski and A. Pohl, (Open) Linked Data in Bibliotheken, vol. 50. De Gruyter, 2013.","ista":"Danowski P, Pohl A. 2013. (Open) Linked Data in Bibliotheken, De Gruyter,p."},"has_accepted_license":"1","article_processing_charge":"No","day":"13","pubrep_id":"725","oa_version":"Published Version","file":[{"file_name":"IST-2017-725-v1+1_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Frontmatter.pdf","access_level":"open_access","creator":"system","file_size":67731,"content_type":"application/pdf","file_id":"4774","relation":"main_file","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:49Z","checksum":"807a408bbee519d792702828a32c6e85"},{"content_type":"application/pdf","file_size":43563,"creator":"system","file_name":"IST-2017-725-v1+2_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Inhalt.pdf","access_level":"open_access","date_created":"2018-12-12T10:09:50Z","date_updated":"2020-07-14T12:45:38Z","checksum":"587e95c2ba24307a5a5d5bd1579429d9","relation":"main_file","file_id":"4775"},{"relation":"main_file","file_id":"4776","date_created":"2018-12-12T10:09:51Z","date_updated":"2020-07-14T12:45:38Z","checksum":"dbcada36bb32d725d9838615706e700f","file_name":"IST-2017-725-v1+3_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_in_der_Bibliothekswelt__Grundlagen_und_Überblick.pdf","access_level":"open_access","file_size":11318599,"content_type":"application/pdf","creator":"system"},{"date_created":"2018-12-12T10:09:52Z","date_updated":"2020-07-14T12:45:38Z","checksum":"5235712bf0a49ccc8c2cb4f6c2560d43","relation":"main_file","file_id":"4777","content_type":"application/pdf","file_size":330210,"creator":"system","file_name":"IST-2017-725-v1+4_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Vokabulare_für_bibliographische_Daten.pdf","access_level":"open_access"},{"creator":"system","content_type":"application/pdf","file_size":10652088,"access_level":"open_access","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","checksum":"d851cc91f705da80617ac7df33c1c0e1","date_created":"2018-12-12T10:09:53Z","date_updated":"2020-07-14T12:45:38Z","file_id":"4778","relation":"main_file"},{"file_size":6125273,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2017-725-v1+6_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Die_Provenienz_von_Linked_Data.pdf","checksum":"4e77b182692c58e50fc5251bf23cc584","date_created":"2018-12-12T10:09:54Z","date_updated":"2020-07-14T12:45:38Z","relation":"main_file","file_id":"4779"},{"creator":"system","content_type":"application/pdf","file_size":1893872,"file_name":"IST-2017-725-v1+7_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Forschungsdaten.pdf","access_level":"open_access","date_created":"2018-12-12T10:09:55Z","date_updated":"2020-07-14T12:45:38Z","checksum":"3debae38064d5099d22f855c353a57ec","file_id":"4780","relation":"main_file"},{"access_level":"open_access","file_name":"IST-2017-725-v1+8_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Datenanreicherung_auf_LOD-Basis.pdf","content_type":"application/pdf","file_size":1095929,"creator":"system","relation":"main_file","file_id":"4781","checksum":"e630b330dc0b7522d2cf204587030252","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:56Z"},{"access_level":"open_access","file_name":"IST-2017-725-v1+9_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Herausforderung_Wissensvernetzung.pdf","creator":"system","content_type":"application/pdf","file_size":149699,"file_id":"4782","relation":"main_file","checksum":"17edda91271bfcce8e1b6e77ca1c9d11","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:57Z"},{"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","access_level":"open_access","file_size":8828405,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"4783","date_created":"2018-12-12T10:09:58Z","date_updated":"2020-07-14T12:45:38Z","checksum":"aacef6734b1de58aeb58024fc47c2373"},{"checksum":"0619451f7ff3ea641ce0b10c97831f47","date_created":"2018-12-12T10:09:59Z","date_updated":"2020-07-14T12:45:38Z","relation":"main_file","file_id":"4784","file_size":3191208,"content_type":"application/pdf","creator":"system","access_level":"open_access","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"},{"date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:10:00Z","checksum":"44dc8a9fc003f0edd912968958715a23","file_id":"4785","relation":"main_file","creator":"system","file_size":78315,"content_type":"application/pdf","file_name":"IST-2017-725-v1+12_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Definition__Offenes_Wissen.pdf","access_level":"open_access"},{"file_name":"IST-2017-725-v1+13_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Prinzipien_zu_offenen_bibliographischen_Daten.pdf","access_level":"open_access","file_size":90532,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"4786","date_created":"2018-12-12T10:10:01Z","date_updated":"2020-07-14T12:45:38Z","checksum":"48133cecebfd839b77f84f557d530c00"},{"file_size":90771,"content_type":"application/pdf","creator":"system","file_name":"IST-2017-725-v1+14_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Empfehlungen_zur_Öffnung_bibliothekarischer_Daten.pdf","access_level":"open_access","date_created":"2018-12-12T10:10:02Z","date_updated":"2020-07-14T12:45:38Z","checksum":"a359224ddfdb178fed72b228dcfb699a","relation":"main_file","file_id":"4787"},{"file_id":"4788","relation":"main_file","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:10:03Z","checksum":"0d2dd31d537c7a495999149d00eaffbf","file_name":"IST-2017-725-v1+15_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Glossar.pdf","access_level":"open_access","creator":"system","file_size":1830232,"content_type":"application/pdf"}],"_id":"2306","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":" 50","title":"(Open) Linked Data in Bibliotheken","ddc":["020"],"status":"public","abstract":[{"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.","lang":"ger"}],"type":"book","alternative_title":["Bibliotheks- und Informationspraxis"],"doi":"10.1515/9783110278736","language":[{"iso":"ger"}],"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","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","publication_identifier":{"eisbn":["9-783-1102-7873-6"],"issn":["2191-3587"],"isbn":[" 978-3-11-027634-3"]},"month":"09","author":[{"full_name":"Danowski, Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409","first_name":"Patrick","last_name":"Danowski"},{"first_name":"Adrian","last_name":"Pohl","full_name":"Pohl, Adrian"}],"volume":50,"date_created":"2018-12-11T11:56:53Z","date_updated":"2021-12-21T12:17:19Z","year":"2013","publisher":"De Gruyter","department":[{"_id":"E-Lib"}],"publication_status":"published","publist_id":"4621","file_date_updated":"2020-07-14T12:45:38Z"},{"citation":{"chicago":"Desai, Ankush, Vivek Gupta, Ethan Jackson, Shaz Qadeer, Sriram Rajamani, and Damien Zufferey. “P: Safe Asynchronous Event-Driven Programming.” In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, 321–31. ACM, 2013. https://doi.org/10.1145/2491956.2462184.","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.","mla":"Desai, Ankush, et al. “P: Safe Asynchronous Event-Driven Programming.” Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–31, doi:10.1145/2491956.2462184.","ieee":"A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, and D. Zufferey, “P: Safe asynchronous event-driven programming,” in Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, Seattle, WA, United States, 2013, pp. 321–331.","apa":"Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S., & Zufferey, D. (2013). P: Safe asynchronous event-driven programming. In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 321–331). Seattle, WA, United States: ACM. https://doi.org/10.1145/2491956.2462184","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.","ama":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. P: Safe asynchronous event-driven programming. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM; 2013:321-331. doi:10.1145/2491956.2462184"},"main_file_link":[{"url":"http://research.microsoft.com/pubs/191069/pldi212_desai.pdf"}],"publication":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"page":"321 - 331","quality_controlled":"1","date_published":"2013-06-01T00:00:00Z","doi":"10.1145/2491956.2462184","conference":{"end_date":"2013-06-19","location":"Seattle, WA, United States","start_date":"2013-06-16","name":"PLDI: Programming Languages Design and Implementation"},"language":[{"iso":"eng"}],"scopus_import":1,"day":"01","month":"06","_id":"2301","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","department":[{"_id":"ToHe"}],"publisher":"ACM","publication_status":"published","title":"P: Safe asynchronous event-driven programming","status":"public","author":[{"full_name":"Desai, Ankush","first_name":"Ankush","last_name":"Desai"},{"full_name":"Gupta, Vivek","last_name":"Gupta","first_name":"Vivek"},{"last_name":"Jackson","first_name":"Ethan","full_name":"Jackson, Ethan"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"},{"first_name":"Sriram","last_name":"Rajamani","full_name":"Rajamani, Sriram"},{"full_name":"Zufferey, Damien","first_name":"Damien","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736"}],"oa_version":"None","date_created":"2018-12-11T11:56:52Z","date_updated":"2021-01-12T06:56:38Z","type":"conference","ec_funded":1,"publist_id":"4626","abstract":[{"lang":"eng","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 "close" 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."}]},{"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1305.5323","open_access":"1"}],"external_id":{"arxiv":["1305.5323"]},"quality_controlled":"1","doi":"10.1103/PhysRevB.88.064401","language":[{"iso":"eng"}],"month":"08","year":"2013","publication_status":"published","department":[{"_id":"RoSe"}],"publisher":"American Physical Society","author":[{"full_name":"Giuliani, Alessandro","first_name":"Alessandro","last_name":"Giuliani"},{"full_name":"Lieb, Élliott","first_name":"Élliott","last_name":"Lieb"},{"full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521"}],"date_created":"2018-12-11T11:56:51Z","date_updated":"2021-01-12T06:56:38Z","volume":88,"article_number":"064401","publist_id":"4627","publication":"Physical Review B","citation":{"mla":"Giuliani, Alessandro, et al. “Realization of Stripes and Slabs in Two and Three Dimensions.” Physical Review B, vol. 88, no. 6, 064401, American Physical Society, 2013, doi:10.1103/PhysRevB.88.064401.","short":"A. Giuliani, É. Lieb, R. Seiringer, Physical Review B 88 (2013).","chicago":"Giuliani, Alessandro, Élliott Lieb, and Robert Seiringer. “Realization of Stripes and Slabs in Two and Three Dimensions.” Physical Review B. American Physical Society, 2013. https://doi.org/10.1103/PhysRevB.88.064401.","ama":"Giuliani A, Lieb É, Seiringer R. Realization of stripes and slabs in two and three dimensions. Physical Review B. 2013;88(6). doi:10.1103/PhysRevB.88.064401","ista":"Giuliani A, Lieb É, Seiringer R. 2013. Realization of stripes and slabs in two and three dimensions. Physical Review B. 88(6), 064401.","apa":"Giuliani, A., Lieb, É., & Seiringer, R. (2013). Realization of stripes and slabs in two and three dimensions. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.88.064401","ieee":"A. Giuliani, É. Lieb, and R. Seiringer, “Realization of stripes and slabs in two and three dimensions,” Physical Review B, vol. 88, no. 6. American Physical Society, 2013."},"date_published":"2013-08-01T00:00:00Z","scopus_import":1,"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2300","status":"public","title":"Realization of stripes and slabs in two and three dimensions","intvolume":" 88","oa_version":"Preprint","type":"journal_article","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"}],"issue":"6"},{"scopus_import":1,"month":"09","day":"03","page":"557 - 568","quality_controlled":"1","article_type":"review","citation":{"chicago":"Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic Analysis with Double Markers.” Frontiers in Biology. Springer, 2013. https://doi.org/10.1007/s11515-013-1279-6.","mla":"Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic Analysis with Double Markers.” Frontiers in Biology, vol. 8, no. 6, Springer, 2013, pp. 557–68, doi:10.1007/s11515-013-1279-6.","short":"S. Hippenmeyer, Frontiers in Biology 8 (2013) 557–568.","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. Frontiers in Biology. Springer. https://doi.org/10.1007/s11515-013-1279-6","ieee":"S. Hippenmeyer, “Dissection of gene function at clonal level using mosaic analysis with double markers,” Frontiers in Biology, vol. 8, no. 6. Springer, pp. 557–568, 2013.","ama":"Hippenmeyer S. Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. 2013;8(6):557-568. doi:10.1007/s11515-013-1279-6"},"publication":"Frontiers in Biology","language":[{"iso":"eng"}],"doi":"10.1007/s11515-013-1279-6","date_published":"2013-09-03T00:00:00Z","type":"journal_article","issue":"6","publist_id":"4624","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","publisher":"Springer","department":[{"_id":"SiHi"}],"publication_status":"published","title":"Dissection of gene function at clonal level using mosaic analysis with double markers","status":"public","year":"2013","_id":"2303","acknowledgement":"This work was supported by IST Austria institutional funds.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"None","volume":8,"date_created":"2018-12-11T11:56:52Z","date_updated":"2021-01-12T06:56:39Z","author":[{"full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","first_name":"Simon"}]},{"scopus_import":1,"month":"09","day":"05","citation":{"mla":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” Electronic Notes in Discrete Mathematics, vol. 43, Elsevier, 2013, pp. 43–50, doi:10.1016/j.endm.2013.07.008.","short":"F. Pausinger, Electronic Notes in Discrete Mathematics 43 (2013) 43–50.","chicago":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” Electronic Notes in Discrete Mathematics. Elsevier, 2013. https://doi.org/10.1016/j.endm.2013.07.008.","ama":"Pausinger F. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 2013;43:43-50. doi:10.1016/j.endm.2013.07.008","ista":"Pausinger F. 2013. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 43, 43–50.","ieee":"F. Pausinger, “Van der Corput sequences and linear permutations,” Electronic Notes in Discrete Mathematics, vol. 43. Elsevier, pp. 43–50, 2013.","apa":"Pausinger, F. (2013). Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.endm.2013.07.008"},"publication":"Electronic Notes in Discrete Mathematics","page":"43 - 50","quality_controlled":"1","date_published":"2013-09-05T00:00:00Z","doi":"10.1016/j.endm.2013.07.008","language":[{"iso":"eng"}],"type":"journal_article","publist_id":"4623","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"}],"_id":"2304","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","acknowledgement":"This research is supported by the Graduate school of IST Austria (Institute of Science and Technology Austria).","intvolume":" 43","department":[{"_id":"HeEd"}],"publisher":"Elsevier","title":"Van der Corput sequences and linear permutations","publication_status":"published","status":"public","author":[{"last_name":"Pausinger","first_name":"Florian","orcid":"0000-0002-8379-3768","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","full_name":"Pausinger, Florian"}],"oa_version":"None","volume":43,"date_updated":"2021-01-12T06:56:39Z","date_created":"2018-12-11T11:56:53Z"},{"article_processing_charge":"No","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1209.4046"}],"external_id":{"arxiv":["1209.4046"]},"citation":{"chicago":"Seiringer, Robert, Jakob Yngvason, and Valentin Zagrebnov. “Disordered Bose-Einstein Condensates with Interaction,” 610–19. World Scientific Publishing, 2013. https://doi.org/10.1142/9789814449243_0063.","short":"R. Seiringer, J. Yngvason, V. Zagrebnov, in:, World Scientific Publishing, 2013, pp. 610–619.","mla":"Seiringer, Robert, et al. Disordered Bose-Einstein Condensates with Interaction. World Scientific Publishing, 2013, pp. 610–19, doi:10.1142/9789814449243_0063.","ieee":"R. Seiringer, J. Yngvason, and V. Zagrebnov, “Disordered Bose-Einstein condensates with interaction,” presented at the ICMP: International Congress on Mathematical Physics, 2013, pp. 610–619.","apa":"Seiringer, R., Yngvason, J., & Zagrebnov, V. (2013). Disordered Bose-Einstein condensates with interaction (pp. 610–619). Presented at the ICMP: International Congress on Mathematical Physics, World Scientific Publishing. https://doi.org/10.1142/9789814449243_0063","ista":"Seiringer R, Yngvason J, Zagrebnov V. 2013. Disordered Bose-Einstein condensates with interaction. ICMP: International Congress on Mathematical Physics, 610–619.","ama":"Seiringer R, Yngvason J, Zagrebnov V. Disordered Bose-Einstein condensates with interaction. In: World Scientific Publishing; 2013:610-619. doi:10.1142/9789814449243_0063"},"page":"610-619","doi":"10.1142/9789814449243_0063","date_published":"2013-01-01T00:00:00Z","conference":{"name":"ICMP: International Congress on Mathematical Physics"},"language":[{"iso":"eng"}],"type":"conference","publist_id":"4612","abstract":[{"lang":"eng","text":" We study the effects of random scatterers on the ground state of the one-dimensional Lieb-Liniger model of interacting bosons on the unit interval in the Gross-Pitaevskii regime. We prove that Bose Einstein condensation survives even a strong random potential with a high density of scatterers. The character of the wave function of the condensate, however, depends in an essential way on the interplay between randomness and the strength of the two-body interaction. For low density of scatterers or strong interactions the wave function extends over the whole interval. High density of scatterers and weak interaction, on the other hand, leads to localization of the wave function in a fragmented subset of the interval. "}],"extern":"1","_id":"2315","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"World Scientific Publishing","title":"Disordered Bose-Einstein condensates with interaction","status":"public","publication_status":"published","author":[{"first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"},{"full_name":"Yngvason, Jakob","last_name":"Yngvason","first_name":"Jakob"},{"full_name":"Zagrebnov, Valentin","first_name":"Valentin","last_name":"Zagrebnov"}],"oa_version":"None","date_updated":"2021-01-12T06:56:43Z","date_created":"2018-12-11T11:56:57Z"}]