Software Verification of Hyperproperties Beyond k-Safety

Temporal hyperproperties are system properties that relate multiple execution traces. For (finite-state) hardware, temporal supported by model checking algorithms, and tools for general logics like HyperLTL exist. (infinite-state) software, the analysis of has, so far, been limited to $k$-safety properties, i.e., stipulate absence a bad interaction between any $k$ In this paper, we present an automated method verification $\forall^k\exists^l$-safety in infinite-state systems. A property stipulates traces, there exist $l$ traces such resulting $k+l$ do not interact badly. This combination universal existential quantification enables us express many beyond $k$-safety, including, example, generalized non-interference or program refinement. Our is based on strategy-based instantiation trace combined with reduction, both context fixed predicate abstraction. Notably, our framework allows mutual dependence strategy reduction.