Sciweavers

3658 search results - page 616 / 732
» The logic of proofs, semantically
Sort
View
TDM
2004
203views Database» more  TDM 2004»
13 years 9 months ago
Relational Algebra: Mother Tongue - XQuery: Fluent
This work may be seen as a further proof of the versatility of the relational database model. Here, we add XQuery to the catalog of languages which RDBMSs are able to "speak&...
Torsten Grust, Jens Teubner
IWFM
2003
13 years 9 months ago
Using Admissible Interference to Detect Denial of Service Vulnerabilities
Meadows recently proposed a formal cost-based framework for analysis of denial of service. It was showed how some principles that have already been used to make cryptographic prot...
Stéphane Lafrance, John Mullins
CN
2006
117views more  CN 2006»
13 years 8 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance
ENTCS
2007
121views more  ENTCS 2007»
13 years 8 months ago
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract)
ly positive maps (extended abstract) Peter Selinger 1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories ...
Peter Selinger
SP
2008
IEEE
162views Security Privacy» more  SP 2008»
13 years 8 months ago
Fable: A Language for Enforcing User-defined Security Policies
This paper presents FABLE, a core formalism for a programming language in which programmers may specify security policies and reason that these policies are properly enforced. In ...
Nikhil Swamy, Brian J. Corcoran, Michael Hicks