Deciding Hyperproperties release_ki7zjsh6kfhxnlj2nwnd65uwb4

by Bernd Finkbeiner, Christopher Hahn

Released as a article .

2016  

Abstract

Hyperproperties, like observational determinism or symmetry, cannot be expressed as properties of individual computation traces, because they describe a relation between multiple computation traces. HyperLTL is a temporal logic that captures such relations through trace variables, which are introduced through existential and universal trace quantifiers and can be used to refer to multiple computations at the same time. In this paper, we study the satisfiability problem of HyperLTL. We show that the problem is PSPACE-complete for alternation-free formulas (and, hence, no more expensive than LTL satisfiability), EXPSPACE-complete for exists-forall-formulas, and undecidable for forall-exists-formulas. Many practical hyperproperties can be expressed as alternation-free formulas. Our results show that both satisfiability and implication are decidable for such properties.
In text/plain format

Archived Files and Locations

application/pdf  252.9 kB
file_cmgztbkodfa2pk63yz2d3xqt2u
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-06-22
Version   v1
Language   en ?
arXiv  1606.07047v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 49127b94-d407-40b1-8d34-af68a5aaee3c
API URL: JSON