--- res: bibo_abstract: - 'We present JuliaReach, a toolbox for set-based reachability analysis of dynamical systems. JuliaReach consists of two main packages: Reachability, containing implementations of reachability algorithms for continuous and hybrid systems, and LazySets, a standalone library that implements state-of-the-art algorithms for calculus with convex sets. The library offers both concrete and lazy set representations, where the latter stands for the ability to delay set computations until they are needed. The choice of the programming language Julia and the accompanying documentation of our toolbox allow researchers to easily translate set-based algorithms from mathematics to software in a platform-independent way, while achieving runtime performance that is comparable to statically compiled languages. Combining lazy operations in high dimensions and explicit computations in low dimensions, JuliaReach can be applied to solve complex, large-scale problems.@eng' bibo_authorlist: - foaf_Person: foaf_givenName: Sergiy foaf_name: Bogomolov, Sergiy foaf_surname: Bogomolov foaf_workInfoHomepage: http://www.librecat.org/personId=369D9A44-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0002-0686-0365 - foaf_Person: foaf_givenName: Marcelo foaf_name: Forets, Marcelo foaf_surname: Forets - foaf_Person: foaf_givenName: Goran foaf_name: Frehse, Goran foaf_surname: Frehse - foaf_Person: foaf_givenName: Kostiantyn foaf_name: Potomkin, Kostiantyn foaf_surname: Potomkin - foaf_Person: foaf_givenName: Christian foaf_name: Schilling, Christian foaf_surname: Schilling foaf_workInfoHomepage: http://www.librecat.org/personId=3A2F4DCE-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0003-3658-1065 bibo_doi: 10.1145/3302504.3311804 bibo_volume: 22 dct_date: 2019^xs_gYear dct_identifier: - UT:000516713900005 dct_isPartOf: - http://id.crossref.org/issn/9781450362825 dct_language: eng dct_publisher: ACM@ dct_subject: - reachability analysis - hybrid systems - lazy computation dct_title: 'JuliaReach: A toolbox for set-based reachability@' ...