[{"_id":"8195","status":"public","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["000"],"date_updated":"2023-09-07T13:18:00Z","file_date_updated":"2020-08-06T08:14:54Z","department":[{"_id":"ToHe"}],"oa_version":"Published Version","abstract":[{"text":"This paper presents a foundation for refining concurrent programs with structured control flow. The verification problem is decomposed into subproblems that aid interactive program development, proof reuse, and automation. The formalization in this paper is the basis of a new design and implementation of the Civl verifier.","lang":"eng"}],"month":"07","intvolume":" 12224","alternative_title":["LNCS"],"scopus_import":"1","file":[{"file_name":"2020_LNCS_Kragl.pdf","date_created":"2020-08-06T08:14:54Z","file_size":804237,"date_updated":"2020-08-06T08:14:54Z","creator":"dernst","success":1,"file_id":"8201","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["9783030532888"],"eissn":["1611-3349"],"isbn":["9783030532871"],"issn":["0302-9743"]},"publication_status":"published","related_material":{"record":[{"relation":"dissertation_contains","id":"8332","status":"public"}]},"volume":12224,"license":"https://creativecommons.org/licenses/by/4.0/","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Kragl B, Qadeer S, Henzinger TA. 2020. Refinement for structured concurrent programs. Computer Aided Verification. , LNCS, vol. 12224, 275–298.","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured Concurrent Programs.” In Computer Aided Verification, 12224:275–98. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-53288-8_14.","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Refinement for structured concurrent programs,” in Computer Aided Verification, 2020, vol. 12224, pp. 275–298.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer Nature, 2020, pp. 275–298.","apa":"Kragl, B., Qadeer, S., & Henzinger, T. A. (2020). Refinement for structured concurrent programs. In Computer Aided Verification (Vol. 12224, pp. 275–298). Springer Nature. https://doi.org/10.1007/978-3-030-53288-8_14","ama":"Kragl B, Qadeer S, Henzinger TA. Refinement for structured concurrent programs. In: Computer Aided Verification. Vol 12224. Springer Nature; 2020:275-298. doi:10.1007/978-3-030-53288-8_14","mla":"Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.” Computer Aided Verification, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:10.1007/978-3-030-53288-8_14."},"title":"Refinement for structured concurrent programs","author":[{"last_name":"Kragl","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"article_processing_charge":"No","external_id":{"isi":["000695276000014"]},"acknowledgement":"Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","publisher":"Springer Nature","quality_controlled":"1","oa":1,"day":"14","publication":"Computer Aided Verification","isi":1,"has_accepted_license":"1","year":"2020","date_published":"2020-07-14T00:00:00Z","doi":"10.1007/978-3-030-53288-8_14","date_created":"2020-08-03T11:45:35Z","page":"275-298"},{"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"citation":{"apa":"Kragl, B., Enea, C., Henzinger, T. A., Mutluergil, S. O., & Qadeer, S. (2020). Inductive sequentialization of asynchronous programs. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 227–242). London, United Kingdom: Association for Computing Machinery. https://doi.org/10.1145/3385412.3385980","ama":"Kragl B, Enea C, Henzinger TA, Mutluergil SO, Qadeer S. Inductive sequentialization of asynchronous programs. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2020:227-242. doi:10.1145/3385412.3385980","short":"B. Kragl, C. Enea, T.A. Henzinger, S.O. Mutluergil, S. Qadeer, in:, Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 227–242.","ieee":"B. Kragl, C. Enea, T. A. Henzinger, S. O. Mutluergil, and S. Qadeer, “Inductive sequentialization of asynchronous programs,” in Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, London, United Kingdom, 2020, pp. 227–242.","mla":"Kragl, Bernhard, et al. “Inductive Sequentialization of Asynchronous Programs.” Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 227–42, doi:10.1145/3385412.3385980.","ista":"Kragl B, Enea C, Henzinger TA, Mutluergil SO, Qadeer S. 2020. Inductive sequentialization of asynchronous programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 227–242.","chicago":"Kragl, Bernhard, Constantin Enea, Thomas A Henzinger, Suha Orhun Mutluergil, and Shaz Qadeer. “Inductive Sequentialization of Asynchronous Programs.” In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, 227–42. Association for Computing Machinery, 2020. https://doi.org/10.1145/3385412.3385980."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","last_name":"Kragl"},{"last_name":"Enea","full_name":"Enea, Constantin","first_name":"Constantin"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Mutluergil, Suha Orhun","last_name":"Mutluergil","first_name":"Suha Orhun"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}],"article_processing_charge":"No","external_id":{"isi":["000614622300016"]},"title":"Inductive sequentialization of asynchronous programs","publisher":"Association for Computing Machinery","quality_controlled":"1","oa":1,"isi":1,"year":"2020","day":"01","publication":"Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation","page":"227-242","doi":"10.1145/3385412.3385980","date_published":"2020-06-01T00:00:00Z","date_created":"2020-06-25T11:40:16Z","_id":"8012","type":"conference","conference":{"start_date":"2020-06-15","location":"London, United Kingdom","end_date":"2020-06-20","name":"PLDI: Programming Language Design and Implementation"},"status":"public","date_updated":"2023-09-07T13:18:00Z","department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"Asynchronous programs are notoriously difficult to reason about because they spawn computation tasks which take effect asynchronously in a nondeterministic way. Devising inductive invariants for such programs requires understanding and stating complex relationships between an unbounded number of computation tasks in arbitrarily long executions. In this paper, we introduce inductive sequentialization, a new proof rule that sidesteps this complexity via a sequential reduction, a sequential program that captures every behavior of the original program up to reordering of coarse-grained commutative actions. A sequential reduction of a concurrent program is easy to reason about since it corresponds to a simple execution of the program in an idealized synchronous environment, where processes act in a fixed order and at the same speed. We have implemented and integrated our proof rule in the CIVL verifier, allowing us to provably derive fine-grained implementations of asynchronous programs. We have successfully applied our proof rule to a diverse set of message-passing protocols, including leader election protocols, two-phase commit, and Paxos."}],"oa_version":"Published Version","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3385412.3385980"}],"month":"06","publication_identifier":{"isbn":["9781450376136"]},"publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"8332","status":"public"}]}},{"alternative_title":["ISTA Thesis"],"month":"09","acknowledged_ssus":[{"_id":"Bio"}],"abstract":[{"lang":"eng","text":"During bacterial cell division, the tubulin-homolog FtsZ forms a ring-like structure at the center of the cell. This so-called Z-ring acts as a scaffold recruiting several division-related proteins to mid-cell and plays a key role in distributing proteins at the division site, a feature driven by the treadmilling motion of FtsZ filaments around the septum. What regulates the architecture, dynamics and stability of the Z-ring is still poorly understood, but FtsZ-associated proteins (Zaps) are known to play an important role. \r\nAdvances in fluorescence microscopy and in vitro reconstitution experiments have helped to shed light into some of the dynamic properties of these complex systems, but methods that allow to collect and analyze large quantitative data sets of the underlying polymer dynamics are still missing.\r\nHere, using an in vitro reconstitution approach, we studied how different Zaps affect FtsZ filament dynamics and organization into large-scale patterns, giving special emphasis to the role of the well-conserved protein ZapA. For this purpose, we use high-resolution fluorescence microscopy combined with novel image analysis workfows to study pattern organization and polymerization dynamics of active filaments. We quantified the influence of Zaps on FtsZ on three diferent spatial scales: the large-scale organization of the membrane-bound filament network, the underlying\r\npolymerization dynamics and the behavior of single molecules.\r\nWe found that ZapA cooperatively increases the spatial order of the filament network, binds only transiently to FtsZ filaments and has no effect on filament length and treadmilling velocity. Our data provides a model for how FtsZ-associated proteins can increase the precision and stability of the bacterial cell division machinery in a\r\nswitch-like manner, without compromising filament dynamics. Furthermore, we believe that our automated quantitative methods can be used to analyze a large variety of dynamic cytoskeletal systems, using standard time-lapse\r\nmovies of homogeneously labeled proteins obtained from experiments in vitro or even inside the living cell.\r\n"}],"oa_version":"Published Version","related_material":{"record":[{"id":"7572","status":"public","relation":"dissertation_contains"},{"relation":"part_of_dissertation","status":"public","id":"7197"}]},"degree_awarded":"PhD","publication_status":"published","publication_identifier":{"isbn":["978-3-99078-009-1"],"issn":["2663-337X"]},"language":[{"iso":"eng"}],"file":[{"file_id":"8364","checksum":"882f93fe9c351962120e2669b84bf088","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2020-09-10T12:11:29Z","file_name":"phd_thesis_pcaldas.pdf","creator":"pcaldas","date_updated":"2020-09-10T12:11:29Z","file_size":141602462},{"file_id":"8365","checksum":"70cc9e399c4e41e6e6ac445ae55e8558","access_level":"closed","relation":"source_file","content_type":"application/x-zip-compressed","date_created":"2020-09-10T12:18:17Z","file_name":"phd_thesis_latex_pcaldas.zip","creator":"pcaldas","date_updated":"2020-09-11T07:48:10Z","file_size":450437458}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"dissertation","status":"public","_id":"8358","department":[{"_id":"MaLo"}],"file_date_updated":"2020-09-11T07:48:10Z","date_updated":"2023-09-07T13:18:51Z","supervisor":[{"first_name":"Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","last_name":"Loose","full_name":"Loose, Martin","orcid":"0000-0001-7309-9724"}],"ddc":["572"],"oa":1,"publisher":"Institute of Science and Technology Austria","acknowledgement":"I should also express my gratitude to the bioimaging facility at IST Austria, for their assistance with the TIRF setup over the years, and especially to Christoph Sommer, who gave me a lot of input when I was starting to dive into programming.","page":"135","date_created":"2020-09-10T09:26:49Z","doi":"10.15479/AT:ISTA:8358","date_published":"2020-09-10T00:00:00Z","year":"2020","has_accepted_license":"1","day":"10","article_processing_charge":"No","author":[{"id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87","first_name":"Paulo R","orcid":"0000-0001-6730-4461","full_name":"Dos Santos Caldas, Paulo R","last_name":"Dos Santos Caldas"}],"title":"Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers","citation":{"chicago":"Dos Santos Caldas, Paulo R. “Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8358.","ista":"Dos Santos Caldas PR. 2020. Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. Institute of Science and Technology Austria.","mla":"Dos Santos Caldas, Paulo R. Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8358.","short":"P.R. Dos Santos Caldas, Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers, Institute of Science and Technology Austria, 2020.","ieee":"P. R. Dos Santos Caldas, “Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers,” Institute of Science and Technology Austria, 2020.","apa":"Dos Santos Caldas, P. R. (2020). Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8358","ama":"Dos Santos Caldas PR. Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. 2020. doi:10.15479/AT:ISTA:8358"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"year":"2020","has_accepted_license":"1","publication":"28th Annual European Symposium on Algorithms","day":"26","date_created":"2020-10-25T23:01:18Z","doi":"10.4230/LIPIcs.ESA.2020.75","date_published":"2020-08-26T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"short":"G.F. Osang, M. Rouxel-Labbé, M. Teillaud, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"G. F. Osang, M. Rouxel-Labbé, and M. Teillaud, “Generalizing CGAL periodic Delaunay triangulations,” in 28th Annual European Symposium on Algorithms, Virtual, Online; Pisa, Italy, 2020, vol. 173.","apa":"Osang, G. F., Rouxel-Labbé, M., & Teillaud, M. (2020). Generalizing CGAL periodic Delaunay triangulations. In 28th Annual European Symposium on Algorithms (Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.75","ama":"Osang GF, Rouxel-Labbé M, Teillaud M. Generalizing CGAL periodic Delaunay triangulations. In: 28th Annual European Symposium on Algorithms. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.75","mla":"Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.” 28th Annual European Symposium on Algorithms, vol. 173, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.75.","ista":"Osang GF, Rouxel-Labbé M, Teillaud M. 2020. Generalizing CGAL periodic Delaunay triangulations. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 75.","chicago":"Osang, Georg F, Mael Rouxel-Labbé, and Monique Teillaud. “Generalizing CGAL Periodic Delaunay Triangulations.” In 28th Annual European Symposium on Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ESA.2020.75."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"last_name":"Osang","full_name":"Osang, Georg F","orcid":"0000-0002-8882-5116","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg F"},{"full_name":"Rouxel-Labbé, Mael","last_name":"Rouxel-Labbé","first_name":"Mael"},{"full_name":"Teillaud, Monique","last_name":"Teillaud","first_name":"Monique"}],"title":"Generalizing CGAL periodic Delaunay triangulations","article_number":"75","project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended"}],"publication_status":"published","publication_identifier":{"isbn":["9783959771627"],"issn":["18688969"]},"language":[{"iso":"eng"}],"file":[{"creator":"cziletti","file_size":733291,"date_updated":"2020-10-27T14:31:52Z","file_name":"2020_LIPIcs_Osang.pdf","date_created":"2020-10-27T14:31:52Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"8712","checksum":"fe0f7c49a99ed870c671b911e10d5496"}],"license":"https://creativecommons.org/licenses/by/3.0/","ec_funded":1,"related_material":{"record":[{"id":"9056","status":"public","relation":"dissertation_contains"}]},"volume":173,"abstract":[{"text":"Even though Delaunay originally introduced his famous triangulations in the case of infinite point sets with translational periodicity, a software that computes such triangulations in the general case is not yet available, to the best of our knowledge. Combining and generalizing previous work, we present a practical algorithm for computing such triangulations. The algorithm has been implemented and experiments show that its performance is as good as the one of the CGAL package, which is restricted to cubic periodicity. ","lang":"eng"}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":"1","intvolume":" 173","month":"08","date_updated":"2023-09-07T13:29:00Z","ddc":["000"],"file_date_updated":"2020-10-27T14:31:52Z","department":[{"_id":"HeEd"}],"_id":"8703","conference":{"name":"ESA: Annual European Symposium on Algorithms","end_date":"2020-09-09","location":"Virtual, Online; Pisa, Italy","start_date":"2020-09-07"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"type":"conference","status":"public"},{"_id":"7481","type":"conference","conference":{"name":"ICLR: International Conference on Learning Representations","start_date":"2020-04-27","location":"Online","end_date":"2020-04-30"},"status":"public","citation":{"short":"M. Phuong, C. Lampert, in:, 8th International Conference on Learning Representations, 2020.","ieee":"M. Phuong and C. Lampert, “Functional vs. parametric equivalence of ReLU networks,” in 8th International Conference on Learning Representations, Online, 2020.","ama":"Phuong M, Lampert C. Functional vs. parametric equivalence of ReLU networks. In: 8th International Conference on Learning Representations. ; 2020.","apa":"Phuong, M., & Lampert, C. (2020). Functional vs. parametric equivalence of ReLU networks. In 8th International Conference on Learning Representations. Online.","mla":"Phuong, Mary, and Christoph Lampert. “Functional vs. Parametric Equivalence of ReLU Networks.” 8th International Conference on Learning Representations, 2020.","ista":"Phuong M, Lampert C. 2020. Functional vs. parametric equivalence of ReLU networks. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","chicago":"Phuong, Mary, and Christoph Lampert. “Functional vs. Parametric Equivalence of ReLU Networks.” In 8th International Conference on Learning Representations, 2020."},"date_updated":"2023-09-07T13:29:50Z","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Bui Thi Mai","full_name":"Bui Thi Mai, Phuong","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","first_name":"Phuong"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert"}],"article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:59Z","title":"Functional vs. parametric equivalence of ReLU networks","department":[{"_id":"ChLa"}],"abstract":[{"text":"We address the following question: How redundant is the parameterisation of ReLU networks? Specifically, we consider transformations of the weight space which leave the function implemented by the network intact. Two such transformations are known for feed-forward architectures: permutation of neurons within a layer, and positive scaling of all incoming weights of a neuron coupled with inverse scaling of its outgoing weights. In this work, we show for architectures with non-increasing widths that permutation and scaling are in fact the only function-preserving weight transformations. For any eligible architecture we give an explicit construction of a neural network such that any other network that implements the same function can be obtained from the original one by the application of permutations and rescaling. The proof relies on a geometric understanding of boundaries between linear regions of ReLU networks, and we hope the developed mathematical tools are of independent interest.","lang":"eng"}],"oa_version":"Published Version","quality_controlled":"1","oa":1,"month":"04","has_accepted_license":"1","publication_status":"published","year":"2020","file":[{"checksum":"8d372ea5defd8cb8fdc430111ed754a9","file_id":"7482","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"main.pdf","date_created":"2020-02-11T09:07:27Z","creator":"bphuong","file_size":405469,"date_updated":"2020-07-14T12:47:59Z"}],"day":"26","language":[{"iso":"eng"}],"publication":"8th International Conference on Learning Representations","related_material":{"link":[{"url":"https://iclr.cc/virtual_2020/poster_Bylx-TNKvH.html","relation":"supplementary_material"}],"record":[{"relation":"dissertation_contains","id":"9418","status":"public"}]},"date_published":"2020-04-26T00:00:00Z","date_created":"2020-02-11T09:07:37Z"}]