MGHyper: Checking Satisfiability of HyperLTL Formulas Beyond the ∃^*∀^* Fragment

03/26/2019
by   Bernd Finkbeiner, et al.
0

Hyperproperties are properties that refer to multiple computation traces. This includes many information-flow security policies, such as observational determinism, (generalized) noninterference, and noninference, and other system properties like symmetry or Hamming distances between in error-resistant codes. We introduce MGHyper, a tool for automatic satisfiability checking and model generation for hyperproperties expressed in HyperLTL. Unlike previous satisfiability checkers, MGHyper is not limited to the decidable ∃^* ∀^* fragment of HyperLTL, but provides a semi-decisionprocedure for the full logic. An important application of MGHyper is to automatically check equivalences between different hyperproperties (and different formalizations of the same hyperproperty) and to build counterexamples that disprove a certain claimed implication. We describe the semi-decisionprocedure implemented in MGHyper and report on experimental results obtained both with typical hyperproperties from the literature and with randomly generated HyperLTL formulas.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/15/2020

Verifying Hyperliveness

HyperLTL is an extension of linear-time temporal logic for the specifica...
research
01/06/2018

QBM - Mapping User-Specified Functions to Programmable Logic through a QBF Satisfiability Problem

This is a brief overview on the background behind the test set formulas ...
research
07/11/2019

The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas

HyperLTL, the extension of Linear Temporal Logic by trace quantifiers, i...
research
04/28/2022

Linear Temporal Logic Modulo Theories over Finite Traces (Extended Version)

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where...
research
05/31/2019

Synthesizing Reactive Systems from Hyperproperties

We study the reactive synthesis problem for hyperproperties given as for...
research
01/15/2019

Optimal Satisfiability Checking for Arithmetic μ-Calculi

The coalgebraic μ-calculus provides a generic semantic framework for fix...
research
07/23/2016

Satisfiability Checking and Symbolic Computation

Symbolic Computation and Satisfiability Checking are viewed as individua...

Please sign up or login with your details

Forgot password? Click here to reset