The linear-hyper-branching spectrum of temporal logics
-
Bernd Finkbeiner
Bernd Finkbeiner studied Computer Science at Technische Universität München (Diplom 1996), the University of Delaware (M.Sc. 1995), and Stanford University (Ph.D. 2002). Since 2002, he is a Professor for Computer Science at Saarland University. His research interests are the specification and automatic verification and synthesis of reactive systems.
Universität des Saarlandes, 66123 Saarbrücken, Germany
and
Markus N. Rabe
Markus N. Rabe studied Computer Science at Saarland University (B.Sc. 2008, M.Sc. 2009). Since 2010, he is a Ph.D. student in Computer Science at Saarland University. His research interests are the specification and algorithmic verification of security-relevant systems and of probabilistic systems.
Universität des Saarlandes, Fachrichtung Informatik, 66123 Saarbrücken, Germany
Abstract
The family of temporal logics has recently been extended with logics for the specification of hyperproperties, such as noninterference or observational determinism. Hyperproperties relate multiple computation paths of a system by requiring that they satisfy a certain relationship, such as an identical valuation of the low-security outputs. Unlike classic temporal logics like LTL or CTL*, which refer to one computation path at a time, temporal logics for hyperproperties like HyperLTL and HyperCTL* can express such relationships by explicitly quantifying over multiple computation paths simultaneously. In this paper, we study the extended spectrum of temporal logics by relating the new logics to the linear-branching spectrum of process equivalences.
About the authors
Bernd Finkbeiner studied Computer Science at Technische Universität München (Diplom 1996), the University of Delaware (M.Sc. 1995), and Stanford University (Ph.D. 2002). Since 2002, he is a Professor for Computer Science at Saarland University. His research interests are the specification and automatic verification and synthesis of reactive systems.
Universität des Saarlandes, 66123 Saarbrücken, Germany
Markus N. Rabe studied Computer Science at Saarland University (B.Sc. 2008, M.Sc. 2009). Since 2010, he is a Ph.D. student in Computer Science at Saarland University. His research interests are the specification and algorithmic verification of security-relevant systems and of probabilistic systems.
Universität des Saarlandes, Fachrichtung Informatik, 66123 Saarbrücken, Germany
©2014 Walter de Gruyter Berlin/Boston
Articles in the same Issue
- Frontmatter
- Editorial
- Reliably secure software systems
- Special Issue
- Making security type systems less ad hoc
- The linear-hyper-branching spectrum of temporal logics
- Checking probabilistic noninterference using JOANA
- Confidentiality for Android apps: Specification and verification
- Information flow control for workflow management systems
- Security in e-voting
- Self-Portrayals of GI Junior Fellows
- Designing networks for challenging applications
- Theory for processing data on the Web
- Distinguished Dissertations
- On the insecurity of XML Security
Articles in the same Issue
- Frontmatter
- Editorial
- Reliably secure software systems
- Special Issue
- Making security type systems less ad hoc
- The linear-hyper-branching spectrum of temporal logics
- Checking probabilistic noninterference using JOANA
- Confidentiality for Android apps: Specification and verification
- Information flow control for workflow management systems
- Security in e-voting
- Self-Portrayals of GI Junior Fellows
- Designing networks for challenging applications
- Theory for processing data on the Web
- Distinguished Dissertations
- On the insecurity of XML Security
