Temporal logics for hyperproperties
MR Clarkson, B Finkbeiner, M Koleini… - … 2014, Held as Part of the …, 2014 - Springer
Two new logics for verification of hyperproperties are proposed. Hyperproperties
characterize security policies, such as noninterference, as a property of sets of computation …
characterize security policies, such as noninterference, as a property of sets of computation …
A unified model-based framework for the simplified execution of static and dynamic assertion-based verification
The improved productivity and reduced time-to-market are essential requirements for the
development of modern embedded systems and, therefore, the comprehensive as well as …
development of modern embedded systems and, therefore, the comprehensive as well as …
A temporal logic approach to information-flow control
MN Rabe - 2016 - publikationen.sulb.uni-saarland.de
Information leaks and other violations of information security pose a severe threat to
individuals, companies, and even countries. The mechanisms by which attackers threaten …
individuals, companies, and even countries. The mechanisms by which attackers threaten …
Computation tree logic model checking based on possibility measures
Y Li, Y Li, Z Ma - Fuzzy Sets and Systems, 2015 - Elsevier
In order to deal with the systematic verification with uncertain information in possibility
theory, Li and Li (2013) introduced model checking of linear-time properties in which the …
theory, Li and Li (2013) introduced model checking of linear-time properties in which the …
Quantified CTL: expressiveness and complexity
F Laroussinie, N Markey - Logical Methods in Computer …, 2014 - lmcs.episciences.org
While it was defined long ago, the extension of CTL with quantification over atomic
propositions has never been studied extensively. Considering two different semantics …
propositions has never been studied extensively. Considering two different semantics …
Quantified mu-calculus for control synthesis
S Riedweg, S Pinchinat - International Symposium on Mathematical …, 2003 - Springer
We consider an extension of the mu-calculus as a general framework to describe and
synthesize controllers. This extension is obtained by quantifying atomic propositions, we call …
synthesize controllers. This extension is obtained by quantifying atomic propositions, we call …
Why propositional quantification makes modal logics on trees robustly hard?
Adding propositional quantification to the modal logics K, T or S4 is known to lead to
undecidability but CTL with propositional quantification under the tree semantics (QCTL t) …
undecidability but CTL with propositional quantification under the tree semantics (QCTL t) …
On binding in the spatial logics for closure spaces
We present two different extensions of the spatial logic for closure spaces (SLCS), and its
spatio-temporal variant (τ SLCS), with spatial quantification operators. The first concerns the …
spatio-temporal variant (τ SLCS), with spatial quantification operators. The first concerns the …
Quantified CTL: Expressiveness and model checking
A Da Costa, F Laroussinie, N Markey - International Conference on …, 2012 - Springer
While it was defined long ago, the extension of CTL with quantification over atomic
propositions has never been studied extensively. Considering two different semantics …
propositions has never been studied extensively. Considering two different semantics …
CTL+ FO verification as constraint solving
Expressing program correctness often requires relating program data throughout (different
branches of) an execution. Such properties can be represented using CTL+ FO, a logic that …
branches of) an execution. Such properties can be represented using CTL+ FO, a logic that …