[{"file":[{"date_created":"2020-09-08T14:26:31Z","file_name":"readme.txt","date_updated":"2020-09-08T14:26:31Z","file_size":882,"creator":"rhauschild","checksum":"108352149987ac6f066e4925bd56e35e","file_id":"8346","success":1,"content_type":"text/plain","access_level":"open_access","relation":"main_file"},{"creator":"rhauschild","date_updated":"2020-09-08T14:26:33Z","file_size":246121,"date_created":"2020-09-08T14:26:33Z","file_name":"RGtracker.mlappinstall","access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","checksum":"ffd6c643b28e0cc7c6d0060a18a7e8ea","file_id":"8347","success":1}],"day":"10","year":"2020","has_accepted_license":"1","date_created":"2020-08-25T12:52:48Z","license":"https://opensource.org/licenses/BSD-3-Clause","doi":"10.15479/AT:ISTA:8294","date_published":"2020-09-10T00:00:00Z","abstract":[{"text":"Automated root growth analysis and tracking of root tips. ","lang":"eng"}],"month":"09","oa":1,"publisher":"IST Austria","ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Hauschild R. 2020. RGtracker, IST Austria, 10.15479/AT:ISTA:8294.","chicago":"Hauschild, Robert. “RGtracker.” IST Austria, 2020. https://doi.org/10.15479/AT:ISTA:8294.","ieee":"R. Hauschild, “RGtracker.” IST Austria, 2020.","short":"R. Hauschild, (2020).","apa":"Hauschild, R. (2020). RGtracker. IST Austria. https://doi.org/10.15479/AT:ISTA:8294","ama":"Hauschild R. RGtracker. 2020. doi:10.15479/AT:ISTA:8294","mla":"Hauschild, Robert. RGtracker. IST Austria, 2020, doi:10.15479/AT:ISTA:8294."},"date_updated":"2021-01-12T08:17:56Z","department":[{"_id":"Bio"}],"title":"RGtracker","file_date_updated":"2020-09-08T14:26:33Z","author":[{"last_name":"Hauschild","full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"_id":"8294","status":"public","tmp":{"short":"3-Clause BSD","legal_code_url":"https://opensource.org/licenses/BSD-3-Clause","name":"The 3-Clause BSD License"},"type":"software"},{"department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T08:18:08Z","conference":{"name":"CRYPTO: Annual International Cryptology Conference","start_date":"2020-08-17","end_date":"2020-08-21","location":"Santa Barbara, CA, United States"},"type":"conference","status":"public","_id":"8322","ec_funded":1,"volume":12171,"publication_status":"published","publication_identifier":{"issn":["03029743"],"isbn":["9783030568795"],"eissn":["16113349"]},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://eprint.iacr.org/2019/1317","open_access":"1"}],"scopus_import":"1","alternative_title":["LNCS"],"intvolume":" 12171","month":"08","abstract":[{"text":"Reverse firewalls were introduced at Eurocrypt 2015 by Miro-nov and Stephens-Davidowitz, as a method for protecting cryptographic protocols against attacks on the devices of the honest parties. In a nutshell: a reverse firewall is placed outside of a device and its goal is to “sanitize” the messages sent by it, in such a way that a malicious device cannot leak its secrets to the outside world. It is typically assumed that the cryptographic devices are attacked in a “functionality-preserving way” (i.e. informally speaking, the functionality of the protocol remains unchanged under this attacks). In their paper, Mironov and Stephens-Davidowitz construct a protocol for passively-secure two-party computations with firewalls, leaving extension of this result to stronger models as an open question.\r\nIn this paper, we address this problem by constructing a protocol for secure computation with firewalls that has two main advantages over the original protocol from Eurocrypt 2015. Firstly, it is a multiparty computation protocol (i.e. it works for an arbitrary number n of the parties, and not just for 2). Secondly, it is secure in much stronger corruption settings, namely in the active corruption model. More precisely: we consider an adversary that can fully corrupt up to 𝑛−1 parties, while the remaining parties are corrupt in a functionality-preserving way.\r\nOur core techniques are: malleable commitments and malleable non-interactive zero-knowledge, which in particular allow us to create a novel protocol for multiparty augmented coin-tossing into the well with reverse firewalls (that is based on a protocol of Lindell from Crypto 2001).","lang":"eng"}],"oa_version":"Preprint","article_processing_charge":"No","author":[{"id":"B9CD0494-D033-11E9-B219-A439E6697425","first_name":"Suvradip","full_name":"Chakraborty, Suvradip","last_name":"Chakraborty"},{"first_name":"Stefan","full_name":"Dziembowski, Stefan","last_name":"Dziembowski"},{"last_name":"Nielsen","full_name":"Nielsen, Jesper Buus","first_name":"Jesper Buus"}],"title":"Reverse firewalls for actively secure MPCs","citation":{"mla":"Chakraborty, Suvradip, et al. “Reverse Firewalls for Actively Secure MPCs.” Advances in Cryptology – CRYPTO 2020, vol. 12171, Springer Nature, 2020, pp. 732–62, doi:10.1007/978-3-030-56880-1_26.","ieee":"S. Chakraborty, S. Dziembowski, and J. B. Nielsen, “Reverse firewalls for actively secure MPCs,” in Advances in Cryptology – CRYPTO 2020, Santa Barbara, CA, United States, 2020, vol. 12171, pp. 732–762.","short":"S. Chakraborty, S. Dziembowski, J.B. Nielsen, in:, Advances in Cryptology – CRYPTO 2020, Springer Nature, 2020, pp. 732–762.","apa":"Chakraborty, S., Dziembowski, S., & Nielsen, J. B. (2020). Reverse firewalls for actively secure MPCs. In Advances in Cryptology – CRYPTO 2020 (Vol. 12171, pp. 732–762). Santa Barbara, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-030-56880-1_26","ama":"Chakraborty S, Dziembowski S, Nielsen JB. Reverse firewalls for actively secure MPCs. In: Advances in Cryptology – CRYPTO 2020. Vol 12171. Springer Nature; 2020:732-762. doi:10.1007/978-3-030-56880-1_26","chicago":"Chakraborty, Suvradip, Stefan Dziembowski, and Jesper Buus Nielsen. “Reverse Firewalls for Actively Secure MPCs.” In Advances in Cryptology – CRYPTO 2020, 12171:732–62. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-56880-1_26.","ista":"Chakraborty S, Dziembowski S, Nielsen JB. 2020. Reverse firewalls for actively secure MPCs. Advances in Cryptology – CRYPTO 2020. CRYPTO: Annual International Cryptology Conference, LNCS, vol. 12171, 732–762."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"page":"732-762","date_created":"2020-08-30T22:01:12Z","doi":"10.1007/978-3-030-56880-1_26","date_published":"2020-08-10T00:00:00Z","year":"2020","publication":"Advances in Cryptology – CRYPTO 2020","day":"10","oa":1,"quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"We would like to thank the anonymous reviewers for their helpful comments and suggestions. The work was initiated while the first author was in IIT Madras, India. Part of this work was done while the author was visiting the University of Warsaw. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT) and from the Foundation for Polish Science under grant TEAM/2016-1/4 founded within the UE 2014–2020 Smart Growth Operational Program. The last author was supported by the Independent Research Fund Denmark project BETHE and the Concordium Blockchain Research Center, Aarhus University, Denmark."},{"publication_status":"published","publication_identifier":{"eissn":["16113349"],"isbn":["9783030453732"],"issn":["03029743"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":12110,"abstract":[{"lang":"eng","text":"Discrete Gaussian distributions over lattices are central to lattice-based cryptography, and to the computational and mathematical aspects of lattices more broadly. The literature contains a wealth of useful theorems about the behavior of discrete Gaussians under convolutions and related operations. Yet despite their structural similarities, most of these theorems are formally incomparable, and their proofs tend to be monolithic and written nearly “from scratch,” making them unnecessarily hard to verify, understand, and extend.\r\nIn this work we present a modular framework for analyzing linear operations on discrete Gaussian distributions. The framework abstracts away the particulars of Gaussians, and usually reduces proofs to the choice of appropriate linear transformations and elementary linear algebra. To showcase the approach, we establish several general properties of discrete Gaussians, and show how to obtain all prior convolution theorems (along with some new ones) as straightforward corollaries. As another application, we describe a self-reduction for Learning With Errors (LWE) that uses a fixed number of samples to generate an unlimited number of additional ones (having somewhat larger error). The distinguishing features of our reduction are its simple analysis in our framework, and its exclusive use of discrete Gaussians without any loss in parameters relative to a prior mixed discrete-and-continuous approach.\r\nAs a contribution of independent interest, for subgaussian random matrices we prove a singular value concentration bound with explicitly stated constants, and we give tighter heuristics for specific distributions that are commonly used for generating lattice trapdoors. These bounds yield improvements in the concrete bit-security estimates for trapdoor lattice cryptosystems."}],"oa_version":"Preprint","main_file_link":[{"url":"https://eprint.iacr.org/2020/337","open_access":"1"}],"alternative_title":["LNCS"],"scopus_import":"1","intvolume":" 12110","month":"05","date_updated":"2023-02-23T13:31:06Z","department":[{"_id":"KrPi"}],"_id":"8339","conference":{"name":"PKC: Public-Key Cryptography","location":"Edinburgh, United Kingdom","end_date":"2020-05-07","start_date":"2020-05-04"},"type":"conference","status":"public","year":"2020","publication":"23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography","day":"15","page":"623-651","date_created":"2020-09-06T22:01:13Z","doi":"10.1007/978-3-030-45374-9_21","date_published":"2020-05-15T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"Springer Nature","citation":{"ista":"Genise N, Micciancio D, Peikert C, Walter M. 2020. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 12110, 623–651.","chicago":"Genise, Nicholas, Daniele Micciancio, Chris Peikert, and Michael Walter. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, 12110:623–51. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45374-9_21.","ieee":"N. Genise, D. Micciancio, C. Peikert, and M. Walter, “Improved discrete Gaussian and subgaussian analysis for lattice cryptography,” in 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, Edinburgh, United Kingdom, 2020, vol. 12110, pp. 623–651.","short":"N. Genise, D. Micciancio, C. Peikert, M. Walter, in:, 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, Springer Nature, 2020, pp. 623–651.","apa":"Genise, N., Micciancio, D., Peikert, C., & Walter, M. (2020). Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography (Vol. 12110, pp. 623–651). Edinburgh, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-030-45374-9_21","ama":"Genise N, Micciancio D, Peikert C, Walter M. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In: 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. Vol 12110. Springer Nature; 2020:623-651. doi:10.1007/978-3-030-45374-9_21","mla":"Genise, Nicholas, et al. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, vol. 12110, Springer Nature, 2020, pp. 623–51, doi:10.1007/978-3-030-45374-9_21."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"full_name":"Genise, Nicholas","last_name":"Genise","first_name":"Nicholas"},{"last_name":"Micciancio","full_name":"Micciancio, Daniele","first_name":"Daniele"},{"first_name":"Chris","full_name":"Peikert, Chris","last_name":"Peikert"},{"first_name":"Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3186-2482","full_name":"Walter, Michael","last_name":"Walter"}],"title":"Improved discrete Gaussian and subgaussian analysis for lattice cryptography","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}]},{"date_updated":"2021-01-12T08:20:06Z","department":[{"_id":"ToHe"}],"_id":"8572","status":"public","type":"conference","conference":{"start_date":"2020-07-12","end_date":"2020-07-12","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems"},"language":[{"iso":"eng"}],"publication_status":"published","volume":74,"ec_funded":1,"oa_version":"Published Version","abstract":[{"text":"We present the results of the ARCH 2020 friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. In its fourth edition, eight tools have been applied to solve eight different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, C2E2, HyDRA, Hylaa, Hylaa-Continuous, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.","lang":"eng"}],"month":"09","intvolume":" 74","main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/download/DRpS"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Althoff, Matthias, Stanley Bak, Zongnan Bao, Marcelo Forets, Goran Frehse, Daniel Freire, Niklas Kochdumper, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” In EPiC Series in Computing, 74:16–48. EasyChair, 2020. https://doi.org/10.29007/7dt2.","ista":"Althoff M, Bak S, Bao Z, Forets M, Frehse G, Freire D, Kochdumper N, Li Y, Mitra S, Ray R, Schilling C, Schupp S, Wetzlinger M. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 16–48.","mla":"Althoff, Matthias, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 16–48, doi:10.29007/7dt2.","ama":"Althoff M, Bak S, Bao Z, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:16-48. doi:10.29007/7dt2","apa":"Althoff, M., Bak, S., Bao, Z., Forets, M., Frehse, G., Freire, D., … Wetzlinger, M. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In EPiC Series in Computing (Vol. 74, pp. 16–48). EasyChair. https://doi.org/10.29007/7dt2","short":"M. Althoff, S. Bak, Z. Bao, M. Forets, G. Frehse, D. Freire, N. Kochdumper, Y. Li, S. Mitra, R. Ray, C. Schilling, S. Schupp, M. Wetzlinger, in:, EPiC Series in Computing, EasyChair, 2020, pp. 16–48.","ieee":"M. Althoff et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 16–48."},"title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics","author":[{"first_name":"Matthias","last_name":"Althoff","full_name":"Althoff, Matthias"},{"first_name":"Stanley","last_name":"Bak","full_name":"Bak, Stanley"},{"full_name":"Bao, Zongnan","last_name":"Bao","first_name":"Zongnan"},{"last_name":"Forets","full_name":"Forets, Marcelo","first_name":"Marcelo"},{"full_name":"Frehse, Goran","last_name":"Frehse","first_name":"Goran"},{"first_name":"Daniel","last_name":"Freire","full_name":"Freire, Daniel"},{"first_name":"Niklas","full_name":"Kochdumper, Niklas","last_name":"Kochdumper"},{"full_name":"Li, Yangge","last_name":"Li","first_name":"Yangge"},{"first_name":"Sayan","full_name":"Mitra, Sayan","last_name":"Mitra"},{"last_name":"Ray","full_name":"Ray, Rajarshi","first_name":"Rajarshi"},{"last_name":"Schilling","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"},{"last_name":"Schupp","full_name":"Schupp, Stefan","first_name":"Stefan"},{"first_name":"Mark","full_name":"Wetzlinger, Mark","last_name":"Wetzlinger"}],"article_processing_charge":"No","project":[{"grant_number":"Z00312","name":"The Wittgenstein Prize","_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"day":"25","publication":"EPiC Series in Computing","year":"2020","doi":"10.29007/7dt2","date_published":"2020-09-25T00:00:00Z","date_created":"2020-09-26T14:49:43Z","page":"16-48","acknowledgement":"The authors gratefully acknowledge financial support by the European Commission project\r\njustITSELF under grant number 817629, by the Austrian Science Fund (FWF) under grant\r\nZ211-N23 (Wittgenstein Award), by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411, and by the\r\nScience and Engineering Research Board (SERB) project with file number IMP/2018/000523.\r\nThis material is based upon work supported by the Air Force Office of Scientific Research under\r\naward number FA9550-19-1-0288. Any opinions, finding, and conclusions or recommendations\r\nexpressed in this material are those of the author(s) and do not necessarily reflect the views of\r\nthe United States Air Force.","publisher":"EasyChair","quality_controlled":"1","oa":1},{"day":"25","publication":"EPiC Series in Computing","year":"2020","doi":"10.29007/zkf6","date_published":"2020-09-25T00:00:00Z","date_created":"2020-09-26T14:41:29Z","page":"49-75","acknowledgement":"Christian Schilling acknowledges support in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award) and the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411.","publisher":"EasyChair","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Geretti, Luca, Julien Alexandre Dit Sandretto, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Pieter Collins, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In EPiC Series in Computing, 74:49–75. EasyChair, 2020. https://doi.org/10.29007/zkf6.","ista":"Geretti L, Alexandre Dit Sandretto J, Althoff M, Benet L, Chapoutot A, Chen X, Collins P, Forets M, Freire D, Immler F, Kochdumper N, Sanders D, Schilling C. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 49–75.","mla":"Geretti, Luca, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 49–75, doi:10.29007/zkf6.","ieee":"L. Geretti et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 49–75.","short":"L. Geretti, J. Alexandre Dit Sandretto, M. Althoff, L. Benet, A. Chapoutot, X. Chen, P. Collins, M. Forets, D. Freire, F. Immler, N. Kochdumper, D. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair, 2020, pp. 49–75.","apa":"Geretti, L., Alexandre Dit Sandretto, J., Althoff, M., Benet, L., Chapoutot, A., Chen, X., … Schilling, C. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 74, pp. 49–75). EasyChair. https://doi.org/10.29007/zkf6","ama":"Geretti L, Alexandre Dit Sandretto J, Althoff M, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:49-75. doi:10.29007/zkf6"},"title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics","author":[{"first_name":"Luca","full_name":"Geretti, Luca","last_name":"Geretti"},{"last_name":"Alexandre Dit Sandretto","full_name":"Alexandre Dit Sandretto, Julien","first_name":"Julien"},{"first_name":"Matthias","last_name":"Althoff","full_name":"Althoff, Matthias"},{"first_name":"Luis","full_name":"Benet, Luis","last_name":"Benet"},{"first_name":"Alexandre","last_name":"Chapoutot","full_name":"Chapoutot, Alexandre"},{"last_name":"Chen","full_name":"Chen, Xin","first_name":"Xin"},{"first_name":"Pieter","full_name":"Collins, Pieter","last_name":"Collins"},{"first_name":"Marcelo","full_name":"Forets, Marcelo","last_name":"Forets"},{"first_name":"Daniel","last_name":"Freire","full_name":"Freire, Daniel"},{"first_name":"Fabian","last_name":"Immler","full_name":"Immler, Fabian"},{"first_name":"Niklas","full_name":"Kochdumper, Niklas","last_name":"Kochdumper"},{"first_name":"David","last_name":"Sanders","full_name":"Sanders, David"},{"full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","last_name":"Schilling","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":74,"ec_funded":1,"oa_version":"Published Version","abstract":[{"text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools.","lang":"eng"}],"month":"09","intvolume":" 74","main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/download/nrdD"}],"date_updated":"2021-01-12T08:20:06Z","department":[{"_id":"ToHe"}],"_id":"8571","status":"public","type":"conference","conference":{"start_date":"2020-07-12","end_date":"2020-07-12","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems"}}]