Sciweavers

733 search results - page 118 / 147
» Formal Reasoning About Intrusion Detection Systems
Sort
View
CCS
2009
ACM
16 years 11 days ago
Confidentiality-preserving distributed proofs of conjunctive queries
Distributed proof construction protocols have been shown to be valuable for reasoning about authorization decisions in open distributed environments such as pervasive computing sp...
Adam J. Lee, Kazuhiro Minami, Nikita Borisov
POPL
2003
ACM
15 years 5 months ago
From control effects to typed continuation passing
First-class continuations are a powerful computational effect, allowing the programmer to express any form of jumping. Types and effect systems can be used to reason about contin...
Hayo Thielecke
POPL
1998
ACM
15 years 4 months ago
Higher-Order unCurrying
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
John Hannan, Patrick Hicks
JAR
2000
145views more  JAR 2000»
14 years 11 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
FMLDO
1999
Springer
137views Database» more  FMLDO 1999»
15 years 4 months ago
Federated Transaction Management with Snapshot Isolation
Federated transaction management (also known as multidatabase transaction management in the literature) is needed to ensure the consistency of data that is distributed across mult...
Ralf Schenkel, Gerhard Weikum, Norbert Weiße...