335 search results - page 3 / 67 » Reasoning about Probabilistic Security Using Task-PIOAs |
CSFW
2007
IEEE
14 years 1 months ago
2007
IEEE
There has been excellent progress on languages for rigorously describing key exchange protocols and techniques for proving that the network security tunnels they establish preserv...
CSFW
2000
IEEE
14 years 17 hour ago
2000
IEEE
In this paper we develop a language of mobile agents called uPLAN for describing the capabilities of active (programmable) networks. We use a formal semantics for uPLAN to demonst...
CSFW
2003
IEEE
14 years 27 days ago
2003
IEEE
A policy describes the conditions under which an action is permitted or forbidden. We show that a fragment of (multi-sorted) first-order logic can be used to represent and reason...
CCS
2006
ACM
13 years 11 months ago
2006
ACM
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
AIPS
1996
13 years 9 months ago
1996
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...