LazySets.jl: Scalable Symbolic-Numeric Set Computations
Not on the map. Why?
Abstract (arXiv)
LazySets.jl is a Julia library that provides ways to symbolically represent sets of points as geometric shapes, with a special focus on convex sets and polyhedral approximations. LazySets provides methods to apply common set operations, convert between different set representations, and efficiently compute with sets in high dimensions using specialized algorithms based on the set types. LazySets is the core library of JuliaReach, a cutting-edge software addressing the fundamental problem of reachability analysis: computing the set of states that are reachable by a dynamical system from all initial states and for all admissible inputs and parameters. While the library was originally designed for reachability and formal verification, its scope goes beyond such topics. LazySets is an easy-to-use, general-purpose and scalable library for computations that mix symbolics and numerics. In this article we showcase the basic functionality, highlighting some of the key design choices.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 4 Oct 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 0; 2025: 1.
4 papers.
- 2025Guaranteed prediction sets for functional surrogate models30 Jan 2025
- 2023The inverse problem for neural networks27 Aug 2023
- 2022Synthesis of Parametric Hybrid Automata from Time Series13 Jul 2022
- 2021Verification of Neural-Network Control Systems by Integrating Taylor Models and Zonotopes16 Dec 2021