A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
Quantitative Information Flow as Safety and Liveness Hyperproperties
2012
Electronic Proceedings in Theoretical Computer Science
We employ Clarkson and Schneider's "hyperproperties" to classify various verification problems of quantitative information flow. ...
The results of this paper unify and extend the previous results on the hardness of checking and inferring quantitative information flow. ...
based quantitative information flow is also a liveness hyperproperty. ...
doi:10.4204/eptcs.85.6
fatcat:bvqvo22bvrbmta75nnzz3nqisy
Quantitative information flow as safety and liveness hyperproperties
2014
Theoretical Computer Science
We employ Clarkson and Schneider's "hyperproperties" to classify various verification problems of quantitative information flow. ...
The results of this paper unify and extend the previous results on the hardness of checking and inferring quantitative information flow. ...
based quantitative information flow is also a liveness hyperproperty. ...
doi:10.1016/j.tcs.2013.07.031
fatcat:ofigo4ltmjeqjl6ay6m3tzgf3a
Hyperproperties
2010
Journal of Computer Security
Safety and liveness are generalized to hyperproperties, and every hyperproperty is shown to be the intersection of a safety hyperproperty and a liveness hyperproperty. ...
A verification technique for safety hyperproperties is given and is shown to generalize prior techniques for verifying secure information flow. ...
This work supported in part by AFOSR Grant F9550-06-0019, National Science Foundation Grants 0430161 and CCF-0424422 (TRUST), an Intel Foundation PhD Fellowship, and a gift from Microsoft Corporation. ...
doi:10.3233/jcs-2009-0393
fatcat:ocp6crmylbarhaok6oiz6jiwfy
Hyperproperties
2008
2008 21st IEEE Computer Security Foundations Symposium
Safety and liveness are generalized to hyperproperties, and every hyperproperty is shown to be the intersection of a safety hyperproperty and a liveness hyperproperty. ...
A verification technique for safety hyperproperties is given and is shown to generalize prior techniques for verifying secure information flow. ...
This work supported in part by AFOSR Grant F9550-06-0019, National Science Foundation Grants 0430161 and CCF-0424422 (TRUST), an Intel Foundation PhD Fellowship, and a gift from Microsoft Corporation. ...
doi:10.1109/csf.2008.7
dblp:conf/csfw/ClarksonS08
fatcat:5m3p4r2gtneh5ch6w67fw6lalu
Model Checking Quantitative Hyperproperties
[chapter]
2018
Lecture Notes in Computer Science
Our Max#Sat-based prototype implementation demonstrates, however, that the counting approach is viable on systems with nontrivial quantitative information flow requirements such as a passcode checker. ...
In this paper, we study quantitative hyperproperties, which we define as hyperproperties that express a bound on the number of traces that may appear in a certain relation. ...
A classification of quantitative information-flow policies as safety and liveness hyperproperties was given in [46] . ...
doi:10.1007/978-3-319-96145-3_8
fatcat:nfpe3fzvhnduvl45fdcrlqw27y
Temporal Logics for Hyperproperties
[chapter]
2014
Lecture Notes in Computer Science
Standard temporal logics such as LTL, CTL, and CTL * can refer only to a single path at a time, hence cannot express many hyperproperties of interest. ...
Two new logics for verification of hyperproperties are proposed. Hyperproperties characterize security policies, such as noninterference, as a property of sets of computation paths. ...
GNI is a liveness hyperproperty and can be expressed as follows: ∀π.∀π . ...
doi:10.1007/978-3-642-54792-8_15
fatcat:wluatmohezcrfkppa6722d75ke
HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties
[article]
2018
arXiv
pre-print
Probabilistic hyperproperties express quantitative dependencies between such executions. ...
., PCTL and PCTL* can refer only to a single path at a time and, hence, cannot express many probabilistic hyperproperties of interest. ...
We also show that HyperPCTL can express requirements such as differential privacy, quantitative information flow, and probabilistic causation (a.k.a. causality). ...
arXiv:1804.01853v1
fatcat:qpj2jormfvfpnhucsfmvop2saq
Temporal Logics for Hyperproperties
[article]
2014
arXiv
pre-print
Standard temporal logics such as LTL, CTL, and CTL* can refer only to a single path at a time, hence cannot express many hyperproperties of interest. ...
Two new logics for verification of hyperproperties are proposed. Hyperproperties characterize security policies, such as noninterference, as a property of sets of computation paths. ...
We thank him, Rance Cleaveland, Rayna Dimitrova, Dexter Kozen, José Meseguer, and Moshe Vardi for discussions about this work. Adam Hinz worked on an early prototype of the model checker. ...
arXiv:1401.4492v2
fatcat:rioaoogizzfchc2l6wyboqfwpe
A Temporal Logic for Hyperproperties
[article]
2013
arXiv
pre-print
We show that the quantification over paths naturally subsumes other extensions of temporal logic with operators for information flow and knowledge. ...
Hyperproperties, as introduced by Clarkson and Schneider, characterize the correctness of a computer program as a condition on its set of computation paths. ...
The technique of self-composition [5] can be used to cast the verification of these information flow properties in terms of safety (and sometimes in terms of liveness) problems [33, 38] by modifying ...
arXiv:1306.6657v1
fatcat:ktb4zyao6fdttpdrvawcucos5e
Verification of Hyperproperties for Uncertain Dynamical Systems via Barrier Certificates
[article]
2021
arXiv
pre-print
Hyperproperties can express several specifications of interest for cyber-physical systems--such as opacity, robustness, and noninterference--which cannot be expressed using linear-time properties. ...
We demonstrate the effectiveness of our proposed approaches on two physical case studies against two important hyperproperties: initial-state opacity and initial-state robustness. ...
and liveness. ...
arXiv:2105.05493v2
fatcat:3kuup5f23nhbpdqoef744tsgja
Information-Flow Interfaces
[article]
2020
arXiv
pre-print
Finally, we provide three plausible trace semantics to stateful information-flow interfaces and we show that only two correspond to temporal logics for specifying hyperproperties, while the third defines ...
security properties, thus paving the way for a science of safety and security co-engineering. ...
MIT press, 2003.
17 Bernd Finkbeiner, Christopher Hahn, and Hazem Torfah. Model checking quantitative
hyperproperties. ...
arXiv:2002.06465v3
fatcat:qndy4q57y5c2dodmymkv63acei
A Survey of Challenges for Runtime Verification from Advanced Application Domains (Beyond Software)
[article]
2018
arXiv
pre-print
Other activities involve the instrumentation of the system to generate the trace and the communication between the system under analysis and the monitor. ...
Typically, the two main activities in runtime verification efforts are the process of creating monitors from specifications, and the algorithms for the evaluation of traces against the generated monitors ...
The authors would like to thank Fonenantsoa Maurica and Pablo Picazo-Sanchez for their feedback on parts of a preliminary version of this document. ...
arXiv:1811.06740v1
fatcat:4bxx5tvfpzez3jidsj22flibv4
A survey of challenges for runtime verification from advanced application domains (beyond software)
2019
Formal methods in system design
Other activities involve the instrumentation of the system to generate the trace and the communication between the system under analysis and the monitor. ...
Typically, the two main activities in runtime verification efforts are the process of creating monitors from specifications, and the algorithms for the evaluation of traces against the generated monitors ...
, comments and criticism. ...
doi:10.1007/s10703-019-00337-w
fatcat:6vu5odqyjjbkvf255bsxcchane
Secure information flow by self-composition
2011
Mathematical Structures in Computer Science
A common means to enforce secure information flow is through information flow type systems. ...
Self-composition enables the use of standard techniques for information flow policies verification, such as program logics and model checking, suitable in Proof Carrying Code infrastructures. ...
More recently, Yasuoka and Terauchi (2010) have explored the possibility of expressing quantitative information flow policies as k-safety properties. ...
doi:10.1017/s0960129511000193
fatcat:wz2lck47dfelhi753kr5z5ijue
Explainable Software for Cyber-Physical Systems (ES4CPS): Report from the GI Dagstuhl Seminar 19023, January 06-11 2019, Schloss Dagstuhl
[article]
2019
arXiv
pre-print
The goal of this seminar was to serve as a starting point for an interdisciplinary coordination of research activities targeting ES4CPS and an incubator of a new research community around this topic. ...
engineering, and related fields have to be applied, combined, and researched further. ...
(GI, German Society for Informatics) and Schloss Dagstuhl for partially funding this seminar. ...
arXiv:1904.11851v1
fatcat:r2r5ac6hmnel3f6weiynjwunni
« Previous
Showing results 1 — 15 out of 31 results