[{"oa_version":"Preprint","date_updated":"2023-04-25T06:51:21Z","date_created":"2023-04-18T19:16:06Z","author":[{"full_name":"Chern, Albert","first_name":"Albert","last_name":"Chern"},{"full_name":"Ishida, Sadashige","first_name":"Sadashige","last_name":"Ishida","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425"}],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"publication_status":"submitted","status":"public","title":"Area formula for spherical polygons via prequantization","year":"2023","_id":"12846","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The authors acknowledge Chris Wojtan for his continuous support to the present work through discussions and advice. The second author thanks Anna Sisak for a fruitful discussion on prequantum bundles. This project was funded in part by the European Research Council (ERC Consolidator Grant 101045083 CoDiNA).","abstract":[{"text":"We present a formula for the signed area of a spherical polygon via prequantization. In contrast to the traditional formula based on the Gauss-Bonnet theorem that requires measuring angles, the new formula mimics Green's theorem and is applicable to a wider range of degenerate spherical curves and polygons.","lang":"eng"}],"type":"preprint","article_number":"2303.14555","language":[{"iso":"eng"}],"doi":"10.48550/arXiv.2303.14555","date_published":"2023-03-25T00:00:00Z","project":[{"grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena"}],"citation":{"chicago":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2303.14555.","mla":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” ArXiv, 2303.14555, doi:10.48550/arXiv.2303.14555.","short":"A. Chern, S. Ishida, ArXiv (n.d.).","ista":"Chern A, Ishida S. Area formula for spherical polygons via prequantization. arXiv, 2303.14555.","ieee":"A. Chern and S. Ishida, “Area formula for spherical polygons via prequantization,” arXiv. .","apa":"Chern, A., & Ishida, S. (n.d.). Area formula for spherical polygons via prequantization. arXiv. https://doi.org/10.48550/arXiv.2303.14555","ama":"Chern A, Ishida S. Area formula for spherical polygons via prequantization. arXiv. doi:10.48550/arXiv.2303.14555"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2303.14555"}],"oa":1,"external_id":{"arxiv":["2303.14555"]},"publication":"arXiv","article_processing_charge":"No","month":"03","day":"25"},{"date_published":"2023-04-20T00:00:00Z","page":"260-281","publication":"Fundamental Approaches to Software Engineering","citation":{"mla":"Chalupa, Marek, et al. “Vamos: Middleware for Best-Effort Third-Party Monitoring.” Fundamental Approaches to Software Engineering, vol. 13991, Springer Nature, 2023, pp. 260–81, doi:10.1007/978-3-031-30826-0_15.","short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, in:, Fundamental Approaches to Software Engineering, Springer Nature, 2023, pp. 260–281.","chicago":"Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. “Vamos: Middleware for Best-Effort Third-Party Monitoring.” In Fundamental Approaches to Software Engineering, 13991:260–81. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30826-0_15.","ama":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. Vamos: Middleware for best-effort third-party monitoring. In: Fundamental Approaches to Software Engineering. Vol 13991. Springer Nature; 2023:260-281. doi:10.1007/978-3-031-30826-0_15","ista":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. Vamos: Middleware for best-effort third-party monitoring. Fundamental Approaches to Software Engineering. FASE: Fundamental Approaches to Software Engineering, LNCS, vol. 13991, 260–281.","apa":"Chalupa, M., Mühlböck, F., Muroya Lei, S., & Henzinger, T. A. (2023). Vamos: Middleware for best-effort third-party monitoring. In Fundamental Approaches to Software Engineering (Vol. 13991, pp. 260–281). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30826-0_15","ieee":"M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, “Vamos: Middleware for best-effort third-party monitoring,” in Fundamental Approaches to Software Engineering, Paris, France, 2023, vol. 13991, pp. 260–281."},"day":"20","has_accepted_license":"1","article_processing_charge":"No","file":[{"access_level":"open_access","file_name":"2023_LNCS_ChalupaM.pdf","creator":"dernst","file_size":580828,"content_type":"application/pdf","file_id":"12865","relation":"main_file","success":1,"checksum":"17a7c8e08be609cf2408d37ea55e322c","date_updated":"2023-04-25T07:16:36Z","date_created":"2023-04-25T07:16:36Z"}],"oa_version":"Published Version","title":"Vamos: Middleware for best-effort third-party monitoring","ddc":["000"],"status":"public","intvolume":" 13991","_id":"12856","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both.\r\n\r\nWe present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\nWe implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch."}],"alternative_title":["LNCS"],"type":"conference","language":[{"iso":"eng"}],"conference":{"name":"FASE: Fundamental Approaches to Software Engineering","end_date":"2023-04-27","location":"Paris, France","start_date":"2023-04-22"},"doi":"10.1007/978-3-031-30826-0_15","quality_controlled":"1","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"oa":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","short":"CC BY (4.0)","image":"/images/cc_by.png"},"month":"04","publication_identifier":{"issn":["0302-9743"],"eisbn":["9783031308260"],"eissn":["1611-3349"],"isbn":["9783031308253"]},"date_updated":"2023-04-25T07:19:07Z","date_created":"2023-04-20T08:29:42Z","volume":13991,"author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"full_name":"Mühlböck, Fabian","first_name":"Fabian","last_name":"Mühlböck","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","orcid":"0000-0003-1548-0177"},{"full_name":"Muroya Lei, Stefanie","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","first_name":"Stefanie","last_name":"Muroya Lei"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"12407"}]},"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","year":"2023","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. The authors would like to thank the anonymous FASE reviewers for their valuable feedback and suggestions.","license":"https://creativecommons.org/licenses/by/4.0/","file_date_updated":"2023-04-25T07:16:36Z","ec_funded":1},{"author":[{"first_name":"Marek","last_name":"Chalupa","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","full_name":"Chalupa, Marek"},{"last_name":"Mühlböck","first_name":"Fabian","orcid":"0000-0003-1548-0177","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","full_name":"Mühlböck, Fabian"},{"full_name":"Muroya Lei, Stefanie","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","last_name":"Muroya Lei","first_name":"Stefanie"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"related_material":{"record":[{"id":"12856","relation":"later_version","status":"public"}]},"date_updated":"2023-04-25T07:19:06Z","date_created":"2023-01-27T03:18:08Z","year":"2023","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. \r\nThe authors would like to thank the anonymous FASE reviewers for their valuable feedback and suggestions.","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"ToHe"}],"file_date_updated":"2023-01-27T03:18:34Z","ec_funded":1,"doi":"10.15479/AT:ISTA:12407","language":[{"iso":"eng"}],"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,"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"month":"01","publication_identifier":{"eissn":["2664-1690"]},"oa_version":"Published Version","file":[{"creator":"fmuehlbo","content_type":"application/pdf","file_size":662409,"file_name":"main.pdf","access_level":"open_access","date_created":"2023-01-27T03:18:34Z","date_updated":"2023-01-27T03:18:34Z","success":1,"checksum":"55426e463fdeafe9777fc3ff635154c7","file_id":"12408","relation":"main_file"}],"_id":"12407","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"VAMOS: Middleware for Best-Effort Third-Party Monitoring","status":"public","ddc":["005"],"abstract":[{"text":"As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both.\r\n\r\nWe present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\n\r\nWe implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch.","lang":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"date_published":"2023-01-27T00:00:00Z","citation":{"apa":"Chalupa, M., Mühlböck, F., Muroya Lei, S., & Henzinger, T. A. (2023). VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:12407","ieee":"M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria, 2023.","ista":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 38p.","ama":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria; 2023. doi:10.15479/AT:ISTA:12407","chicago":"Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:12407.","short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 2023.","mla":"Chalupa, Marek, et al. VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:12407."},"page":"38","day":"27","article_processing_charge":"No","has_accepted_license":"1","keyword":["runtime monitoring","best effort","third party"]},{"pmid":1,"year":"2023","publisher":"Springer Nature","department":[{"_id":"XiFe"}],"publication_status":"published","author":[{"first_name":"Long","last_name":"Zhao","full_name":"Zhao, Long"},{"last_name":"Yang","first_name":"Yiman","full_name":"Yang, Yiman"},{"full_name":"Chen, Jinchao","first_name":"Jinchao","last_name":"Chen"},{"last_name":"Lin","first_name":"Xuelei","full_name":"Lin, Xuelei"},{"first_name":"Hao","last_name":"Zhang","full_name":"Zhang, Hao"},{"full_name":"Wang, Hao","last_name":"Wang","first_name":"Hao"},{"full_name":"Wang, Hongzhe","first_name":"Hongzhe","last_name":"Wang"},{"full_name":"Bie, Xiaomin","first_name":"Xiaomin","last_name":"Bie"},{"first_name":"Jiafu","last_name":"Jiang","full_name":"Jiang, Jiafu"},{"id":"e0164712-22ee-11ed-b12a-d80fcdf35958","orcid":"0000-0002-4008-1234","first_name":"Xiaoqi","last_name":"Feng","full_name":"Feng, Xiaoqi"},{"full_name":"Fu, Xiangdong","last_name":"Fu","first_name":"Xiangdong"},{"full_name":"Zhang, Xiansheng","last_name":"Zhang","first_name":"Xiansheng"},{"full_name":"Du, Zhuo","first_name":"Zhuo","last_name":"Du"},{"first_name":"Jun","last_name":"Xiao","full_name":"Xiao, Jun"}],"volume":24,"date_created":"2023-02-23T09:13:49Z","date_updated":"2023-05-08T10:52:49Z","article_number":"7","extern":"1","external_id":{"pmid":["36639687"]},"oa":1,"main_file_link":[{"url":"https://doi.org/10.1186/s13059-022-02844-2","open_access":"1"}],"quality_controlled":"1","doi":"10.1186/s13059-022-02844-2","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1474-760X"]},"month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12668","intvolume":" 24","title":"Dynamic chromatin regulatory programs during embryogenesis of hexaploid wheat","status":"public","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Background: Plant and animal embryogenesis have conserved and distinct features. Cell fate transitions occur during embryogenesis in both plants and animals. The epigenomic processes regulating plant embryogenesis remain largely elusive.\r\n\r\nResults: Here, we elucidate chromatin and transcriptomic dynamics during embryogenesis of the most cultivated crop, hexaploid wheat. Time-series analysis reveals stage-specific and proximal–distal distinct chromatin accessibility and dynamics concordant with transcriptome changes. Following fertilization, the remodeling kinetics of H3K4me3, H3K27ac, and H3K27me3 differ from that in mammals, highlighting considerable species-specific epigenomic dynamics during zygotic genome activation. Polycomb repressive complex 2 (PRC2)-mediated H3K27me3 deposition is important for embryo establishment. Later H3K27ac, H3K27me3, and chromatin accessibility undergo dramatic remodeling to establish a permissive chromatin environment facilitating the access of transcription factors to cis-elements for fate patterning. Embryonic maturation is characterized by increasing H3K27me3 and decreasing chromatin accessibility, which likely participates in restricting totipotency while preventing extensive organogenesis. Finally, epigenomic signatures are correlated with biased expression among homeolog triads and divergent expression after polyploidization, revealing an epigenomic contributor to subgenome diversification in an allohexaploid genome.\r\n\r\nConclusions: Collectively, we present an invaluable resource for comparative and mechanistic analysis of the epigenomic regulation of crop embryogenesis.","lang":"eng"}],"citation":{"mla":"Zhao, Long, et al. “Dynamic Chromatin Regulatory Programs during Embryogenesis of Hexaploid Wheat.” Genome Biology, vol. 24, 7, Springer Nature, 2023, doi:10.1186/s13059-022-02844-2.","short":"L. Zhao, Y. Yang, J. Chen, X. Lin, H. Zhang, H. Wang, H. Wang, X. Bie, J. Jiang, X. Feng, X. Fu, X. Zhang, Z. Du, J. Xiao, Genome Biology 24 (2023).","chicago":"Zhao, Long, Yiman Yang, Jinchao Chen, Xuelei Lin, Hao Zhang, Hao Wang, Hongzhe Wang, et al. “Dynamic Chromatin Regulatory Programs during Embryogenesis of Hexaploid Wheat.” Genome Biology. Springer Nature, 2023. https://doi.org/10.1186/s13059-022-02844-2.","ama":"Zhao L, Yang Y, Chen J, et al. Dynamic chromatin regulatory programs during embryogenesis of hexaploid wheat. Genome Biology. 2023;24. doi:10.1186/s13059-022-02844-2","ista":"Zhao L, Yang Y, Chen J, Lin X, Zhang H, Wang H, Wang H, Bie X, Jiang J, Feng X, Fu X, Zhang X, Du Z, Xiao J. 2023. Dynamic chromatin regulatory programs during embryogenesis of hexaploid wheat. Genome Biology. 24, 7.","apa":"Zhao, L., Yang, Y., Chen, J., Lin, X., Zhang, H., Wang, H., … Xiao, J. (2023). Dynamic chromatin regulatory programs during embryogenesis of hexaploid wheat. Genome Biology. Springer Nature. https://doi.org/10.1186/s13059-022-02844-2","ieee":"L. Zhao et al., “Dynamic chromatin regulatory programs during embryogenesis of hexaploid wheat,” Genome Biology, vol. 24. Springer Nature, 2023."},"publication":"Genome Biology","article_type":"original","date_published":"2023-01-13T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"13"},{"keyword":["General Chemistry","Catalysis","Organic Chemistry"],"scopus_import":"1","article_processing_charge":"No","day":"18","article_type":"original","citation":{"ama":"Traxler M, Reischauer S, Vogl S, et al. Programmable photocatalytic activity of multicomponent covalent organic frameworks used as metallaphotocatalysts. Chemistry – A European Journal. 2023;29(4). doi:10.1002/chem.202202967","ista":"Traxler M, Reischauer S, Vogl S, Roeser J, Rabeah J, Penschke C, Saalfrank P, Pieber B, Thomas A. 2023. Programmable photocatalytic activity of multicomponent covalent organic frameworks used as metallaphotocatalysts. Chemistry – A European Journal. 29(4), e202202967.","ieee":"M. Traxler et al., “Programmable photocatalytic activity of multicomponent covalent organic frameworks used as metallaphotocatalysts,” Chemistry – A European Journal, vol. 29, no. 4. Wiley, 2023.","apa":"Traxler, M., Reischauer, S., Vogl, S., Roeser, J., Rabeah, J., Penschke, C., … Thomas, A. (2023). Programmable photocatalytic activity of multicomponent covalent organic frameworks used as metallaphotocatalysts. Chemistry – A European Journal. Wiley. https://doi.org/10.1002/chem.202202967","mla":"Traxler, Michael, et al. “Programmable Photocatalytic Activity of Multicomponent Covalent Organic Frameworks Used as Metallaphotocatalysts.” Chemistry – A European Journal, vol. 29, no. 4, e202202967, Wiley, 2023, doi:10.1002/chem.202202967.","short":"M. Traxler, S. Reischauer, S. Vogl, J. Roeser, J. Rabeah, C. Penschke, P. Saalfrank, B. Pieber, A. Thomas, Chemistry – A European Journal 29 (2023).","chicago":"Traxler, Michael, Susanne Reischauer, Sarah Vogl, Jérôme Roeser, Jabor Rabeah, Christopher Penschke, Peter Saalfrank, Bartholomäus Pieber, and Arne Thomas. “Programmable Photocatalytic Activity of Multicomponent Covalent Organic Frameworks Used as Metallaphotocatalysts.” Chemistry – A European Journal. Wiley, 2023. https://doi.org/10.1002/chem.202202967."},"publication":"Chemistry – A European Journal","date_published":"2023-01-18T00:00:00Z","type":"journal_article","issue":"4","abstract":[{"text":"The multicomponent approach allows to incorporate several functionalities into a single covalent organic framework (COF) and consequently allows the construction of bifunctional materials for cooperative catalysis. The well-defined structure of such multicomponent COFs is furthermore ideally suited for structure-activity relationship studies. We report a series of multicomponent COFs that contain acridine- and 2,2’-bipyridine linkers connected through 1,3,5-benzenetrialdehyde derivatives. The acridine motif is responsible for broad light absorption, while the bipyridine unit enables complexation of nickel catalysts. These features enable the usage of the framework materials as catalysts for light-mediated carbon−heteroatom cross-couplings. Variation of the node units shows that the catalytic activity correlates to the keto-enamine tautomer isomerism. This allows switching between high charge-carrier mobility and persistent, localized charge-separated species depending on the nodes, a tool to tailor the materials for specific reactions. Moreover, nickel-loaded COFs are recyclable and catalyze cross-couplings even using red light irradiation.","lang":"eng"}],"intvolume":" 29","status":"public","title":"Programmable photocatalytic activity of multicomponent covalent organic frameworks used as metallaphotocatalysts","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12920","oa_version":"Published Version","publication_identifier":{"issn":["0947-6539"],"eissn":["1521-3765"]},"month":"01","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/chem.202202967"}],"language":[{"iso":"eng"}],"doi":"10.1002/chem.202202967","article_number":"e202202967","extern":"1","publisher":"Wiley","publication_status":"published","year":"2023","volume":29,"date_updated":"2023-05-15T08:39:24Z","date_created":"2023-05-08T08:25:34Z","author":[{"first_name":"Michael","last_name":"Traxler","full_name":"Traxler, Michael"},{"last_name":"Reischauer","first_name":"Susanne","full_name":"Reischauer, Susanne"},{"full_name":"Vogl, Sarah","last_name":"Vogl","first_name":"Sarah"},{"full_name":"Roeser, Jérôme","last_name":"Roeser","first_name":"Jérôme"},{"full_name":"Rabeah, Jabor","first_name":"Jabor","last_name":"Rabeah"},{"full_name":"Penschke, Christopher","first_name":"Christopher","last_name":"Penschke"},{"full_name":"Saalfrank, Peter","last_name":"Saalfrank","first_name":"Peter"},{"first_name":"Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"},{"last_name":"Thomas","first_name":"Arne","full_name":"Thomas, Arne"}]},{"scopus_import":"1","keyword":["Inorganic Chemistry","Organic Chemistry","Physical and Theoretical Chemistry","Catalysis"],"day":"06","article_processing_charge":"No","publication":"ChemCatChem","citation":{"mla":"Madani, Amiera, and Bartholomäus Pieber. “In Situ Reaction Monitoring in Photocatalytic Organic Synthesis.” ChemCatChem, vol. 15, no. 7, e202201583, Wiley, 2023, doi:10.1002/cctc.202201583.","short":"A. Madani, B. Pieber, ChemCatChem 15 (2023).","chicago":"Madani, Amiera, and Bartholomäus Pieber. “In Situ Reaction Monitoring in Photocatalytic Organic Synthesis.” ChemCatChem. Wiley, 2023. https://doi.org/10.1002/cctc.202201583.","ama":"Madani A, Pieber B. In situ reaction monitoring in photocatalytic organic synthesis. ChemCatChem. 2023;15(7). doi:10.1002/cctc.202201583","ista":"Madani A, Pieber B. 2023. In situ reaction monitoring in photocatalytic organic synthesis. ChemCatChem. 15(7), e202201583.","ieee":"A. Madani and B. Pieber, “In situ reaction monitoring in photocatalytic organic synthesis,” ChemCatChem, vol. 15, no. 7. Wiley, 2023.","apa":"Madani, A., & Pieber, B. (2023). In situ reaction monitoring in photocatalytic organic synthesis. ChemCatChem. Wiley. https://doi.org/10.1002/cctc.202201583"},"article_type":"original","date_published":"2023-04-06T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Visible-light photocatalysis provides numerous useful methodologies for synthetic organic chemistry. However, the mechanisms of these reactions are often not fully understood. Common mechanistic experiments mainly aim to characterize excited state properties of photocatalysts and their interaction with other species. Recently, in situ reaction monitoring using dedicated techniques was shown to be well-suited for the identification of intermediates and to obtain kinetic insights, thereby providing more holistic pictures of the reactions of interest. This minireview surveys these technologies and discusses selected examples where reaction monitoring was used to elucidate the mechanism of photocatalytic reactions."}],"issue":"7","_id":"12921","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"In situ reaction monitoring in photocatalytic organic synthesis","intvolume":" 15","oa_version":"Published Version","month":"04","publication_identifier":{"eissn":["1867-3899"],"issn":["1867-3880"]},"oa":1,"main_file_link":[{"url":"https://doi.org/10.1002/cctc.202201583","open_access":"1"}],"quality_controlled":"1","doi":"10.1002/cctc.202201583","language":[{"iso":"eng"}],"article_number":"e202201583","extern":"1","year":"2023","publication_status":"published","publisher":"Wiley","author":[{"last_name":"Madani","first_name":"Amiera","full_name":"Madani, Amiera"},{"full_name":"Pieber, Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","last_name":"Pieber"}],"date_updated":"2023-05-15T08:35:48Z","date_created":"2023-05-08T08:25:55Z","volume":15},{"article_processing_charge":"No","day":"02","page":"1768-1776","citation":{"ama":"Lieutier A, Wintraecken M. Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2023:1768-1776. doi:10.1145/3564246.3585113","apa":"Lieutier, A., & Wintraecken, M. (2023). Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 1768–1776). Orlando, FL, United States: Association for Computing Machinery. https://doi.org/10.1145/3564246.3585113","ieee":"A. Lieutier and M. Wintraecken, “Hausdorff and Gromov-Hausdorff stable subsets of the medial axis,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Orlando, FL, United States, 2023, pp. 1768–1776.","ista":"Lieutier A, Wintraecken M. 2023. Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. Proceedings of the 55th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 1768–1776.","short":"A. Lieutier, M. Wintraecken, in:, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–1776.","mla":"Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff Stable Subsets of the Medial Axis.” Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–76, doi:10.1145/3564246.3585113.","chicago":"Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff Stable Subsets of the Medial Axis.” In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1768–76. Association for Computing Machinery, 2023. https://doi.org/10.1145/3564246.3585113."},"publication":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","date_published":"2023-06-02T00:00:00Z","type":"conference","abstract":[{"text":"In this paper we introduce a pruning of the medial axis called the (λ,α)-medial axis (axλα). We prove that the (λ,α)-medial axis of a set K is stable in a Gromov-Hausdorff sense under weak assumptions. More formally we prove that if K and K′ are close in the Hausdorff (dH) sense then the (λ,α)-medial axes of K and K′ are close as metric spaces, that is the Gromov-Hausdorff distance (dGH) between the two is 1/4-Hölder in the sense that dGH (axλα(K),axλα(K′)) ≲ dH(K,K′)1/4. The Hausdorff distance between the two medial axes is also bounded, by dH (axλα(K),λα(K′)) ≲ dH(K,K′)1/2. These quantified stability results provide guarantees for practical computations of medial axes from approximations. Moreover, they provide key ingredients for studying the computability of the medial axis in the context of computable analysis.","lang":"eng"}],"title":"Hausdorff and Gromov-Hausdorff stable subsets of the medial axis","status":"public","_id":"13048","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","publication_identifier":{"isbn":["9781450399135"]},"month":"06","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"grant_number":"M03073","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","name":"Learning and triangulating manifolds via collapses"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2303.04014"}],"external_id":{"arxiv":["2303.04014"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/3564246.3585113","conference":{"name":"STOC: Symposium on Theory of Computing","end_date":"2023-06-23","start_date":"2023-06-20","location":"Orlando, FL, United States"},"ec_funded":1,"publisher":"Association for Computing Machinery","department":[{"_id":"HeEd"}],"publication_status":"published","year":"2023","acknowledgement":"We are greatly indebted to Erin Chambers for posing a number of questions that eventually led to this paper. We would also like to thank the other organizers of the workshop on ‘Algorithms\r\nfor the medial axis’. We are also indebted to Tatiana Ezubova for helping with the search for and translation of Russian literature. The second author thanks all members of the Edelsbrunner and Datashape groups for the atmosphere in which the research was conducted.\r\nThe research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement No. 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions). Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411. The Austrian science fund (FWF) M-3073.","date_created":"2023-05-22T08:02:02Z","date_updated":"2023-05-22T08:15:19Z","author":[{"last_name":"Lieutier","first_name":"André","full_name":"Lieutier, André"},{"last_name":"Wintraecken","first_name":"Mathijs","orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs"}]},{"citation":{"short":"E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, D.-A. Alistarh, in:, 11th International Conference on Learning Representations , n.d.","mla":"Peste, Elena-Alexandra, et al. “CrAM: A Compression-Aware Minimizer.” 11th International Conference on Learning Representations .","chicago":"Peste, Elena-Alexandra, Adrian Vladu, Eldar Kurtic, Christoph Lampert, and Dan-Adrian Alistarh. “CrAM: A Compression-Aware Minimizer.” In 11th International Conference on Learning Representations , n.d.","ama":"Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware Minimizer. In: 11th International Conference on Learning Representations .","apa":"Peste, E.-A., Vladu, A., Kurtic, E., Lampert, C., & Alistarh, D.-A. (n.d.). CrAM: A Compression-Aware Minimizer. In 11th International Conference on Learning Representations . Kigali, Rwanda .","ieee":"E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, and D.-A. Alistarh, “CrAM: A Compression-Aware Minimizer,” in 11th International Conference on Learning Representations , Kigali, Rwanda .","ista":"Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware Minimizer. 11th International Conference on Learning Representations . ICLR: International Conference on Learning Representations."},"main_file_link":[{"open_access":"1","url":"https://openreview.net/pdf?id=_eTZBs-yedr"}],"external_id":{"arxiv":["2207.14200"]},"oa":1,"publication":"11th International Conference on Learning Representations ","project":[{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"}],"quality_controlled":"1","date_published":"2023-05-01T00:00:00Z","conference":{"end_date":"2023-05-05","location":"Kigali, Rwanda ","start_date":"2023-05-01","name":"ICLR: International Conference on Learning Representations"},"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"article_processing_charge":"No","month":"05","acknowledgement":"AP, EK, DA received funding from the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). AV acknowledges the support of the French Agence Nationale de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT). We further acknowledge the support from the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp)-","_id":"13053","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"DaAl"},{"_id":"ChLa"}],"title":"CrAM: A Compression-Aware Minimizer","publication_status":"accepted","status":"public","related_material":{"record":[{"id":"13074","relation":"dissertation_contains","status":"public"}]},"author":[{"id":"32D78294-F248-11E8-B48F-1D18A9856A87","first_name":"Elena-Alexandra","last_name":"Peste","full_name":"Peste, Elena-Alexandra"},{"full_name":"Vladu, Adrian","last_name":"Vladu","first_name":"Adrian"},{"first_name":"Eldar","last_name":"Kurtic","id":"47beb3a5-07b5-11eb-9b87-b108ec578218","full_name":"Kurtic, Eldar"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph"},{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"}],"oa_version":"Preprint","date_updated":"2023-06-01T12:54:45Z","date_created":"2023-05-23T11:36:18Z","type":"conference","ec_funded":1,"abstract":[{"text":"Deep neural networks (DNNs) often have to be compressed, via pruning and/or quantization, before they can be deployed in practical settings. In this work we propose a new compression-aware minimizer dubbed CrAM that modifies the optimization step in a principled way, in order to produce models whose local loss behavior is stable under compression operations such as pruning. Thus, dense models trained via CrAM should be compressible post-training, in a single step, without significant accuracy loss. Experimental results on standard benchmarks, such as residual networks for ImageNet classification and BERT models for language modelling, show that CrAM produces dense models that can be more accurate than the standard SGD/Adam-based baselines, but which are stable under weight pruning: specifically, we can prune models in one-shot to 70-80% sparsity with almost no accuracy loss, and to 90% with reasonable (∼1%) accuracy loss, which is competitive with gradual compression methods. Additionally, CrAM can produce sparse models which perform well for transfer learning, and it also works for semi-structured 2:4 pruning patterns supported by GPU hardware. The code for reproducing the results is available at this https URL .","lang":"eng"}]},{"publication":"Public-Key Cryptography - PKC 2023","citation":{"chicago":"Hoffmann, Charlotte, Pavel Hubáček, Chethan Kamath, and Krzysztof Z Pietrzak. “Certifying Giant Nonprimes.” In Public-Key Cryptography - PKC 2023, 13940:530–53. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-31368-4_19.","short":"C. Hoffmann, P. Hubáček, C. Kamath, K.Z. Pietrzak, in:, Public-Key Cryptography - PKC 2023, Springer Nature, 2023, pp. 530–553.","mla":"Hoffmann, Charlotte, et al. “Certifying Giant Nonprimes.” Public-Key Cryptography - PKC 2023, vol. 13940, Springer Nature, 2023, pp. 530–53, doi:10.1007/978-3-031-31368-4_19.","ieee":"C. Hoffmann, P. Hubáček, C. Kamath, and K. Z. Pietrzak, “Certifying giant nonprimes,” in Public-Key Cryptography - PKC 2023, Atlanta, GA, United States, 2023, vol. 13940, pp. 530–553.","apa":"Hoffmann, C., Hubáček, P., Kamath, C., & Pietrzak, K. Z. (2023). Certifying giant nonprimes. In Public-Key Cryptography - PKC 2023 (Vol. 13940, pp. 530–553). Atlanta, GA, United States: Springer Nature. https://doi.org/10.1007/978-3-031-31368-4_19","ista":"Hoffmann C, Hubáček P, Kamath C, Pietrzak KZ. 2023. Certifying giant nonprimes. Public-Key Cryptography - PKC 2023. PKC: Public-Key Cryptography, LNCS, vol. 13940, 530–553.","ama":"Hoffmann C, Hubáček P, Kamath C, Pietrzak KZ. Certifying giant nonprimes. In: Public-Key Cryptography - PKC 2023. Vol 13940. Springer Nature; 2023:530-553. doi:10.1007/978-3-031-31368-4_19"},"page":"530-553","date_published":"2023-05-02T00:00:00Z","scopus_import":"1","day":"02","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13143","status":"public","title":"Certifying giant nonprimes","intvolume":" 13940","oa_version":"Submitted Version","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"GIMPS and PrimeGrid are large-scale distributed projects dedicated to searching giant prime numbers, usually of special forms like Mersenne and Proth primes. The numbers in the current search-space are millions of digits large and the participating volunteers need to run resource-consuming primality tests. Once a candidate prime N has been found, the only way for another party to independently verify the primality of N used to be by repeating the expensive primality test. To avoid the need for second recomputation of each primality test, these projects have recently adopted certifying mechanisms that enable efficient verification of performed tests. However, the mechanisms presently in place only detect benign errors and there is no guarantee against adversarial behavior: a malicious volunteer can mislead the project to reject a giant prime as being non-prime.\r\nIn this paper, we propose a practical, cryptographically-sound mechanism for certifying the non-primality of Proth numbers. That is, a volunteer can – parallel to running the primality test for N – generate an efficiently verifiable proof at a little extra cost certifying that N is not prime. The interactive protocol has statistical soundness and can be made non-interactive using the Fiat-Shamir heuristic.\r\nOur approach is based on a cryptographic primitive called Proof of Exponentiation (PoE) which, for a group G, certifies that a tuple (x,y,T)∈G2×N satisfies x2T=y (Pietrzak, ITCS 2019 and Wesolowski, J. Cryptol. 2020). In particular, we show how to adapt Pietrzak’s PoE at a moderate additional cost to make it a cryptographically-sound certificate of non-primality.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2023/238"}],"oa":1,"quality_controlled":"1","conference":{"name":"PKC: Public-Key Cryptography","location":"Atlanta, GA, United States","start_date":"2023-05-07","end_date":"2023-05-10"},"doi":"10.1007/978-3-031-31368-4_19","language":[{"iso":"eng"}],"month":"05","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031313677"],"eissn":["1611-3349"]},"year":"2023","acknowledgement":"We are grateful to Pavel Atnashev for clarifying via e-mail several aspects of the primality tests implementated in the PrimeGrid project. Pavel Hubáček is supported by the Czech Academy of Sciences (RVO 67985840), the Grant Agency of the Czech Republic under the grant agreement no. 19-27871X, and by the Charles University project UNCE/SCI/004. Chethan Kamath is supported by Azrieli International Postdoctoral Fellowship, ISF grants 484/18 and 1789/19, and ERC StG project SPP: Secrecy Preserving Proofs.","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer Nature","author":[{"full_name":"Hoffmann, Charlotte","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","last_name":"Hoffmann","first_name":"Charlotte"},{"full_name":"Hubáček, Pavel","last_name":"Hubáček","first_name":"Pavel"},{"full_name":"Kamath, Chethan","first_name":"Chethan","last_name":"Kamath"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"}],"date_created":"2023-06-18T22:00:47Z","date_updated":"2023-06-19T08:03:37Z","volume":13940},{"doi":"10.1007/978-3-031-30823-9_1","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2023-04-27","start_date":"2023-04-22","location":"Paris, France"},"language":[{"iso":"eng"}],"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,"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031308222"],"eissn":["1611-3349"]},"month":"04","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"first_name":"Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde"}],"volume":13993,"date_updated":"2023-06-19T08:30:54Z","date_created":"2023-06-18T22:00:47Z","year":"2023","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","publisher":"Springer Nature","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","ec_funded":1,"file_date_updated":"2023-06-19T08:29:30Z","date_published":"2023-04-22T00:00:00Z","citation":{"ama":"Chatterjee K, Henzinger TA, Lechner M, Zikelic D. A learner-verifier framework for neural network controllers and certificates of stochastic systems. In: Tools and Algorithms for the Construction and Analysis of Systems . Vol 13993. Springer Nature; 2023:3-25. doi:10.1007/978-3-031-30823-9_1","ieee":"K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “A learner-verifier framework for neural network controllers and certificates of stochastic systems,” in Tools and Algorithms for the Construction and Analysis of Systems , Paris, France, 2023, vol. 13993, pp. 3–25.","apa":"Chatterjee, K., Henzinger, T. A., Lechner, M., & Zikelic, D. (2023). A learner-verifier framework for neural network controllers and certificates of stochastic systems. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13993, pp. 3–25). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30823-9_1","ista":"Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. A learner-verifier framework for neural network controllers and certificates of stochastic systems. Tools and Algorithms for the Construction and Analysis of Systems . TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13993, 3–25.","short":"K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, Tools and Algorithms for the Construction and Analysis of Systems , Springer Nature, 2023, pp. 3–25.","mla":"Chatterjee, Krishnendu, et al. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.” Tools and Algorithms for the Construction and Analysis of Systems , vol. 13993, Springer Nature, 2023, pp. 3–25, doi:10.1007/978-3-031-30823-9_1.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.” In Tools and Algorithms for the Construction and Analysis of Systems , 13993:3–25. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30823-9_1."},"publication":"Tools and Algorithms for the Construction and Analysis of Systems ","page":"3-25","article_processing_charge":"No","has_accepted_license":"1","day":"22","scopus_import":"1","oa_version":"Published Version","file":[{"date_updated":"2023-06-19T08:29:30Z","date_created":"2023-06-19T08:29:30Z","success":1,"checksum":"3d8a8bb24d211bc83360dfc2fd744307","file_id":"13150","relation":"main_file","creator":"dernst","file_size":528455,"content_type":"application/pdf","file_name":"2023_LNCS_Chatterjee.pdf","access_level":"open_access"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13142","intvolume":" 13993","status":"public","title":"A learner-verifier framework for neural network controllers and certificates of stochastic systems","ddc":["000"],"abstract":[{"text":"Reinforcement learning has received much attention for learning controllers of deterministic systems. We consider a learner-verifier framework for stochastic control systems and survey recent methods that formally guarantee a conjunction of reachability and safety properties. Given a property and a lower bound on the probability of the property being satisfied, our framework jointly learns a control policy and a formal certificate to ensure the satisfaction of the property with a desired probability threshold. Both the control policy and the formal certificate are continuous functions from states to reals, which are learned as parameterized neural networks. While in the deterministic case, the certificates are invariant and barrier functions for safety, or Lyapunov and ranking functions for liveness, in the stochastic case the certificates are supermartingales. For certificate verification, we use interval arithmetic abstract interpretation to bound the expected values of neural network functions.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"]}]