The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Temporal Logics for Hyperproperties
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The temporal logic of programs
Pnueli, A. (1977) · 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) · doi:10.1109/sfcs.1977.32 · Cited by 5,689
Holzmann, G. J. (1997) · IEEE Transactions on Software Engineering · doi:10.1109/32.588521 · Cited by 3,803
(1994) · Mathematical Social Sciences · doi:10.1016/0165-4896(94)90005-1 · Cited by 3,517
The Temporal Logic of Reactive and Concurrent Systems
Manna, Z., & Pnueli, A. (1992) · Springer eBooks · doi:10.1007/978-1-4612-0931-7 · Cited by 2,958
Fagin, R., Halpern, J. Y., Moses, Y., & Vardi, M. (1995) · The MIT Press eBooks · doi:10.7551/mitpress/5803.001.0001 · Cited by 2,610
Security Policies and Security Models
Goguen, J. A., & Meseguer, J. (1982) · 1982 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1982.10014 · Cited by 2,119
Theory of Recursive Functions and Effective Computability
Rogers, J. H. (1987) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,998
Language-based information-flow security
Sabelfeld, A., & Myers, A. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.806121 · Cited by 1,907
The Temporal Logic of Reactive and Concurrent Systems: Specification
Pnueli, A., & Manna, Z. (1991) · Cited by 1,352
Proving the Correctness of Multiprocess Programs
Lamport, L. (1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.229904 · Cited by 1,138
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
Clarke, E. M., & Emerson, E. A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69850-0_12 · Cited by 1,070
JFlow: practical mostly-static information flow control
Myers, A. C. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292561 · Cited by 1,034
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Emerson, E. A., & Halpern, J. Y. (1986) · Journal of the ACM · doi:10.1145/4904.4999 · Cited by 1,009
Remote timing attacks are practical
Brumley, D., & Boneh, D. (2005) · Computer Networks · doi:10.1016/j.comnet.2005.01.010 · Cited by 871
Reasoning about Infinite Computations
Vardi, M. Y., & Wolper, P. (1994) · Information and Computation · doi:10.1006/inco.1994.1092 · Cited by 795
Simple On-the-fly Automatic Verification of Linear Temporal Logic
Gerth, R., Peled, D., Vardi, M. Y., & Wolper, P. (1996) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-34892-6_1 · Cited by 705
An automata-theoretic approach to linear temporal logic
Vardi, M. Y. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60915-6_6 · Cited by 660
An automata-theoretic approach to branching-time model checking
Kupferman, O., Vardi, M. Y., & Wolper, P. (2000) · Journal of the ACM · doi:10.1145/333979.333987 · Cited by 614
On the Foundations of Quantitative Information Flow
Smith, G. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00596-1_21 · Cited by 570
Clarkson, M. R., & Schneider, F. B. (2010) · Journal of Computer Security · doi:10.3233/jcs-2009-0393 · Cited by 418
Self-citationAn information-theoretic model for adaptive side-channel attacks
Köpf, B., & Basin, D. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315282 · Cited by 365
A general theory of composition for trace sets closed under selective interleaving functions
McLean, J. (2002) · Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1994.296590 · Cited by 324
Opacity generalised to transition systems
Bryans, J. W., Koutny, M., Mazaré, L., & Ryan, P. Y. A. (2008) · International Journal of Information Security · doi:10.1007/s10207-008-0058-x · Cited by 315
Secure Information Flow as a Safety Problem
Terauchi, T., & Aiken, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11547662_24 · Cited by 282
Observational determinism for concurrent program security
Zdancewic, S., & Myers, A. C. (2004) · 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings. · doi:10.1109/csfw.2003.1212703 · Cited by 270
Dimensions and Principles of Declassification
Sabelfeld, A., & Sands, D. (2005) · 18th IEEE Computer Security Foundations Workshop (CSFW'05) · doi:10.1109/csfw.2005.15 · Cited by 263
Noninterference and the composability of security properties
McCullough, D. (2003) · Proceedings. 1988 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.1988.8110 · Cited by 261
CSP and determinism in security modelling
Roscoe, A. W. (2002) · Proceedings 1995 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.1995.398927 · Cited by 210
Hammer, C., & Snelting, G. (2009) · International Journal of Information Security · doi:10.1007/s10207-009-0086-1 · Cited by 207
A Model for Delimited Information Release
Sabelfeld, A., & Myers, A. C. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-37621-7_9 · Cited by 196
Secure information flow by self-composition
Barthe, G., D'Argenio, P. R., & Rezk, T. (2004) · Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004. · doi:10.1109/csfw.2004.1310735 · Cited by 177
Secure information flow by self-composition
BARTHE, G., D'ARGENIO, P. R., & REZK, T. (2011) · Mathematical Structures in Computer Science · doi:10.1017/s0960129511000193 · Cited by 168
Quantitative Analysis of the Leakage of Confidential Data
Clark, D., Hunt, S., & Malacaria, P. (2002) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)00290-7 · Cited by 167
Possibilistic definitions of security-an assembly kit
Mantel, H. (2002) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2000.856936 · Cited by 152
Stack-based access control and secure information flow
Banerjee, A., & Naumann, D. A. (2005) · Journal of Functional Programming · doi:10.1017/s0956796804005453 · Cited by 141
A hookup theorem for multilevel security
McCullough, D. (1990) · IEEE Transactions on Software Engineering · doi:10.1109/32.55085 · Cited by 116
Halpern, J. Y., & O'Neill, K. R. (2008) · ACM Transactions on Information and System Security · doi:10.1145/1410234.1410239 · Cited by 115
Proving Noninterference and Functional Correctness Using Traces
McLean, J. (1992) · Journal of Computer Security · doi:10.3233/jcs-1992-1103 · Cited by 111
Information Flow Analysis in Logical Form
Amtoft, T., & Banerjee, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27864-1_10 · Cited by 96
Preserving Secrecy Under Refinement
Rajeev Alur, A., Černý, P., & Zdancewic, S. (2006) · Lecture notes in computer science · doi:10.1007/11787006_10 · Cited by 90
Flow Locks: Towards a Core Calculus for Dynamic Flow Policies
Broberg, N., & Sands, D. (2006) · Lecture notes in computer science · doi:10.1007/11693024_13 · Cited by 81
Opacity Generalised to Transition Systems
Bryans, J. W., Koutny, M., Mazaré, L., & Ryan, P. Y. A. (2006) · Lecture notes in computer science · doi:10.1007/11679219_7 · Cited by 78
A Temporal Logic Characterisation of Oservational Determinism
Huisman, M., Worah, P., & Sunesen, K. (2006) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2006.6 · Cited by 76
Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification
Barthe, G., Crespo, J. M., & Kunz, C. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-35722-0_3 · Cited by 70
Epistemic temporal logic for information flow security
Balliu, M., Dam, M., & Guernic, G. L. (2011) · ACM Workshop on Programming Languages and Analysis for Security · doi:10.1145/2166956.2166962 · Cited by 56
A Semantic Framework for Declassification and Endorsement
Askarov, A., & Myers, A. C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11957-6_5 · Cited by 41
On Bounding Problems of Quantitative Information Flow
Yasuoka, H., & Terauchi, T. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15497-3_22 · Cited by 19
Preservation of epistemic properties in security protocol implementations
van der Meyden, R., & Wilke, T. (2007) · doi:10.1145/1324249.1324278 · Cited by 16
Towards Incrementalization of Holistic Hyperproperties
Milushev, D., & Clarke, D. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28641-4_18 · Cited by 14
Cited by
Evaluating Large Language Models Trained on Code
Chen, M., Tworek, J., Jun, H., Yuan, Q., Pinto, H. P. D. O., Kaplan, J., Edwards, H., Burda, Y., Joseph, N., Brockman, G., et al. (2021) · arXiv · doi:10.48550/arxiv.2107.03374 · Cited by 1,436
Metadata
- Authors
- Clarkson, M. R., Finkbeiner, B., Koleini, M., Micinski, K. K., Rabe, M. N., & Sánchez, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2014
- Pages
- 265-284
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2964335063
- Cited by
- 270
- References
- 49
- FWCI
- 10.74
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.