Sciweavers

3228 search results - page 248 / 646
» Computationally Sound Proofs
Sort
View
CN
2006
117views more  CN 2006»
15 years 6 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
IPL
2008
102views more  IPL 2008»
15 years 6 months ago
The connection between two ways of reasoning about partial functions
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
John S. Fitzgerald, Cliff B. Jones
JOLLI
2008
145views more  JOLLI 2008»
15 years 6 months ago
Temporal Languages for Epistemic Programs
This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statemen...
Joshua Sack
ENTCS
2007
129views more  ENTCS 2007»
15 years 6 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...
CORR
2000
Springer
91views Education» more  CORR 2000»
15 years 6 months ago
Multi-Agent Only Knowing
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
Joseph Y. Halpern, Gerhard Lakemeyer