  While reachability analysis is one of the most promising approaches for
formal verification of dynamic systems, a major disadvantage preventing a more
widespread application is the requirement to manually tune algorithm parameters
such as the time step size. Manual tuning is especially problematic if one aims
to verify that the system satisfies complicated specifications described by
signal temporal logic formulas since the effect the tightness of the reachable
set has on the satisfaction of the specification is often non-trivial to see
for humans. We address this problem with a fully-automated verifier for linear
systems, which automatically refines all parameters for reachability analysis
until it can either prove or disprove that the system satisfies a signal
temporal logic formula for all initial states and all uncertain inputs. Our
verifier combines reachset temporal logic with dependency preservation to
obtain a model checking approach whose over-approximation error converges to
zero for adequately tuned parameters. While we in this work focus on linear
systems for simplicity, the general concept we present can equivalently be
applied for nonlinear and hybrid systems.
