Sciweavers

551 search results - page 88 / 111
» {log}: A Logic Programming Language with Finite Sets
Sort
View
POPL
2006
ACM
14 years 8 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
ENTCS
2010
130views more  ENTCS 2010»
13 years 8 months ago
Compositional System Security with Interface-Confined Adversaries
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
Deepak Garg, Jason Franklin, Dilsun Kirli Kaynar, ...
SIGMOD
2009
ACM
143views Database» more  SIGMOD 2009»
14 years 8 months ago
Building search applications with Marklogic Server
Keyword search is recognized as an important technique to unlocking the information found in both structured and semistructured information. With XML as the data model and XQuery ...
Ron Avnur
CCS
2004
ACM
14 years 1 months ago
Verifying policy-based security for web services
WS-SecurityPolicy is a declarative configuration language for driving web services security mechanisms. We describe a formal sefor WS-SecurityPolicy, and propose a more abstract ...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
ICFP
2008
ACM
14 years 8 months ago
Mixin' up the ML module system
ML modules provide hierarchical namespace management, as well as fine-grained control over the propagation of type information, but they do not allow modules to be broken up into ...
Derek Dreyer, Andreas Rossberg