{"payload":{"pageCount":2,"repositories":[{"type":"Public","name":"NeuralNetworkReachability.jl","owner":"JuliaReach","isFork":false,"description":"Set propagation for neural networks in Julia","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":5,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-25T21:23:40.343Z"}},{"type":"Public","name":"ControllerFormats.jl","owner":"JuliaReach","isFork":false,"description":"Controller formats in Julia","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-25T17:50:58.969Z"}},{"type":"Public","name":"LazySets.jl","owner":"JuliaReach","isFork":false,"description":"Scalable symbolic-numeric set computations in Julia","topicNames":["calculus","geometry","julia","computational-geometry","convex-hull","lazy-evaluation","polygons","projections","formal-verification","polyhedra"],"topicsNotShown":7,"allTopics":["calculus","geometry","julia","computational-geometry","convex-hull","lazy-evaluation","polygons","projections","formal-verification","polyhedra","sets","minkowski-sum","reachability-analysis","convex-sets","geometry-algorithms","zonotope","set-propagation"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":368,"starsCount":226,"forksCount":32,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-19T05:00:01.964Z"}},{"type":"Public","name":"IntervalMatrices.jl","owner":"JuliaReach","isFork":false,"description":"Matrices with interval coefficients in Julia","topicNames":["interval-arithmetic","intervals","matrix-computations","reachability-analysis","matrix-exponential"],"topicsNotShown":0,"allTopics":["interval-arithmetic","intervals","matrix-computations","reachability-analysis","matrix-exponential"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":7,"issueCount":18,"starsCount":18,"forksCount":2,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T21:34:15.809Z"}},{"type":"Public","name":"ReachabilityAnalysis.jl","owner":"JuliaReach","isFork":false,"description":"Computing reachable states of dynamical systems in Julia","topicNames":["julia","verification","ode","simulations","dynamical-systems","control-systems","differential-equations","interval-arithmetic","hybrid-systems","formal-verification"],"topicsNotShown":7,"allTopics":["julia","verification","ode","simulations","dynamical-systems","control-systems","differential-equations","interval-arithmetic","hybrid-systems","formal-verification","numerical-analysis","cyber-physical-systems","reachability-analysis","automatic-control","flowpipe","rigorous-numerics","set-propagation"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":3,"issueCount":144,"starsCount":186,"forksCount":17,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T20:55:35.250Z"}},{"type":"Public","name":"ReachabilityModels.jl","owner":"JuliaReach","isFork":false,"description":"JuliaReach model library","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":29,"starsCount":5,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T18:44:00.848Z"}},{"type":"Public","name":"BernsteinExpansions.jl","owner":"JuliaReach","isFork":false,"description":"Computing Bernstein coefficients of multivariate polynomials in Julia","topicNames":["polynomials","intervals","bernstein"],"topicsNotShown":0,"allTopics":["polynomials","intervals","bernstein"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":8,"starsCount":10,"forksCount":2,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T16:16:46.504Z"}},{"type":"Public","name":"MathematicalSystems.jl","owner":"JuliaReach","isFork":false,"description":"Systems definitions in Julia","topicNames":["julia","dynamical-systems"],"topicsNotShown":0,"allTopics":["julia","dynamical-systems"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":29,"starsCount":42,"forksCount":6,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T16:11:46.901Z"}},{"type":"Public","name":"MathematicalPredicates.jl","owner":"JuliaReach","isFork":false,"description":"Predicate definitions in Julia","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":2,"starsCount":4,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T14:54:15.406Z"}},{"type":"Public","name":"MathematicalSets.jl","owner":"JuliaReach","isFork":false,"description":"Set definitions in Julia","topicNames":["julia","sets"],"topicsNotShown":0,"allTopics":["julia","sets"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":8,"starsCount":5,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T13:36:20.561Z"}},{"type":"Public template","name":"JuliaReachTemplatePkg.jl","owner":"JuliaReach","isFork":false,"description":"JuliaReach package template","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T11:21:05.705Z"}},{"type":"Public","name":"ReachabilityBenchmarks","owner":"JuliaReach","isFork":false,"description":"JuliaReach benchmark suite","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":7,"issueCount":21,"starsCount":4,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T11:01:42.152Z"}},{"type":"Public","name":"RangeEnclosures.jl","owner":"JuliaReach","isFork":false,"description":"Enclosures of real-valued functions in Julia","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":12,"starsCount":22,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T10:37:09.426Z"}},{"type":"Public","name":"SpaceExParser.jl","owner":"JuliaReach","isFork":false,"description":"Parser for the SpaceEx modeling language in Julia","topicNames":["hybrid-systems","model-based-design","spaceex"],"topicsNotShown":0,"allTopics":["hybrid-systems","model-based-design","spaceex"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":3,"issueCount":15,"starsCount":7,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T08:46:20.447Z"}},{"type":"Public","name":"ClosedLoopReachability.jl","owner":"JuliaReach","isFork":false,"description":"Reachability analysis for closed-loop control systems in Julia","topicNames":["neural-network","robotics","control-systems","differential-equations","hybrid-systems","robustness"],"topicsNotShown":0,"allTopics":["neural-network","robotics","control-systems","differential-equations","hybrid-systems","robustness"],"primaryLanguage":{"name":"Polar","color":"#ae81ff"},"pullRequestCount":0,"issueCount":7,"starsCount":44,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T07:30:55.018Z"}},{"type":"Public","name":"JuliaReachDevDocs","owner":"JuliaReach","isFork":false,"description":"JuliaReach development guidelines and resources","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":3,"starsCount":1,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T06:25:04.749Z"}},{"type":"Public","name":"CarlemanLinearization.jl","owner":"JuliaReach","isFork":false,"description":"Carleman linearization for dynamical systems in Julia","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":2,"starsCount":7,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T05:43:27.049Z"}},{"type":"Public","name":"ReachabilityBase.jl","owner":"JuliaReach","isFork":false,"description":"Base library for the JuliaReach ecosystem","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":4,"starsCount":2,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-06T05:20:53.772Z"}},{"type":"Public","name":"ARCH2023_AINNCS_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability package for ARCH-COMP 2023 AINNCS","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-12T07:54:37.332Z"}},{"type":"Public","name":"ARCH2023_NLN_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability package for ARCH-COMP 2023 NLN","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-12T07:54:34.141Z"}},{"type":"Public","name":"ARCH2023_AFF_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability package for ARCH-COMP 2023 AFF","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-12T07:54:30.595Z"}},{"type":"Public","name":"Flowstar.jl","owner":"JuliaReach","isFork":false,"description":"Julia wrapper for Flow*","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":3,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-15T17:13:51.537Z"}},{"type":"Public","name":"Notebooks","owner":"JuliaReach","isFork":false,"description":"JuliaReach notebooks","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-10T12:58:24.868Z"}},{"type":"Public","name":"AISoLA2023_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability package for AISoLA 2023","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-25T20:26:41.760Z"}},{"type":"Public","name":"ARCH2022_AINNCS_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability evaluation package for the ARCH2022 AINNCS competition","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-20T06:50:24.095Z"}},{"type":"Public","name":"ARCH2022_NLN_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability evaluation package for the ARCH2022 NLN competition","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-20T06:50:17.255Z"}},{"type":"Public","name":"ARCH2022_AFF_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability evaluation package for the ARCH2022 AFF competition","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-20T06:49:48.320Z"}},{"type":"Public","name":"ARCH2021_AINNCS_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability evaluation package for the ARCH2021 AI/NNCS competition","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-20T06:49:10.458Z"}},{"type":"Public","name":"ARCH2021_NLN_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability evaluation package for the ARCH2021 NLN competition","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-20T06:49:04.084Z"}},{"type":"Public","name":"ARCH2021_AFF_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability evaluation package for the ARCH2021 AFF competition","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-20T06:48:56.733Z"}}],"repositoryCount":54,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}