Reasoning about Quality in Hyperproperties
By: Samuel Graepler, Benjamin Monmege, Jean-Marc Talbot
Potential Business Impact:
Makes computer security checks more realistic.
Hyperproperties allow one to specify properties of systems that inherently involve not single executions of the system, but several of them at once: observational determinism and non-inference are two examples of such properties used to study the security of systems. Logics like HyperLTL have been studied in the past to model check hyperproperties of systems. However, most of the time, requiring strict security properties is actually ineffective as systems do not meet such requirements. To overcome this issue, we introduce qualitative reasoning in HyperLTL, inspired by a similar work on LTL by Almagor, Boker and Kupferman where a formula has a value in the interval [0, 1], obtained by considering either a propositional quality (how much the specification is satisfied), or a temporal quality (when the specification is satisfied). We show decidability of the approximated model checking problem, as well as the model checking of large fragments.
Similar Papers
Explainability Requirements as Hyperproperties
Logic in Computer Science
Makes AI explain its decisions to people.
On Hyperproperty Verification, Quantifier Alternations, and Games under Partial Information
Logic in Computer Science
Checks computer programs with tricky rules.
Flavors of Quantifiers in Hyperlogics
Logic in Computer Science
Checks computer programs for hidden bugs.