Timed hyperproperties
type: Item
instance of: scholarly article
title: Timed hyperproperties
author: Hsi-Ming Ho
author: Ruoyu Zhou
author: Timothy M. Jones
published in: Information and Computation
publication date: 2021-09-21T00:00:00Z
full work available at URL: IandC accepted manuscript.pdf
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7398015
zbMATH Keywords: timed automata
zbMATH Keywords: temporal logics
zbMATH Keywords: cybersecurity
describes a project that uses: SPIN
describes a project that uses: SPOT
describes a project that uses: NuSMV
describes a project that uses: Uppaal
MaRDI profile type: Publication
OpenAlex ID: W4214833524
cites work: Q3698787
cites work: Q4804909
cites work: A theory of timed automata
cites work: A really temporal logic
cites work: The benefits of relaxing punctuality
cites work: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
cites work: System-level non-interference of constant-time cryptography. I: Model
cites work: Q4264103
cites work: Algorithms for model checking HyperLTL and HyperCTL\(^*\)
cites work: Uppaal in a nutshell
cites work: Some Recent Results in Metric Temporal Logic
cites work: Non-interference control synthesis for security timed automata
cites work: Secure information release in timed automata
cites work: HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties
cites work: Model checking quantitative hyperproperties
cites work: Q3862379
cites work: Real-time logics: Complexity and expressiveness
cites work: On the decidability and complexity of Metric Temporal Logic over finite words
cites work: Q4230338
cites work: Q4608665
cites work: The stuttering principle revisited
cites work: Real-Time Synthesis is Hard!
cites work: On Communicating Finite-State Machines
cites work: Q4736872
cites work: Realizability of Real-Time Logics
cites work: Secure information flow by self-composition
cites work: Q3601411
cites work: The compound interest in relaxing punctuality
cites work: Owl: a library for \(\omega \)-words, automata, and LTL
cites work: Time-Bounded Verification
cites work: On the Expressiveness of Metric Temporal Logic over Bounded Timed Words
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Q5525343
cites work: Hybrid Systems: Computation and Control
cites work: Robust Satisfaction of Temporal Logic over Real-Valued Signals
DOI: 10.1016/J.IC.2020.104639
description: scientific article; zbMATH DE number 7398015