DeepAI AI Chat
Log In Sign Up

Bounded Model Checking for Asynchronous Hyperproperties

by   Tzu-Han Hsu, et al.

Many types of attacks on confidentiality stem from the nondeterministic nature of the environment that computer programs operate in (e.g., schedulers and asynchronous communication channels). In this paper, we focus on verification of confidentiality in nondeterministic environments by reasoning about asynchronous hyperproperties. First, we generalize the temporal logic A-HLTL to allow nested trajectory quantification, where a trajectory determines how different execution traces may advance and stutter. We propose a bounded model checking algorithm for A-HLTL based on QBF-solving for a fragment of the generalized A-HLTL and evaluate it by various case studies on concurrent programs, scheduling attacks, compiler optimization, speculative execution, and cache timing attacks. We also rigorously analyze the complexity of model checking for different fragments of A-HLTL.


page 1

page 2

page 3

page 4


Deciding Asynchronous Hyperproperties for Recursive Programs

We introduce a novel logic for asynchronous hyperproperties with a new m...

Bounded Model Checking for Hyperproperties

This paper introduces the first bounded model checking (BMC) algorithm f...

A Temporal Logic for Asynchronous Hyperproperties

Hyperproperties are properties of computational systems that require mor...

Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties

Hyperproperties are properties of systems that relate different executio...

Verification of Asynchronous Systems with an Unspecified Component

Component-based systems evolve as a new component is added or an existin...

HyperQube: A QBF-Based Bounded Model Checker for Hyperproperties

This paper presents HyperQube, a push-button QBF-based bounded model che...

LTL Model Checking of Self Modifying Code

Self modifying code is code that can modify its own instructions during ...