Abstract Many types of attacks on confidentiality stem from the nondeterministic nature environment that computer programs operate in. We focus verification in environments by reasoning about asynchronous hyperproperties . generalize temporal logic to allow nested trajectory quantification, where a determines how different execution traces may advance and stutter. propose bounded model checking...

Probabilistic model checking has been developed for verifying systems that have stochastic and nondeterministic behavior. Given a probabilistic system, checker takes property checks whether or not the holds in system. For this reason, provide rigorous guarantees. So far, however, focused on propositional models where state is represented by symbol. On other hand, it commonly required to make re...

Abstract The problem of model checking procedural programs has fostered much research towards the definition temporal logics for reasoning on context-free structures. most notable such results are Nested Words, as CaRet and NWTL. Recently, logic OPTL was introduced, based class Operator Precedence Languages (OPL), more powerful than Words. We define new OPL-based POTL, provide a procedure it. P...