Model Checking Quantitative Hyperproperties

05/31/2019
by   Bernd Finkbeiner, et al.
0

Hyperproperties are properties of sets of computation traces. In this paper, we study quantitative hyperproperties, which we define as hyperproperties that express a bound on the number of traces that may appear in a certain relation. For example, quantitative non-interference limits the amount of information about certain secret inputs that is leaked through the observable outputs of a system. Quantitative non-interference thus bounds the number of traces that have the same observable input but different observable output. We study quantitative hyperproperties in the setting of HyperLTL, a temporal logic for hyperproperties. We show that, while quantitative hyperproperties can be expressed in HyperLTL, the running time of the HyperLTL model checking algorithm is, depending on the type of property, exponential or even doubly exponential in the quantitative bound. We improve this complexity with a new model checking algorithm based on model-counting. The new algorithm needs only logarithmic space in the bound and therefore improves, depending on the property, exponentially or even doubly exponentially over the model checking algorithm of HyperLTL. In the worst case, the new algorithm needs polynomial space in the size of the system. Our Max#Sat-based prototype implementation demonstrates, however, that the counting approach is viable on systems with nontrivial quantitative information flow requirements such as a passcode checker.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/02/2023

Model Checking Time Window Temporal Logic for Hyperproperties

Hyperproperties extend trace properties to express properties of sets of...
research
08/27/2019

A Type-Based HFL Model Checking Algorithm

Higher-order modal fixpoint logic (HFL) is a higher-order extension of t...
research
04/28/2021

A Temporal Logic for Asynchronous Hyperproperties

Hyperproperties are properties of computational systems that require mor...
research
09/18/2020

Bounded Model Checking for Hyperproperties

This paper introduces the first bounded model checking (BMC) algorithm f...
research
01/17/2019

Flat Model Checking for Counting LTL Using Quantifier-Free Presburger Arithmetic

This paper presents an approximation approach to verifying counter syste...
research
01/15/2023

Efficient Loop Conditions for Bounded Model Checking Hyperproperties

Bounded model checking (BMC) is an effective technique for hunting bugs ...
research
01/11/2018

Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence

It is well known that the length of a beta-reduction sequence of a simpl...

Please sign up or login with your details

Forgot password? Click here to reset