Sciweavers

3384 search results - page 107 / 677
» More Testable Properties
Sort
View
CSFW
2009
IEEE
14 years 23 days ago
Specification and Analysis of Dynamic Authorisation Policies
This paper presents a language, based on transaction logic, for specifying dynamic authorisation policies, i.e., rules governing actions that may depend on and update the authoris...
Moritz Y. Becker
RTA
2010
Springer
14 years 22 days ago
Simulation in the Call-by-Need Lambda-Calculus with letrec
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
Manfred Schmidt-Schauß, David Sabel, Elena M...
CSFW
2004
IEEE
14 years 18 days ago
Enforcing Robust Declassification
Noninterference requires that there is no information flow from sensitive to public data in a given system. However, many systems perform intentional release of sensitive informat...
Andrew C. Myers, Andrei Sabelfeld, Steve Zdancewic
AAAI
2008
13 years 11 months ago
New Compilation Languages Based on Structured Decomposability
We introduce in this paper two new, complete propositional languages and study their properties in terms of (1) their support for polytime operations and (2) their ability to repr...
Knot Pipatsrisawat, Adnan Darwiche
CCS
2008
ACM
13 years 11 months ago
Computational soundness of observational equivalence
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
Hubert Comon-Lundh, Véronique Cortier