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
Testing noninterference, quickly
2013
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming - ICFP '13
Preserved Fulltext
Taken together, our best methods enable us to quickly and automatically generate simple counterexamples for all these bugs. ...
We find that both sophisticated strategies for generating well-distributed random programs and readily falsifiable formulations of noninterference properties are critically important. ...
The question we address in this paper is: Can we use modern testing techniques to discover bugs in IFC enforcement mechanisms quickly and effectively? ...
doi:10.1145/2500365.2500574
dblp:conf/icfp/HritcuHPSVAL13
fatcat:xg5leydmkfa3tjv6snaufbm2xe
Testing noninterference, quickly
2016
Journal of functional programming
Preserved Fulltext
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.
Other Versions
Moreover, we show how testing guides the discovery of the sophisticated invariants needed for the noninterference proof of our most complex machine. ...
We find that both sophisticated strategies for generating well-distributed random programs and readily falsifiable formulations of noninterference properties are critically important for efficient testing ...
The question we address in this paper is: Can we use modern testing techniques to discover bugs in IFC enforcement mechanisms quickly and effectively? ...
doi:10.1017/s0956796816000058
fatcat:qyjrtvt6grhrnj3yd4hrebdgci
Testing noninterference, quickly
2013
SIGPLAN notices
Preserved Fulltext
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.
Taken together, our best methods enable us to quickly and automatically generate simple counterexamples for all these bugs. ...
We find that both sophisticated strategies for generating well-distributed random programs and readily falsifiable formulations of noninterference properties are critically important. ...
The question we address in this paper is: Can we use modern testing techniques to discover bugs in IFC enforcement mechanisms quickly and effectively? ...
doi:10.1145/2544174.2500574
fatcat:7emv7ekrwrep3jrsplqe7mu7wa
Foundational Property-Based Testing
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
NONINTERFERENCE, QUICKLY Can we quickcheck noninterference? ...
public first-class labels, flow sensitive analysis • Used property-based testing to design novel highly-permissive dynamic IFC mechanism discover complex invariants of noninterference proof -Coq proof ...
doi:10.1007/978-3-319-22102-1_22
fatcat:l6lcgibxxndifgdvphyw4s6aou
Insula and Orbital Frontal Cortex Activity Underlying Emotion Interference Resolution in Working Memory
2010
Journal of Cognitive Neuroscience
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Follow-up paired ¢ tests indicate that the interaction is due to significantly greater BOLD responses for emo- tion interference than for noninterference trials only in the negative valence session, /( ...
Follow-up paired ¢ tests indicate that the interaction is due to signifi- cantly greater BOLD responses for emotion interference than for noninterference trials only in the negative valence session, (( ...
doi:10.1162/jocn.2010.21428
pmid:20044897
fatcat:bg2ymg5k7zeivggtb6oo3twxoa
Understanding and Enforcing Opacity
2015
2015 IEEE 28th Computer Security Foundations Symposium
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We present a framework for opacity and explore its key differences and formal connections with such well-known information-flow models as noninterference, knowledge-based security, and declassification ...
We report on experiments with prototypes that utilize state-of-the-art Satisfiability Modulo Theories (SMT) solvers and the random testing tool QuickCheck to establish opacity for the location and aggregation-based ...
In our implementation, S is constructed using the random testing tool QuickCheck [16] , as detailed in Section VII. ...
doi:10.1109/csf.2015.41
dblp:conf/csfw/SchoepeS15
fatcat:orel3lewbbg5zkb6kwpogib7b4
Checking noninterference in Timed CSP
2012
Formal Aspects of Computing
Preserved Fulltext
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.
While we frequently use termination ( ) and sequential composition in building process descriptions, the processes we test for noninterference will never terminate. ...
This examined a variety of timed models of CSP-like processes and explored how established noninterference theories extended to them. ...
From these case studies we can conclude that timed noninterference can be decided, at least on small examples, quickly and efficiently. ...
doi:10.1007/s00165-012-0251-6
fatcat:4s5qxspvefhxnchfffuvl373kq
The Effect of Age on Rule-Based Category Learning
2006
Aging, Neuropsychology and Cognition
Preserved Fulltext
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.
Thus, we also performed an additional set of analyses on the test session data after excluding all studied items (both interference and noninterference). ...
However, it is possible that this representation is not actively maintained in working memory in a manner that allows them to apply the rule quickly and accurately. ...
doi:10.1080/13825580600574377
pmid:16887781
fatcat:fja76n6xsne7lpswdvqfoxkpye
It's Time for Trustworthy Systems
2012
IEEE Security and Privacy
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
We expect to see full proofs of noninterference for seL4-based systems in the next one to two years, based on the noninterference theorem for seL4.
What about Safety? ...
These proofs combine into the classic security property of noninterference. ...
doi:10.1109/msp.2012.41
fatcat:kquvoyomjnchpfo25vfzpatcha
Secure information flow with random assignment and encryption
2006
Proceedings of the fourth ACM workshop on Formal methods in security - FMSE '06
Preserved Fulltext
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.
We argue that well-typed, polynomial-time programs in our system satisfy a computational probabilistic noninterference property, provided that the encryption scheme is IND-CCA secure. ...
We establish a result that may be of independent interest, namely, that well-typed, probabilistically total programs with random assignments satisfy probabilistic noninterference. ...
Moreover, A runs about as quickly as B. Proof. The proof is quite similar to that of Theorem 4.1. ...
doi:10.1145/1180337.1180341
dblp:conf/ccs/Smith06
fatcat:dfkqjejy5fffbo74gyclcbyosa
Exploring and enforcing security guarantees via program dependence graphs
2015
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Policies are separate from the code and do not interfere with testing or development, and can be used for security regression testing. ...
Most importantly, PIDGIN can test information-flow properties (e.g., noninterference) which are not testable by a single test case. ...
Micro-benchmark Results For many tests the policy is a simply noninterference, requiring that sensitive values from an HTTP request do not affect public output. ...
doi:10.1145/2813885.2737957
fatcat:4alqx3rm2zhfth32mik2a7jzxu
Exploring and enforcing security guarantees via program dependence graphs
2015
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Policies are separate from the code and do not interfere with testing or development, and can be used for security regression testing. ...
Most importantly, PIDGIN can test information-flow properties (e.g., noninterference) which are not testable by a single test case. ...
Micro-benchmark Results For many tests the policy is a simply noninterference, requiring that sensitive values from an HTTP request do not affect public output. ...
doi:10.1145/2737924.2737957
dblp:conf/pldi/JohnsonWMC15
fatcat:u3lzwtwub5gsrje6mcd35s36em
Surface form and memory in question answering
1982
Cognitive Psychology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
For the Noninterference group the question and picture always occurred in immediate succession as in Experiment 1, and subjects were instructed to answer as quickly as possible. ...
These coefficients and the results of the significance tests are given in Table 10 , which also contains these data for the Noninterference Group. ...
doi:10.1016/0010-0285(82)90005-6
fatcat:66dkihnw2vcgnolrfxtofplplu
Symbolic algorithmic verification of intransitive generalized noninterference
2011
Science China Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Next, we propose an algorithmic verification technique to check intransitive generalized noninterference. ...
Generalized noninterference can be used to formulate transitive security policies, but is unsuitable for intransitive security policies. ...
the system does not satisfy noninterference. ...
doi:10.1007/s11432-011-4372-y
fatcat:5evdkrrpfvhnjff6hem3j4yhmu
Formal Framework For Mils Integration
2016
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
These extensions enable the reasoning at an abstract level built on top of noninterference, at a much finer level than allowed by base noninterference. ...
In the third chapter of this document, we extend Rushby's model of noninterference with explicit between-domain information transfer, as well as programs that determine domain behaviour. ...
[GWV03] as a similar test of their own separation kernel formalisation, and further studied by Rushby [Rus04] and Van der Meyden [dM10] . ...
doi:10.5281/zenodo.57413
fatcat:mvqqomtiafcfxmyb3fkaagor6q
« Previous
Showing results 1 — 15 out of 1,477 results