Sciweavers

641 search results - page 49 / 129
» Formal Reliability Analysis Using Theorem Proving
Sort
View
SIGIR
2006
ACM
15 years 8 months ago
Formal models for expert finding in enterprise corpora
Searching an organization’s document repositories for experts provides a cost effective solution for the task of expert finding. We present two general strategies to expert se...
Krisztian Balog, Leif Azzopardi, Maarten de Rijke
111
Voted
TCC
2007
Springer
124views Cryptology» more  TCC 2007»
15 years 8 months ago
Tackling Adaptive Corruptions in Multicast Encryption Protocols
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
Saurabh Panjwani
CSFW
1999
IEEE
15 years 6 months ago
Athena: A New Efficient Automatic Checker for Security Protocol Analysis
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
Dawn Xiaodong Song
CONTEXT
2003
Springer
15 years 7 months ago
On the Difference between Bridge Rules and Lifting Axioms
Abstract. In a previous paper, we proposed a first formal and conceptual comparison between the two most important formalizations of context in AI: Propositional Logic of Context ...
Paolo Bouquet, Luciano Serafini
ASM
2008
ASM
15 years 4 months ago
Model Checking Event-B by Encoding into Alloy
As systems become ever more complex, verification becomes more main stream. Event-B and Alloy are two formal specification languages based on fairly different methodologies. While...
Paulo J. Matos, João Marques-Silva