论文库

原文摘要

In recent years, hyperproperties (i.e., properties of sets of traces) have been identified as a crucial concept for capturing information-flow security policies and knowledge of agents in distributed systems. In the synchronous linear-time setting, a well-known approach for the specification of hyperproperties is based on the set semantics of standard LTL. The resulting logic (TeamLTL) inherits the powerful split interpretation of disjunction from dependence logic. In this paper, we introduce a novel team semantics of LTL inspired by inquisitive logic, whose main features are the intuitionistic interpretation of implication and the inquisitive semantics of disjunction. We investigate expressiveness, decidability, and complexity issues of the novel logic that we call InqLTL and its extension with strong negation. We show that InqLTL with strong negation is highly undecidable and strictly less expressive than TeamLTL with strong negation. On the positive side, we identify a meaningful fragment of InqLTL with a decidable model-checking problem that can express relevant classes of hyperproperties. To the best of our knowledge, this fragment represents the first hyper logic with a decidable model-checking problem that allows unrestricted use of temporal modalities and conditional second-order universal quantification over system refinements via intuitionistic implication.