License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2020.50
URN: urn:nbn:de:0030-drops-128628
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12862/
Go to the corresponding LIPIcs Volume Portal


Gutsfeld, Jens Oliver ; Müller-Olm, Markus ; Ohrem, Christoph

Propositional Dynamic Logic for Hyperproperties

pdf-format:
LIPIcs-CONCUR-2020-50.pdf (0.6 MB)


Abstract

Information security properties of reactive systems like non-interference often require relating different executions of the system to each other and following them simultaneously. Such hyperproperties can also be useful in other contexts, e.g., when analysing properties of distributed systems like linearizability. Since common logics like LTL, CTL, or the modal μ-calculus cannot express hyperproperties, the hyperlogics HyperLTL and HyperCTL^* were developed to cure this defect. However, these logics are not able to express arbitrary ω-regular properties. In this paper, we introduce HyperPDL-Δ, an adaptation of the Propositional Dynamic Logic of Fischer and Ladner for hyperproperties, in order to remove this limitation. Using an elegant automata-theoretic framework, we show that HyperPDL-Δ model checking is asymptotically not more expensive than HyperCTL^* model checking, despite its vastly increased expressive power. We further investigate fragments of HyperPDL-Δ with regard to satisfiability checking.

BibTeX - Entry

@InProceedings{gutsfeld_et_al:LIPIcs:2020:12862,
  author =	{Jens Oliver Gutsfeld and Markus M{\"u}ller-Olm and Christoph Ohrem},
  title =	{{Propositional Dynamic Logic for Hyperproperties}},
  booktitle =	{31st International Conference on Concurrency Theory (CONCUR 2020)},
  pages =	{50:1--50:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-160-3},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{171},
  editor =	{Igor Konnov and Laura Kov{\'a}cs},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12862},
  URN =		{urn:nbn:de:0030-drops-128628},
  doi =		{10.4230/LIPIcs.CONCUR.2020.50},
  annote =	{Keywords: Hyperlogics, Hyperproperties, Model Checking, Automata}
}

Keywords: Hyperlogics, Hyperproperties, Model Checking, Automata
Collection: 31st International Conference on Concurrency Theory (CONCUR 2020)
Issue Date: 2020
Date of publication: 26.08.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI