  We study the repair problem for hyperproperties specified in the temporal
logic HyperLTL. Hyperproperties are system properties that relate multiple
computation traces. This class of properties includes information flow policies
like noninterference and observational determinism. The repair problem is to
find, for a given Kripke structure, a substructure that satisfies a given
specification. We show that the repair problem is decidable for HyperLTL
specifications and finite-state Kripke structures. We provide a detailed
complexity analysis for different fragments of HyperLTL and different system
types: tree-shaped, acyclic, and general Kripke structures.
